2012 | OriginalPaper | Chapter
A Polynomial Translation of π-Calculus (FCP) to Safe Petri Nets
Authors : Roland Meyer, Victor Khomenko, Reiner Hüchting
Published in: CONCUR 2012 – Concurrency Theory
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
We develop a polynomial translation from finite control processes (an important fragment of
π
-calculus) to safe low-level Petri nets. To our knowledge, this is the first such translation. It is natural (there is a close correspondence between the control flow of the original specification and the resulting Petri net), enjoys a bisimulation result, and it is suitable for practical model checking.