A Complete Axiomatization of Simulation for Regular CCS Expressions
DOI:
https://doi.org/10.7146/brics.v8i26.21686Abstract
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.Downloads
Published
2001-06-04
How to Cite
Frendrup, U., & Jensen, J. N. (2001). A Complete Axiomatization of Simulation for Regular CCS Expressions. BRICS Report Series, 8(26). https://doi.org/10.7146/brics.v8i26.21686
Issue
Section
Articles
License
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.