Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules

DOI10.1007/978-3-642-54830-7_19zbMath1405.68182OpenAlexW143797383MaRDI QIDQ5410679

Matias David Lee, Daniel Gebler, Pedro R. D'Argenio

Publication date: 16 April 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-54830-7_19

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) 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 (10)

A general SOS theory for the specification of probabilistic transition systems ⋮ Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? ⋮ Back to the format: a survey on SOS for probabilistic processes ⋮ Towards general axiomatizations for bisimilarity and trace semantics ⋮ Probabilistic divide \& congruence: branching bisimilarity ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Monads and Quantitative Equational Theories for Nondeterminism and Probability ⋮ Compositional weak metrics for group key update ⋮ Structural operational semantics for continuous state stochastic transition systems

This page was built for publication: Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules