A Polynomial Translation of pi-calculus FCPs to Safe Petri Nets
arXiv:1309.0717 · doi:10.2168/LMCS-9(3:18)2013
Abstract
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.
arXiv commentTo appear in special issue on best papers of CONCUR'12 of Logical Methods in Computer Science