A petri net translation of π-calculus terms

Authors:
Raymond Devillers;Hanna Klaudel;Maciej Koutny
Affiliations:
Département d’Informatique, Université Libre de Bruxelles, CP212, Bruxelles, Belgium;IBISC, FRE 2873 CNRS, Université d’Evry, Evry, France;School of Computing Science, University of Newcastle, Newcastle upon Tyne, United Kingdom
Venue:
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Year:
2006

Citing 12
Cited 0

Petri Net systems and their closure properties

Advances in Petri nets 1989
A calculus of mobile processes, II

Information and Computation
A multiset semantics for the pi-calculus with replication

Theoretical Computer Science - Special volume on Petri nets
Petri net algebra

Petri net algebra
Communication and Concurrency

Communication and Concurrency
PEP - More than a Petri Net Tool

TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
A Petri Net Semantics for pi-Calculus

CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Coloured Petri Nets Extended with Place Capacities, Test Arcs and Inhibitor Arcs

Proceedings of the 14th International Conference on Application and Theory of Petri Nets
Models for Name-Passing Processes: Interleaving and Causal

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
General parameterised refinement and recursion for the M-net calculus

Theoretical Computer Science
Asynchronous box calculus

Fundamenta Informaticae
Petri net semantics of the finite π-calculus terms

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, 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 order to model entering into recursive calls, which do not need to be guarded.