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

We introduce mCRL2, a specification language that can be used to specify and analyse the
behaviour of distributed systems. This language is the successor of the mCRL specification …

Renaming operators are introduced in concrete process algebra (concrete means that
abstraction and silent moves are not considered). Examples of renaming operators are …

We propose a process algebra obtained by extending a combination of the process algebra
with continuous relative timing from Baeten and Middelburg (Process Algebra with Timing …

We provide rules for calculating with invariants in process algebra with data, and illustrate
these with examples. The new rules turn out to be equivalent to the well known Recursive …

In a theory of processes the names are atomic data items which can be exchanged and
tested for identify. A well-known example of a calculus for name-passing is the π-calculus …

Several new operators are introduced on top of the algebra of communicating processes
(ACP) from [BK 84] in order to incorporate stable signals in process algebra. Semantically …

We consider processes that have transitions labeled with atomic actions, and states labeled
with formulas over a propositional logic. These state labels are called signals. A process in a …

While studying the specification of the operational semantics of different programming
languages and formalisms, one can observe the following three facts. First, Plotkin's style of …

The axiom systems BPAε, BPAεδ, PAε and ACPε which are in essence the systems BPA, PA
and ACP extended with the empty process are presented. For the system ACPε, that …