TY - GEN

T1 - Time and probability in process algebra

AU - Andova, S.

PY - 2000

Y1 - 2000

N2 - 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.

AB - 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.

U2 - 10.1007/3-540-45499-3_24

DO - 10.1007/3-540-45499-3_24

M3 - Conference contribution

SN - 3-540-67530-2

T3 - Lecture Notes in Computer Science

SP - 323

EP - 338

BT - Algebraic Methodology and Software Technology (Proceedings 8th International Conference, AMAST2000, Iowa City IA, USA, May 20-27, 2000)

A2 - Rus, T.

PB - Springer

CY - Berlin

ER -