Toggle Main Menu Toggle Search

Open Access padlockePrints

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

Lookup NU author(s): Dr Victor Khomenko


Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


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.

Publication metadata

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

Editor(s): Koutny, M., Ulidowski, I.

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: 23rd International Conference on Concurrency Theory (CONCUR'2012)

Year of Conference: 2012

Pages: 440-455

ISSN: 0302-9743 (print) 1611-3349 (online)

Publisher: Springer-Verlag


DOI: 10.1007/978-3-642-32940-1_31

Library holdings: Search Newcastle University Library for this item

Series Title: Lecture Notes in Computer Science

ISBN: 9783642329395


Link to this publication