Unprovability of the logical characterization of bisimulation
From MaRDI portal
Publication:549668
DOI10.1016/J.IC.2011.02.003zbMath1216.68196OpenAlexW2061760083MaRDI QIDQ549668
Publication date: 18 July 2011
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2011.02.003
Discrete-time Markov processes on general state spaces (60J05) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (12)
Approximating bisimilarity for Markov processes ⋮ A stochastic interpretation of propositional dynamic logic: expressivity ⋮ Hennessy-Milner results for probabilistic PDL ⋮ A Theory for the Semantics of Stochastic and Non-deterministic Continuous Systems ⋮ Unnamed Item ⋮ Expressiveness of probabilistic modal logics: a gradual approach ⋮ THE ZHOU ORDINAL OF LABELLED MARKOV PROCESSES OVER SEPARABLE SPACES ⋮ Behavioural equivalences for continuous-time Markov processes ⋮ Using coalgebras and the Giry monad for interpreting game logics -- a tutorial ⋮ Bisimilarity is not Borel ⋮ Open maps in concrete categories and branching bisimulation for prefix orders ⋮ Structural operational semantics for continuous state stochastic transition systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Kleisli morphisms and randomized congruences for the Giry monad
- Bisimulation through probabilistic testing
- Topology and descriptive set theory
- Universal coalgebra: A theory of systems
- Bisimulation from open maps
- Bisimulation and cocongruence for probabilistic systems
- Bisimulation for labelled Markov processes
- Semi-pullbacks and bisimulation in categories of Markov processes
- Extensions of measure
This page was built for publication: Unprovability of the logical characterization of bisimulation
