Ready to Preorder: The Case of Weak Process Semantics

Select |




Print


Chen, Taolue; Fokkink, Wan; van Glabbeek, Robert

Chen, Taolue; Fokkink, Wan; van Glabbeek, Robert


2008-12-31


Journal Article


Information Processing Letters


109


2


104-111


Recently, Aceto, Fokkink lfsdttir proposed an algorithm to turn any sound and complete axiomatisation of any preorder listed in the linear time branching time spectrum at least as coarse as the ready simulation preorder, into a sound and complete axiomatisation of the corresponding equivalenceits kernel. Moreover, if the former axiomatisation is -complete, so is the latter. Subsequently, de Frutos Escrig, Gregorio Rodrguez -law. This makes it applicable to all 87 preorders surveyed in "the linear time branching time spectrum II" that are at least as coarse as the ready simulation preorder. We also extend the scope of the algorithm to infinite processes, by adding recursion constants. As an application of both extensions, we provide a complete axiomatisation of the CSP failures equivalence for BCCS processes with divergence.


process algebra, semantic equivalences and preorders, equational axiomatisations, ω-completeness; failures equivalence


http://www.cse.unsw.edu.au/~rvg/pub/equational.pdf


0020-0190


nicta:773


Chen, Taolue; Fokkink, Wan; van Glabbeek, Robert. Ready to Preorder: The Case of Weak Process Semantics. Information Processing Letters. 2008-12-31; 109(2):104-111.



Loading citation data...

Citation counts
(Requires subscription to view)