The complete axiomatization of Cs-congruence

15Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The coupled simulation equivalence is slightly larger than observation equivalence. Where observation equivalence is based on weak bisimulations, coupled simulation equivalence is based on pairs of simulations which coincide at stable states. We establish the corresponding congruence and provide a complete axiomatization by adding a new τ-law, τ.(τ. P + Q) = τ P + Q, to the axiomatization of observation congruence. We further indicate how the definition of the equivalence can be extended to divergent transition systems.

Cite

CITATION STYLE

APA

Parrow, J., & Sjödin, P. (1994). The complete axiomatization of Cs-congruence. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 775 LNCS, pp. 557–568). Springer Verlag. https://doi.org/10.1007/3-540-57785-8_171

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free