Unprovability of the logical characterization of bisimulation

DOI10.1016/J.IC.2011.02.003zbMATH Open1216.68196OpenAlexW2061760083MaRDI QIDQ549668FDOQ549668

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Universal coalgebra: A theory of systems
• Bisimulation from open maps
• Bisimulation and cocongruence for probabilistic systems
• Bisimulation for labelled Markov processes
• Title not available (Why is that?)
• Bisimulation through probabilistic testing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Topology and descriptive set theory
• Extensions of measure
• Title not available (Why is that?)
• Semi-pullbacks and bisimulation in categories of Markov processes
• Kleisli morphisms and randomized congruences for the Giry monad

Cited In (15)

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

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)