Article ID Journal Published Year Pages File Type
423103 Electronic Notes in Theoretical Computer Science 2006 17 Pages PDF
Abstract

We present congruence formats for η- and rooted η-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.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics