dar seminar - Scott Smolka: Probabilistic Process Algebra

		 Design and Analysis Research Seminar
                         Wed., Oct. 10, 2001
                     2-3pm, CS Seminar Room 1306

		    Probabilistic Process Algebra

			    Scott Smolka

Process Algebra is a formal description technique for modeling systems
as collections of interacting subsystems.  A process algebra typically
consists of syntax comprising a small number of operators for composing
subsystems into systems, a semantics given in terms of labeled transition
systems, and one or more behavioral relations (such as bisimulation)
that allow one to decide when one system description correctly implements

This talk surveys work done on extending process algebra with operators
that allow one to augment a system description with probability information
so that performance and reliability issues can be addressed within the
process algebraic framework.  It will focus on a very general model of
probabilistic processes called probabilistic transition systems, and a
general framework for adding probability to existing process algebras.