This paper surveys various notions of equivalence for concurrent systems in the framework
of Elementary Net Systems, a fundamental class in the family of Petri Net models. Two types …

The notion of a branching process is introduced, as a formalization of an initial part of a run
of a Petri net, including nondeterministic choices. This generalizes the notion of a process in …

Petri nets are widely used to model concurrent systems. However, their composition and
abstraction mechanisms are inadequate: we solve this problem in a satisfactory way. We …

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 …

The phenomena of branching time and true or noninterleaving concurrency find their
respective homes in automata and schedules. But these two models of computation are …

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 …

We describe an axiom system ACP p that incorporates real timed actions. Many examples
are provided in order to explain the intuitive contents of the notation. ACP p is a …

We study an operator for refinement of actions to be used in the design of concurrent
systems. Actions on a given level of abstraction are replaced by more complicated …

In modern society services and support provided by computer-based systems have become
ubiquitous and indeed have started to fund amentally alter the way people conduct their …

Although workflow management emerged as a research area well over a decade ago, little
consensus has been reached as to what should be essential ingredients of a workflow …