2006 | OriginalPaper | Chapter
A Petri Net Translation of π-Calculus Terms
Authors : Raymond Devillers, Hanna Klaudel, Maciej Koutny
Published in: Theoretical Aspects of Computing - ICTAC 2006
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.