A comprehensive introduction to the foundations of model checking, a fully automated
technique for finding flaws in hardware and software; with extensive examples and both …

We present the π-calculus, a calculus of communicating systems in which one can naturally
express processes which have changing structure. Not only may the component agents of a …

In previous chapters we have discussed the architecture of information systems (Chapter 1),
middleware and enterprise application integration (Chapters 2 and 3), and the basics of …

Since CAR Hoare's text Communicating Sequential Processes was published in 1985, his
notation has been extensively used for teaching and applying concurrency theory. This book …

In comparative concurrency semantics, one usually distinguishes between linear time and
branching time semantic equivalences. Milner's notion of observatin equivalence is often …

The Internet is going through several major changes. It has become a vehicle of Web
services rather than just a repository of information. Many organizations are putting their …

This paper studies testing based on labelled transition systems, using the assumption that
implementations communicate with their environment via inputs and outputs. Such …

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

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 study mobile systems, ie systems with a dynamically changing communication topology,
from a process algebras point of view. Mobility can be introduced in process algebras by …