BIB-VERSION:: CS-TR-v2.0
          ID:: SBCS//stark/analysis.ps.gz
       ENTRY:: June 8, 1999
ORGANIZATION:: State University of New York at Stony Brook, Computer Science
       TITLE:: Implementation of a Compositional Performance Analysis
			 Algorithm for Probabilistic I/O Automata
        TYPE:: Preprint
      AUTHOR:: Stark, Eugene W., Pemmasani, Giridhar
     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:: June, 1999
   RETRIEVAL:: HTTP from BSD7.CS.SUNYSB.EDU with the URL
		   http://bsd7.cs.sunysb.edu/~stark/REPORTS/analysis.ps.gz

ABSTRACT::

In previous papers, we defined the ``probabilistic I/O automata''
model for specification and modeling of probabilistic concurrent systems,
and we showed how certain performance measures for such systems could be
computed compositionally, one component at a time,
without the need for explicit construction of the full global state space.
In this paper, we report on our experiences in constructing and testing
a computer implemention of these compositional analysis algorithms.
Our implementation, which is coded in the functional programming
language Standard ML, uses exact rational arithmetic to calculate
performance measures, and it is also capable of producing symbolic rational
function expressions that describe the dependence of performance measures
on a system parameter.