Divide and congruence: from decomposition of modal formulas to preservation of branching and -bisimilarity
From MaRDI portal
Publication:418189
DOI10.1016/J.IC.2011.10.011zbMATH Open1277.68182OpenAlexW2042676555MaRDI QIDQ418189FDOQ418189
Authors: Paulien de Wind, Wan Fokkink, Rob van Glabbeek 
Publication date: 24 May 2012
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2011.10.011
Recommendations
- Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation
- Divide and congruence applied to \(\eta\)-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
Modal logic (including the logic of norms) (03B45) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- The well-founded semantics for general logic programs
- Higher-level synchronising devices in Meije-SCCS
- Structured operational semantics and bisimulation as a congruence
- A structural approach to operational semantics
- Process algebra for synchronous communication
- Algebraic laws for nondeterminism and concurrency
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bisimulation can't be traced
- Structural operational semantics for weak bisimulations
- \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules
- Title not available (Why is that?)
- Branching time and abstraction in bisimulation semantics
- The meaning of negative premises in transition system specifications. II
- Three logics for branching bisimulation
- Branching bisimilarity is an equivalence indeed!
- Rooted branching bisimulation as a congruence
- Compositionality of Hennessy-Milner logic by structural operational semantics
- Divide and congruence applied to \(\eta\)-bisimulation
- Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Compositionality Through an Operational Semantics of Contexts
- The meaning of negative premises in transition system specifications
- Title not available (Why is that?)
- Precongruence formats for decorated trace semantics
- On cool congruence formats for weak bisimulations
- On the Forms of the Predicates in the Theory of Constructive Ordinals
- Transition system specifications with negative premises
Cited In (20)
- Probabilistic divide \& congruence: branching bisimilarity
- SOS-based modal decomposition on nondeterministic probabilistic processes
- Back to the format: a survey on SOS for probabilistic processes
- SOS specifications for uniformly continuous operators
- Sharp congruences adequate with temporal logics combining weak and strong modalities
- Compositional bisimulation metric reasoning with Probabilistic Process Calculi
- Congruence from the operator's point of view. Syntactic requirements on modal characterizations
- Compositionality of Hennessy-Milner logic through structural operational semantics.
- Compositionality of Hennessy-Milner logic by structural operational semantics
- Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence
- Modal decomposition on nondeterministic probabilistic processes
- Divide and congruence. II: Delay and weak bisimilarity
- Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity
- Divide and congruence applied to \(\eta\)-bisimulation
- Raiders of the lost equivalence: probabilistic branching bisimilarity
- Precongruence formats with lookahead through modal decomposition
- Divide and congruence. III: Stability \& divergence
- Title not available (Why is that?)
- Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation
- Ensuring liveness properties of distributed systems: open problems
This page was built for publication: Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418189)
