Unprovability of the logical characterization of bisimulation

DOI10.1016/J.IC.2011.02.003MaRDI QIDQ549668zbMATHOpenAlexFDO

Authors Pedro Sánchez Terraf

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

zbMATH Keywords

modal logicprobabilistic bisimulationnonmeasurable setlabelled Markov process

Mathematics Subject Classification ID

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)

Recommendations

• Bisimulation for labelled Markov processes
• scientific article; zbMATH DE number 7204557
• Expressiveness of probabilistic modal logics: a gradual approach
• Bisimulation on Markov processes over arbitrary measurable spaces
• Bisimulations for non-deterministic labelled Markov processes

Cites work

• scientific article; zbMATH DE number 3764843 (Why is no real title available?)
• scientific article; zbMATH DE number 46732 (Why is no real title available?)
• scientific article; zbMATH DE number 1022658 (Why is no real title available?)
• scientific article; zbMATH DE number 1097274 (Why is no real title available?)
• scientific article; zbMATH DE number 2038770 (Why is no real title available?)
• scientific article; zbMATH DE number 3278887 (Why is no real title available?)
• scientific article; zbMATH DE number 3190627 (Why is no real title available?)
• scientific article; zbMATH DE number 3195517 (Why is no real title available?)
• Bisimulation and cocongruence for probabilistic systems
• Bisimulation for labelled Markov processes
• Bisimulation from open maps
• Bisimulation through probabilistic testing
• Extensions of measure
• Kleisli morphisms and randomized congruences for the Giry monad
• Semi-pullbacks and bisimulation in categories of Markov processes
• Topology and descriptive set theory
• Universal coalgebra: A theory of systems

Cited in

(15)

• THE ZHOU ORDINAL OF LABELLED MARKOV PROCESSES OVER SEPARABLE SPACES
• Behavioural equivalences for continuous-time Markov processes
• A theory for the semantics of stochastic and non-deterministic continuous systems
• Structural operational semantics for continuous state stochastic transition systems
• Hennessy-Milner results for probabilistic PDL
• Algebra and Coalgebra in Computer Science
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Bisimilarity is not Borel
• Using coalgebras and the Giry monad for interpreting game logics -- a tutorial
• A stochastic interpretation of propositional dynamic logic: expressivity
• Open maps in concrete categories and branching bisimulation for prefix orders
• Approximating bisimilarity for Markov processes
• Expressiveness of probabilistic modal logics: a gradual approach
• Bisimulation can't be traced
• scientific article; zbMATH DE number 7350769 (Why is no real title available?)

This page was built for publication: Unprovability of the logical characterization of bisimulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q549668)