Induction is a pervasive tool in computer science and mathematics for defining objects and
reasoning on them. Coinduction is the dual of induction and as such it brings in quite …

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 …

This paper reviews the model of interactive Markov chains (IMCs, for short), an extension of
labelled transition systems with exponentially delayed transitions. We show that IMCs are …

This paper surveys and relates the basic concepts of process algebra and the modelling of
continuous time Markov chains. It provides basic introductions to both fields, where we also …

This paper studies testing based on labelled transition systems, presenting two test
generation algorithms with their corresponding implementation relations. The first algorithm …

In these notes, we give an overview of the join calculus, its semantics, and its equational
theory. The join calculus is a language that models distributed and mobile programming. It is …

The increasing complexity of today's testing scenarios for complex systems demands an
integrated, open, and flexible approach to support the management of the overall test …

In this paper we present a solution to the long-standing problem of characterising the
coarsest liveness-preserving pre-congruence with respect to a full (TCSP-inspired) process …

The design of concurrent and distributed systems is generally complex, with a high
possibility that subtle errors will cause erroneous behaviour. Behaviour analysis is a …

We investigate the notion of fair testing, a formal testing theory in the style of De Nicola and
Hennessy, where divergences are disregarded as long as there are visible outgoing …