Divide and Congruence: From Decomposition of Modal Formulas to Preservation of Branching and η-Bisimilarity

Select |




Print


Fokkink, Wan; van Glabbeek, Robert; de Wind, Paulien

Fokkink, Wan; van Glabbeek, Robert; de Wind, Paulien


2012-05-01


Journal Article


Information and Computation (I&C)


214


59-85


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 two weak and rooted weak semantics: branching and -bisimilarity.


Concurrency, Structural Operational Semantics, Compositionality, Congruence, Branching Bisimulation, Modal Logic, Modal Decomposition.


http://www.cse.unsw.edu.au/~rvg/pub/dc-branching.pdf


0890-5401


nicta:4930


Fokkink, Wan; van Glabbeek, Robert; de Wind, Paulien. Divide and Congruence: From Decomposition of Modal Formulas to Preservation of Branching and η-Bisimilarity. Information and Computation (I&C). 2012-05-01; 214:59-85.



Loading citation data...

Citation counts
(Requires subscription to view)