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

  1. Lookup NU author(s)
  2. Dr Victor Khomenko
Author(s)Meyer R, Khomenko V, Hüchting R
Editor(s)Koutny, M., Ulidowski, I.
Publication type Conference Proceedings (inc. Abstract)
Conference Name23rd International Conference on Concurrency Theory (CONCUR'2012)
Conference LocationNewcastle upon Tyne, UK
Year of Conference2012
Date4-7 September 2012
Volume7454
Pages440-455
Series TitleLecture Notes in Computer Science
ISBN9783642329395
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.
PublisherSpringer-Verlag
URLhttp://dx.doi.org/10.1007/978-3-642-32940-1_31
DOI10.1007/978-3-642-32940-1_31
ActionsLink to this publication
Library holdingsSearch Newcastle University Library for this item