2012 | OriginalPaper | Buchkapitel
A Polynomial Translation of π-Calculus (FCP) to Safe Petri Nets
verfasst von : Roland Meyer, Victor Khomenko, Reiner Hüchting
Erschienen in: CONCUR 2012 – Concurrency Theory
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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.