Probabilistic bisimulation as a congruence

DOI10.1145/1462179.1462181zbMath1351.68183OpenAlexW2071882940MaRDI QIDQ2946567

Ruggero Lanotte, Simone Tini

Publication date: 17 September 2015

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1462179.1462181

zbMATH Keywords

bisimulationcongruenceprobabilistic process algebratransition rule format

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

A general SOS theory for the specification of probabilistic transition systems ⋮ SOS specifications for uniformly continuous operators ⋮ Back to the format: a survey on SOS for probabilistic processes ⋮ Unnamed Item ⋮ Compositional bisimulation metric reasoning with Probabilistic Process Calculi ⋮ Probabilistic divide \& congruence: branching bisimilarity ⋮ Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes ⋮ Logical characterization of branching metrics for nondeterministic probabilistic transition systems ⋮ Unnamed Item ⋮ Non Expansive ε-Bisimulations

This page was built for publication: Probabilistic bisimulation as a congruence