Ready to preorder: an algebraic and general proof



Downloads per month over past year

Frutos Escrig, David de and Gregorio Rodríguez, Carlos and Palomino, Miguel (2009) Ready to preorder: an algebraic and general proof. Journal of Logic and Algebraic Programming, 78 (7). pp. 539-551. ISSN 1567-8326

[thumbnail of Frutos08oficial.pdf] PDF
Restringido a Repository staff only


Official URL:


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.

Item Type:Article
Additional Information:

The 19th Nordic Workshop on Programming Theory (NWPT 2007)

Uncontrolled Keywords:Process algebra; Semantic equivalence; Semantic preorder; Axiomatization; Linear-time branching-time spectrum
Subjects:Sciences > Computer science
ID Code:20669
Deposited On:05 Apr 2013 10:59
Last Modified:10 Aug 2018 08:22

Origin of downloads

Repository Staff Only: item control page