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 …

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

In this paper we are interested in general properties of classes of transition system
specifications in Plotkin style. The discussion takes place in a setting of labelled transition …

Abstract Structural Operational Semantics (SOS) provides a framework to give an
operational semantics to programming and specification languages, which, because of its …

Process algebra is a widely accepted and much used technique in the specification and
verification of parallel and distributed software systems. This book sets the standard for the …

In this article the general approach to Plotkin-style operational semantics of Groote and
Vaandrager (1989) is extended to transition system specifications (TSSs) with rules that may …

Abstract This note describes Proof General, a tool for develo** machine proofs with an
interactive proof assistant. Interaction is based around a proof script, which is the target of a …

This chapter surveys algorithms for computing semantic equivalences and refinement
relations, or preorders, over states in finite-state labeled transitions systems. Methods for …

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

We present an algorithm for allocating individual ants to tasks that relies solely on task
change being caused by the unavailability of work. We prove that such an algorithm will …