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 …

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

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 …

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 …

A new Petri net calculus called the calculus of Petri Boxes is described. It has been
designed to allow reasoning about the structure of a net and about the relationship between …

Process algebras can be enriched with localities that explicitly describe the distribution of
processes. Localities may represent physical machines, or more generally distribution units …

The synthesis problem of concurrent systems is the problem of synthesizing a concurrent
system model from sequential observations. The paper studies the synthesis problem for …

After various attempts, an equivalence relation is defined for labelled Petri nets, on the base
of the concurrency semantics of net theory. This relation, called Fully Concurrent …

Configuration structures provide a model of concurrency generalising the families of
configurations of event structures. They can be considered logically, as classes of …

In this paper the correspondence between safe Petri nets and event structures, due to
Nielsen, Plotkin and Winskel, is extended to arbitrary nets without self-loops, under the …