Equational Axioms for Probabilistic Bisimilarity

DOI10.1007/3-540-45719-4_17zbMath1275.68099OpenAlexW2120948330MaRDI QIDQ2996139

Luca Aceto, Anna Ingólfsdóttir, Zoltán Ésik

Publication date: 6 May 2011

Published in: Algebraic Methodology and Software Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-45719-4_17

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (16)

A connection between concurrency and language theory ⋮ Complete axiomatization for the total variation distance of Markov chains ⋮ Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? ⋮ Deriving Syntax and Axioms for Quantitative Regular Behaviours ⋮ Axiomatizations for probabilistic finite-state behaviors ⋮ A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences ⋮ Simulation relations for pattern matching in directed graphs ⋮ Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview ⋮ Equational properties of fixed-point operations in cartesian categories: An overview ⋮ Axiomatizing weighted synchronization trees and weighted bisimilarity ⋮ Quantitative Kleene coalgebras ⋮ Unnamed Item ⋮ On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems ⋮ Equational theories for automata ⋮ Labelled Markov Processes as Generalised Stochastic Relations ⋮ Probabilistic Barbed Congruence

This page was built for publication: Equational Axioms for Probabilistic Bisimilarity