Divide and congruence applied to -bisimulation

MaRDI QIDQ2852097zbMATH OpenFDO

Authors Paulien de Wind, Wan Fokkink, Rob van Glabbeek

Publication date 7 October 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066106002192

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Divide and congruence: from decomposition of modal formulas to preservation of branching and -bisimilarity
• Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation
• Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity
• Divide and congruence. II: Delay and weak bisimilarity
• Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence

Cited in

(6)

• Divide and congruence: from decomposition of modal formulas to preservation of branching and -bisimilarity
• A precongruence format for should testing preorder
• On cool congruence formats for weak bisimulations
• SOS formats and meta-theory: 20 years after
• Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation
• Notes on generative probabilistic bisimulation

This page was built for publication: Divide and congruence applied to \(\eta\)-bisimulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2852097)