BIB-VERSION:: CS-TR-v2.0
          ID:: SBCS//stark/probioauto.dvi
       ENTRY:: July 24, 1994
ORGANIZATION:: State University of New York at Stony Brook, Computer Science
       TITLE:: Composition and Behaviors of Probabilistic I/O Automata
        TYPE:: Preprint
      AUTHOR:: Wu, Sue-Hwey, Smolka, Scott A., Stark, Eugene W.
     CONTACT:: Eugene W. Stark, Department of Computer Science,
                   SUNY at Stony Brook, Stony Brook, NY 11794-4400
                   Tel: 516-632-8444 <stark@cs.sunysb.edu>
	DATE:: May, 1994
   RETRIEVAL:: HTTP from BSD7.CS.SUNYSB.EDU with the URL
		   http://bsd7.cs.sunysb.edu/~pioa/Papers/probioauto_concur94.ps.gz
       NOTES:: A version of this paper will appear as:
                S.-H. Wu, S. Smolka, E. W. Stark,
                "Composition and Behaviors of Probabilistic I/O Automata"
                Proceedings of CONCUR '94
                Uppsala, Sweden
                August, 1994

ABSTRACT::

We augment the I/O automaton model of Lynch and Tuttle with probability,
as a step toward the ultimate goal of obtaining a useful tool for specifying
and reasoning about asynchronous probabilistic systems.  Our new model,
called *probabilistic I/O automata*, preserves the fundamental properties
of the I/O automaton model, such as the asymmetric treatment of input and
output and the pleasant notion of asynchronous composition.  For the class
of probabilistic I/O automata without internal actions, we show that
*probabilistic behavior maps*, which are an abstract representation of I/O
automaton behavior in terms of a certain expectation operator, are
compositional and fully abstract with respect to a natural notion of
probabilistic testing.

END:: SBCS//stark/probioauto.dvi