A Polynomial Translation of Pi-calculus (FCP) to Safe Petri Nets (2012)

Author(s): Meyer R, Khomenko V, Hüchting R

    Abstract: We develop a polynomial translation from finite control processes (an important fragment of pi-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.

      • Date: 4-7 September 2012
      • Conference Name: 23rd International Conference on Concurrency Theory (CONCUR'2012)
      • Volume: 7454
      • Pages: 440-455
      • Publisher: Springer-Verlag
      • Publication type: Conference Proceedings (inc. abstract)
      • Bibliographic status: Published

      Keywords: finite control process, pi-calculus, Petri net, model checking

      Staff

      Dr Victor Khomenko
      Senior Lecturer