RT Journal Article
T1 Ready to preorder: an algebraic and general proof
A1 Frutos Escrig, David De
A1 Gregorio Rodríguez, Carlos
A1 Palomino Tarjuelo, Miguel
AB There have been quite a few proposals for behavioural equivalences for concurrent processes, and many of them are presented in Van Glabbeek’s linear time-branching time spectrum. Since their original definitions are based on rather different ideas, proving general properties of them all would seem to require a case-by-case study. However, the use of their axiomatizations allows a uniform treatment that might produce general proofs of those properties. Recently Aceto, Fokkink and Ingólfsdóttir have presented a very interesting result: for any process preorder coarser than the ready simulation in the linear time-branching time spectrum they show how to get an axiomatization of the induced equivalence. Unfortunately, their proof is not uniform and requires a case-by-case analysis. Following the algebraic approach suggested above, in this paper we present a much simpler proof of that result which, in addition, is more general and totally uniform, so that it does not need to consider one by one the different semantics in the spectrum.
PB Elsevier
SN 1567-8326
YR 2009
FD 2009
LK https://hdl.handle.net/20.500.14352/50548
UL https://hdl.handle.net/20.500.14352/50548
LA eng
NO Frutos Escrig, D., Gregorio Rodríguez, C. & Palomino Tarjuelo, M. «Ready to Preorder: An Algebraic and General Proof». The Journal of Logic and Algebraic Programming, vol. 78, n.o 7, agosto de 2009, pp. 539-51. DOI.org (Crossref), https://doi.org/10.1016/j.jlap.2008.09.001.
NO The 19th Nordic Workshop on Programming Theory (NWPT 2007)
NO Ministerio de Educación, Formación Profesional y Deportes (España)
DS Docta Complutense
RD 12 abr 2025