A polynomial translation of π-calculus (FCP) to safe petri nets

  • Authors:
  • Roland Meyer;Victor Khomenko;Reiner Hüchting

  • Affiliations:
  • University of Kaiserslautern, Germany;Newcastle University, UK;University of Kaiserslautern, Germany

  • Venue:
  • CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.