Abstract
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. © Springer-Verlag Berlin Heidelberg 2006.
Author supplied keywords
Cite
CITATION STYLE
Stark, E. W., Cleaveland, R., & Smolka, S. A. (2006). Probabilistic I/O automata: Theories of two equivalences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4137 LNCS, pp. 343–357). Springer Verlag. https://doi.org/10.1007/11817949_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
