The joys of bisimulation
Modal logic (including the logic of norms) (03B45) Model theory of finite structures (03C13) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
The author reviews results about bisimulation on transition systems. He describes a hierarchy of transition graphs generated by various kinds of rewriting rules, recalling relevant expressivity and decidability results. He then surveys several results relating bisimulation with some variants of (modal, first-order, second-order) logics, also considering such results in finite model theory. In addition, he provides a new undefinability result concerning language equivalence. For the entire collection see [Zbl 0895.00049].
- (Bi)simulations up-to characterise process semantics
- Bisimulations for temporal logic
- Swinging types=functions+relations+transition systems
- Implicit, explicit and speculative knowledge
- Weak bisimilarity and regularity of context-free processes is EXPTIME-hard
- Decidability of branching bisimulation on normed commutative context-free processes
- Semantics for knowledge and change of awareness
- Recursively defined metric spaces without contraction
- Deciding orthogonal bisimulation
- Automated generation of program translation and verification tools using annotated grammars
- Real-time verification techniques for untimed systems
- Bisimulation and coverings for graphs and hypergraphs
- Decidability of branching bisimulation on normed commutative context-free processes
- Branching vs. Linear Time: Semantical Perspective
- Bisimulations and predicate logic
- Bisimulation can't be traced
- scientific article; zbMATH DE number 2020181 (Why is no real title available?)
- scientific article; zbMATH DE number 7015161 (Why is no real title available?)
- scientific article; zbMATH DE number 794261 (Why is no real title available?)
- Two lower bounds for BPA
- The freedoms of (guarded) bisimulation
- Bisimulation and logic
- An axiomatization of bisimulation quantifiers via the \(\mu\)-calculus
- Refining the process rewrite systems hierarchy via ground tree rewrite systems
- Foundations of Software Science and Computation Structures
- Deciding bisimulation-like equivalences with finite-state processes
- Quantifying masking fault-tolerance via fair stochastic games
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
This page was built for publication: The joys of bisimulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4218096)
