Constructive logical characterizations of bisimilarity for reactive probabilistic systems

DOI10.1016/j.tcs.2018.12.003zbMath1476.68165MaRDI QIDQ1731513

Marino Miculan, Marco Bernardo

Publication date: 13 March 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.12.003

zbMATH Keywords

bisimilarity; modal logic characterizations; reactive probabilistic systems

Mathematics Subject Classification ID

03B45: Modal logic (including the logic of norms)

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)

Related Items

Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the final sequence of a finitary set functor
• CCS expressions, finite state processes, and three problems of equivalence
• Bisimulation through probabilistic testing
• Approximating labelled Markov processes
• Universal coalgebra: A theory of systems
• Reactive, generative, and stratified models of probabilistic processes
• Bisimulation for probabilistic transition systems: A coalgebraic approach
• Bisimulation and cocongruence for probabilistic systems
• Bisimulation for labelled Markov processes
• Finite state Markovian decision processes
• Domain equations for probabilistic processes
• Exemplaric Expressivity of Modal Logics
• Algebraic laws for nondeterminism and concurrency
• Formal verification of parallel programs
• A final coalgebra theorem
• Probabilistic automata