A Complete Axiomatization of Simulation for Regular CCS Expressions

Ulrik Frendrup
Jesper Nyholm Jensen

June 2001


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

Available as PostScript, PDF, DVI.


Last modified: 2003-06-08 by webmaster.