This paper introduces a general framework of probabilistic and nondeterministic recursive processes that considers three complementary views of the semantics of concurrent processes: behavioural (testing semantics), denotational and axiomatic. The process algebra we present, PNAL, is a full probabilistic extension of EPL (Algebraic Theory of Processes, M. Hennessy) that maintains nondeterminism. This language allows us to consider both qualitative and quantitative aspects of concurrent systems, which are important in order to obtain more realistic models. © 2002 Elsevier Science Inc. All rights reserved.
Cazorla, D., Cuartero, F., Valero, V., Pelayo, F. L., & Pardo, J. J. (2003). Algebraic theory of probabilistic and nondeterministic processes. Journal of Logic and Algebraic Programming, 55(1–2), 57–103. https://doi.org/10.1016/S1567-8326(02)00040-1