This paper surveys the theoretical developments in the field of stochastic process algebras,
process algebras where action occurrences may be subject to a delay that is determined by …

In this tutorial we give an overview of the process algebra EMPA, a calculus devised in order
to model and analyze features of real-world concurrent systems such as nondeterminism …

This note addresses the history of process algebra as an area of research in concurrency
theory, the theory of parallel and distributed systems in computer science. Origins are traced …

Automated and semi-automated manipulation of so-called labelled transition systems has
become an important means in discovering flaws in software and hardware systems …

Stochastic activity networks have been used since the mid-1980s for performance,
dependability, and performability evaluation. They have been used as a modeling formalism …

The notion of process equivalence of probabilistic processes is sensitive to the exact
probabilities of transitions. Thus, a slight change in the transition probabilities will result in …

This chapter introduces the central formalism of this book, Interactive Markov Chains 1
(IMC). It arises as an integration of interactive processes and continuous-time Markov …

Abstract Partial Labeled Markov Chains (plMc) generalize process algebra and traditional
Markov chains. They provide a foundation for interacting discrete probabilistic systems …

Bisimulations that abstract from internal computation have proven to be useful for verification
of compositionally defined transition system. In the literature of probabilistic extensions of …

We observe that equivalence is not a robust concept in the presence of numerical
information-such as probabilities-in the model. We develop a metric analogue of weak …