A Polynomial Translation of pi-calculus FCPs to Safe Petri Nets

Victor Khomenko; Roland Meyer; Reiner Hüchting

doi:10.2168/LMCS-9(3:18)2013

Victor Khomenko ; Roland Meyer ; Reiner Hüchting - A Polynomial Translation of pi-calculus FCPs to Safe Petri Nets

lmcs:932 - Logical Methods in Computer Science, September 17, 2013, Volume 9, Issue 3 - https://doi.org/10.2168/LMCS-9(3:18)2013

A Polynomial Translation of pi-calculus FCPs to Safe Petri NetsArticle

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

We develop a polynomial translation from finite control pi-calculus processes to safe low-level Petri nets. To our knowledge, this is the first such translation. It is natural in that there is a close correspondence between the control flows, enjoys a bisimulation result, and is suitable for practical model checking.

Comment: To appear in special issue on best papers of CONCUR'12 of Logical Methods in Computer Science

https://doi.org/10.2168/LMCS-9(3:18)2013

Source: arXiv.org:1309.0717

Volume: Volume 9, Issue 3

Published on: September 17, 2013

Imported on: January 15, 2013

Keywords: Computer Science - Logic in Computer Science

Licence: arXiv.org - Non-exclusive license to distribute

Funding:

Source : OpenAIRE Graph