TY - JOUR
AU - Luca Aceto
AU - Zoltán Ésik
AU - Anna Ingólfsdóttir
PY - 2002/02/05
Y2 - 2020/05/27
TI - Equational Axioms for Probabilistic Bisimilarity (Preliminary Report)
JF - BRICS Report Series
JA - BRICS
VL - 9
IS - 6
SE - Articles
DO - 10.7146/brics.v9i6.21724
UR - https://tidsskrift.dk/brics/article/view/21724
AB - This paper gives an equational axiomatization of probabilistic bisimulation equivalence for a class of finite-state agents previously studied by Stark and Smolka ((2000) Proof, Language, and Interaction: Essays in Honour of Robin Milner, pp. 571-595). The axiomatization is obtained by extending the general axioms of iteration theories (or iteration algebras), which characterize the equational properties of the fixed point operator on (omega-)continuous or monotonic functions, with three axiom schemas that express laws that are specific to probabilistic bisimilarity. Hence probabilistic bisimilarity (over finite-state agents) has an equational axiomatization relative to iteration algebras.
ER -