Sciweavers

CONCUR
2006
Springer

Probabilistic I/O Automata: Theories of Two Equivalences

13 years 7 months ago
Probabilistic I/O Automata: Theories of Two Equivalences
Working in the context of a process-algebraic language for Probabilistic I/O Automata (PIOA), we study the notion of PIOA behavior equivalence by obtaining a complete axiomatization of its equational theory and comparing the results with a complete axiomatization of a more standard equivalence, weighted bisimulation. The axiomatization of behavior equivalence is achieved by adding to the language an operator for forming convex combinations of terms.
Eugene W. Stark, Rance Cleaveland, Scott A. Smolka
Added 20 Aug 2010
Updated 20 Aug 2010
Type Conference
Year 2006
Where CONCUR
Authors Eugene W. Stark, Rance Cleaveland, Scott A. Smolka
Comments (0)