Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation
DOI10.1007/11804192_10zbMATH Open1196.68156OpenAlexW2125882282MaRDI QIDQ3591399FDOQ3591399
Authors: Paulien de Wind, Wan Fokkink, Rob van Glabbeek 
Publication date: 11 September 2007
Published in: Formal Methods for Components and Objects (Search for Journal in Brave)
Full work available at URL: https://unsworks.unsw.edu.au/fapi/datastream/unsworks:7774/SOURCE01?view=true
Recommendations
- Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity
- Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity
- Divide and congruence applied to \(\eta\)-bisimulation
- Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence
- scientific article; zbMATH DE number 7453959
- Bisimulation and divergence
- Logics for bisimulation and divergence
- Splitting bisimulations and retrospective conditions
- Split and ST bisimulation semantics
- Deriving Bisimulations by Simplifying Partitions
Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (15)
- Probabilistic divide \& congruence: branching bisimilarity
- SOS-based modal decomposition on nondeterministic probabilistic processes
- Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity
- A precongruence format for should testing preorder
- On cool congruence formats for weak bisimulations
- Sharp congruences adequate with temporal logics combining weak and strong modalities
- Characteristic invariants in Hennessy-Milner logic
- 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
- Precongruence formats with lookahead through modal decomposition
- Divide and congruence. III: Stability \& divergence
- Notes on generative probabilistic bisimulation
This page was built for publication: Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3591399)
