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 processes that may be initialized within the current time slice or may delay a finite and fixed number of time slices. Later, we add processes whose execution can be postponed for an arbitrary number of time slices.
|Title of host publication||Algebraic Methodology and Software Technology (Proceedings 8th International Conference, AMAST2000, Iowa City IA, USA, May 20-27, 2000)|
|Place of Publication||Berlin|
|Publication status||Published - 2000|
|Name||Lecture Notes in Computer Science|
Andova, S. (2000). Time and probability in process algebra. In T. Rus (Ed.), Algebraic Methodology and Software Technology (Proceedings 8th International Conference, AMAST2000, Iowa City IA, USA, May 20-27, 2000) (pp. 323-338). (Lecture Notes in Computer Science; Vol. 1816). Springer. https://doi.org/10.1007/3-540-45499-3_24