A Complete Axiomatization of Simulation for Regular CCS Expressions

Ulrik Frendrup, Jesper Nyholm Jensen

Abstract


This paper gives axiomatizations of strong and weak simulation over regular CCS expressions. The proof of completeness of the axiomatization of strong simulation is inspired by Milner's proof of completeness of his axiomatization for strong equivalence over regular CCS expressions. Soundness and completeness of the axiomatization for weak simulation is easily deduced from the corresponding result for the axiomatization of strong simulation over regular CCS expressions.

Full Text:

PDF


DOI: http://dx.doi.org/10.7146/brics.v8i26.21686
This website uses cookies to allow us to see how the site is used. The cookies cannot identify you or any content at your own computer.
OK


ISSN: 0909-0878 

Hosted by the Royal Danish Library and Aarhus University Library