Exploring probabilistic bisimulations. I

DOI10.1007/s00165-012-0242-7zbMath1259.68153OpenAlexW1995469594MaRDI 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 theorycontextual equivalenceprobabilistic processesbisimulation equivalencelogical characterisation

Mathematics Subject Classification ID

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 (19)

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

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Exploring probabilistic bisimulations. I