A quite flourishing research thread in the recent literature on component-based systems is
concerned with the algebraic properties of different classes of connectors. In a recent paper …

Petri nets can express concurrency and nondeterminism but neither locality nor hierarchy.
This article presents an extension of Petri nets, in which places can be grouped into so …

We present a process algebra called TiMo in which timeouts of interactions and adaptable
migrations in a distributed environment with explicit locations can be specified. Timing …

Petri nets can express concurrency and nondeterminism but not hierarchy. This article
presents an extension of Petri nets, in which places can be grouped into so-called “units” …

We present a process algebra where timeouts of interactions and adaptable migrations in a
distributed environment with explicit locations can be defined. Timing constraints allow to …

We propose a finite structural translation of possibly recursive π-calculus terms into Petri
nets. This is achieved by using high-level nets together with an equivalence on markings in …

This paper surveys the research related to the model of M-nets since it was introduced in
1995. M-nets are high-level labelled Petri nets which can be composed, like process …

In this paper we propose a translation into high level Petri nets of the terms of a finite
fragment of the π-calculus. Our construction renders in a compositional way the control flow …

School of Computing Science, University of Newcastle Newcastle upon Tyne, NE1 7RU, UK
{victor. khomenko, maciej. koutny, apostolos. niaouris}@ ncl. ac. uk Summary. Mobility is a …

A Petri Net Semantics of a Simple Process Algebra for Mobility Page 1 A Petri Net Semantics of
a Simple Process Algebra for Mobility Raymond Devillers1 Département d’Informatique …