BIB-VERSION:: CS-TR-v2.0
          ID:: SBCS//stark/pioa-equivalences.pdf
       ENTRY:: June 8, 2006
ORGANIZATION:: State University of New York at Stony Brook, Computer Science
       TITLE:: Probabilistic I/O Automata: Theories of Two Equivalences
        TYPE:: Technical Report
      AUTHOR:: Stark, Eugene W., Cleaveland, R., and Smolka, S. A.
     CONTACT:: Eugene W. Stark, Department of Computer Science,
                   SUNY at Stony Brook, Stony Brook, NY 11794-4400
                   Tel: 631-632-8444 <stark@cs.sunysb.edu>
        DATE:: June 8, 2006
   RETRIEVAL:: HTTP from BSD7.CS.SUNYSB.EDU with the URL
		   http://bsd7.cs.sunysb.edu/~stark/REPORTS/pioa-equivalences.abstract

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.