A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
In the paper we present an ACP-like process algebra which can be used to model both probabilistic and time behaviour of parallel systems. This process algebra is obtained by extension of untimed probabilistic process algebra with constructors that allow the explicit specification of timing aspects. In this paper we concentrate on giving axioms and deduction rules for these constructors. We give two probabilistic process algebras with discrete time. The first one only manipulates with processesdoi:10.1007/3-540-45499-3_24 fatcat:mnk3kflmefac7peilyk6am327m