Equational Axioms for Probabilistic Bisimilarity ( Preliminary Report )

@inproceedings{Aceto2002EquationalAF,
  title={Equational Axioms for Probabilistic Bisimilarity ( Preliminary Report )},
  author={Luca Aceto and Zolt{\'a}n {\'E}sik and Anna Ing{\'o}lfsd{\'o}ttir},
  year={2002}
}
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 (ω-)continuous or monotonic functions, with three axiom… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Time and Probability in Formal Design of Distributed Systems, vol

  • H. Hansson
  • 1 of Real-Time Safety Critical Systems, Elsevier,
  • 1994
Highly Influential
4 Excerpts

and Z

  • S. L. Bloo
  • Ésik, Iteration Theories, Springer-Verlag, Berlin…
  • 1993
Highly Influential
4 Excerpts

Regular Algebra and Finite Machines, Mathematics Series (R

  • J. H. Conway
  • Brown and J. De Wet eds.), Chapman and Hall…
  • 1971
Highly Influential
7 Excerpts

and K

  • B. Jonsson, W. Yi
  • G. Larsen, Probabilistic extensions of process…
  • 2001
2 Excerpts