Divide and congruence applied to \(\eta\)-bisimulation. (English) Zbl 1273.68257
Mosses, Peter (ed.) et al., Proceedings of the 2nd workshop on structural operational semantics (SOS 2005), Lisbon, Portugal, July 10, 2005. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 156, No. 1, 97-113 (2006).
Summary: We present congruence formats for \(\eta\)- and rooted \(\eta\)-bisimulation equivalence. These formats are derived using a method for decomposing modal formulas in process algebra. To decide whether a process algebra term satisfies a modal formula, one can check whether its subterms satisfy formulas that are obtained by decomposing the original formula. The decomposition uses the structural operational semantics that underlies the process algebra.
For the entire collection see [Zbl 1272.68031].
For the entire collection see [Zbl 1272.68031].
MSC:
| 68Q85 | Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) |
| 68Q55 | Semantics in the theory of computing |
