ePrints

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

Lookup NU author(s): Dr Victor Khomenko

Downloads

• Published version [.pdf]

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.

Publication metadata

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

Publication type: Article

Publication status: Published

Journal: Logical Methods in Computer Science

Year: 2013

Volume: 9

Issue: 3

Print publication date: 17/09/2013

Date deposited: 10/02/2014

ISSN (electronic): 1860-5974

Publisher: International Federation for Computational Logic

URL: http://dx.doi.org/10.2168/LMCS-9(3:18)2013

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

Altmetrics

Share