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 …

Continuous-time Markov chains (CTMCs) have been widely used to determine system
performance and dependability characteristics. Their analysis most often concerns the …

Modeling and Veri cation of Randomized Distributed Real-Time Systems Page 1 Modeling and
Veri cation of Randomized Distributed Real-Time Systems by Roberto Segala SM, Electrical …

The development of techniques for quantitative, model-based evaluation of computer system
dependability has a long and rich history. A wide array of model-based evaluation …

Methods for the formal verification and specification of systems are a critical tool for the
development of correct systems, and they have been applied to the design of hardware …

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 …

The world is increasingly populated with interactive agents distributed in space, real or
abstract. These agents can be artificial, as in computing systems that manage and monitor …

We extend the π-calculus, a model of concurrent processes based on the notion of naming,
to cope with performance modelling. The new language is called the stochastic π-calculus …

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 …