2006 | OriginalPaper | Chapter
Probabilistic I/O Automata: Theories of Two Equivalences
Authors : Eugene W. Stark, Rance Cleaveland, Scott A. Smolka
Published in: CONCUR 2006 – Concurrency Theory
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.