Divide and congruence: from decomposition of modal formulas to preservation of branching and -bisimilarity

DOI10.1016/J.IC.2011.10.011MaRDI QIDQ418189zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

congruencemodal logicprocess algebrastructural operational semanticsprocess semantics

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3990852 (Why is no real title available?)
• scientific article; zbMATH DE number 4011914 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 3744561 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1296290 (Why is no real title available?)
• scientific article; zbMATH DE number 4001464 (Why is no real title available?)
• A structural approach to operational semantics
• Algebraic laws for nondeterminism and concurrency
• Bisimulation can't be traced
• Branching bisimilarity is an equivalence indeed!
• Branching time and abstraction in bisimulation semantics
• Compositionality Through an Operational Semantics of Contexts
• Compositionality of Hennessy-Milner logic by structural operational semantics
• Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation
• Divide and congruence applied to \(\eta\)-bisimulation
• Higher-level synchronising devices in Meije-SCCS
• On cool congruence formats for weak bisimulations
• On the Forms of the Predicates in the Theory of Constructive Ordinals
• Precongruence formats for decorated trace semantics
• Process algebra for synchronous communication
• Rooted branching bisimulation as a congruence
• Structural operational semantics for weak bisimulations
• Structured operational semantics and bisimulation as a congruence
• The meaning of negative premises in transition system specifications
• The meaning of negative premises in transition system specifications. II
• The well-founded semantics for general logic programs
• Three logics for branching bisimulation
• Transition system specifications with negative premises
• \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules

Cited in

(20)

• Back to the format: a survey on SOS for probabilistic processes
• Compositionality of Hennessy-Milner logic by structural operational semantics
• Compositional bisimulation metric reasoning with Probabilistic Process Calculi
• 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
• Sharp congruences adequate with temporal logics combining weak and strong modalities
• Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation
• Raiders of the lost equivalence: probabilistic branching bisimilarity
• Divide and congruence applied to \(\eta\)-bisimulation
• Congruence from the operator's point of view. Syntactic requirements on modal characterizations
• Precongruence formats with lookahead through modal decomposition
• Divide and congruence. III: Stability \& divergence
• Probabilistic divide \& congruence: branching bisimilarity
• SOS specifications for uniformly continuous operators
• Ensuring liveness properties of distributed systems: open problems
• Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity
• Compositionality of Hennessy-Milner logic through structural operational semantics.
• SOS-based modal decomposition on nondeterministic probabilistic processes
• scientific article; zbMATH DE number 7453959 (Why is no real title available?)

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)