Process algebra with probabilistic choice

S. Andova

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

40 Citations (Scopus)


Published results show that various models may be obtained by combining parallel composition with probability and with or without non-determinism. In this paper we treat this problem in the setting of process algebra in the form of ACP. First, probabilities are introduced by an operator for the internal probabilistic choice. In this way we obtain the Basic Process Algebra with probabilistic choice prBPA. After-wards, prBPA is extended with parallel composition to ACP p + . We give the axiom system for ACP p + and a complete operational semantics that preserves the interleaving model for the dynamic concurrent processes. Considering the PAR protocol, a communication protocol that can be used in the case of unreliable channels, we investigate the applicability of ACP p + . Using in addition only the priority operator and the preabstraction operator we obtain a recursive specification of the behaviour of the protocol that can be viewed as a Markov chain.
Original languageEnglish
Title of host publicationFormal Methods for Real-Time and Probabilistic Systems (Proceedings ARTS'99, Bamberg, Germany, May 26-28, 1999)
EditorsJ.P. Katoen
Place of PublicationBerlin
ISBN (Print)3-540-66010-0
Publication statusPublished - 1999

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743


Dive into the research topics of 'Process algebra with probabilistic choice'. Together they form a unique fingerprint.

Cite this