We present a method for decomposing modal formulas for processes with the internal action τ. 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. We use this decomposition method to derive congruence formats for branching and rooted branching bisimulation equivalence.
Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation
W. Fokkink,R. V. Glabbeek,Paulien de Wind
Published 2005 in Formal Methods for Components and Objects
ABSTRACT
PUBLICATION RECORD
- Publication year
2005
- Venue
Formal Methods for Components and Objects
- Publication date
2005-11-01
- Fields of study
Mathematics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-24 of 24 references · Page 1 of 1
CITED BY
Showing 1-12 of 12 citing papers · Page 1 of 1