Logical Characterizations of Bisimulations for Discrete Probabilistic Systems

DOI10.1007/978-3-540-71389-0_21zbMath1195.68072OpenAlexW1505927408MaRDI QIDQ5758058

Roberto Segala, Augusto Parma

Publication date: 7 September 2007

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-71389-0_21

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (26)

A General Framework for Probabilistic Characterizing Formulae ⋮ A space-efficient simulation algorithm on probabilistic automata ⋮ A Theory for the Semantics of Stochastic and Non-deterministic Continuous Systems ⋮ Probabilistic bisimilarity as testing equivalence ⋮ Logical Characterizations of Behavioral Relations on Transition Systems of Probability Distributions ⋮ Bisimulations for non-deterministic labelled Markov processes ⋮ Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus ⋮ Exploring probabilistic bisimulations. I ⋮ Algorithmic and logical characterizations of bisimulations for non-deterministic fuzzy transition systems ⋮ Unnamed Item ⋮ Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation ⋮ Model Checking HML on Piecewise-Constant Inhomogeneous Markov Chains ⋮ Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation ⋮ Logical characterizations of simulation and bisimulation for fuzzy transition systems ⋮ Differential privacy in probabilistic systems ⋮ A logical duality for underspecified probabilistic systems ⋮ Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes ⋮ Probabilistic divide \& congruence: branching bisimilarity ⋮ Weak bisimulation is sound and complete for pCTL\(^*\) ⋮ Logical characterization of branching metrics for nondeterministic probabilistic transition systems ⋮ Unnamed Item ⋮ Termination in Convex Sets of Distributions ⋮ A Spectrum of Behavioral Relations over LTSs on Probability Distributions ⋮ Group-by-Group Probabilistic Bisimilarities and Their Logical Characterizations ⋮ Branching bisimulation congruence for probabilistic systems ⋮ Trace semantics via determinization

This page was built for publication: Logical Characterizations of Bisimulations for Discrete Probabilistic Systems