Exploring probabilistic bisimulations. I

DOI10.1007/s00165-012-0242-7zbMath1259.68153MaRDI QIDQ1941884

Matthew C. B. Hennessy

Publication date: 22 March 2013

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-012-0242-7

zbMATH Keywords

equational theory; contextual equivalence; probabilistic processes; bisimulation equivalence; logical characterisation

Mathematics Subject Classification ID

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

Unnamed Item, Unnamed Item, Unnamed Item, Probabilistic Bisimulation for Realistic Schedulers, A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences, Differential privacy in probabilistic systems, Raiders of the lost equivalence: probabilistic branching bisimilarity, Approximate analyzing of labeled transition systems, Probabilistic bisimulation for realistic schedulers, Probabilistic bisimilarity as testing equivalence, The quest for minimal quotients for probabilistic and Markov automata, Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies, On the probabilistic bisimulation spectrum with silent moves, Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes, Logical characterization of branching metrics for nondeterministic probabilistic transition systems, An efficient algorithm to determine probabilistic bisimulation, Group-by-Group Probabilistic Bisimilarities and Their Logical Characterizations, Logical Characterizations of Behavioral Relations on Transition Systems of Probability Distributions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic logical characterization
• Processes with probabilities, priority and time
• On reduction-based process semantics
• A hierarchy of equivalences for asynchronous calculi
• Deciding bisimilarity and similarity for probabilistic processes.
• Refinement-oriented probability for CSP
• On the Semantics of Markov Automata
• Testing Finitary Probabilistic Processes
• A Distributed Pi-Calculus
• Logical Bisimulations and Functional Languages
• Abstraction, Refinement and Proof for Probabilistic Systems
• Characterising Probabilistic Processes Logically
• Logical Characterizations of Bisimulations for Discrete Probabilistic Systems