Divide and Congruence Applied to \it eta-Bisimulation

W.J. Fokkink, R.J. van Glabbeek, P. de Wind

Research output: Contribution to JournalArticleAcademicpeer-review


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. © 2006 Elsevier B.V. All rights reserved.
Original languageEnglish
Pages (from-to)97-113
JournalElectronic Notes in Theoretical Computer Science
Publication statusPublished - 2006

Bibliographical note

Proceedings title: Proceedings of the Second Workshop on Structural Operational Semantics (SOS 2005)
Publisher: Elsevier


Dive into the research topics of 'Divide and Congruence Applied to \it eta-Bisimulation'. Together they form a unique fingerprint.

Cite this