We present a process algebra with conditionally distributed discrete-time delays and generally-distributed stochastic delays. The treatment allows for expansion laws for the parallel composition and the maximal progress operator. The approach is illustrated by a specification of the concurrent alternating bit protocol with generally-distributed unreliable channels in the language . We compare performance analysis using timed probabilistic reward graphs and discrete-event simulation.
Jasen Markovski, Erik P. de Vink