License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2015.128
URN: urn:nbn:de:0030-drops-53853
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2015/5385/
Go to the corresponding LIPIcs Volume Portal

Best, Eike ; Devillers, Raymond

Synthesis of Bounded Choice-Free Petri Nets

pdf-format:
25.pdf (0.5 MB)

Abstract

This paper describes a synthesis algorithm tailored to the construction of choice-free Petri nets from finite persistent transition systems. With this goal in mind, a minimised set of simplified systems of linear inequalities is distilled from a general region-theoretic approach, leading to algorithmic improvements as well as to a partial characterisation of the class of persistent transition systems that have a choice-free Petri net realisation.

BibTeX - Entry

@InProceedings{best_et_al:LIPIcs:2015:5385,
  author =	{Eike Best and Raymond Devillers},
  title =	{{Synthesis of Bounded Choice-Free Petri Nets}},
  booktitle =	{26th International Conference on Concurrency Theory (CONCUR 2015)},
  pages =	{128--141},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-91-0},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{42},
  editor =	{Luca Aceto and David de Frutos Escrig},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2015/5385},
  URN =		{urn:nbn:de:0030-drops-53853},
  doi =		{10.4230/LIPIcs.CONCUR.2015.128},
  annote =	{Keywords: Choice-freeness, labelled transition systems, persistence, Petri nets, system synthesis}
}

Keywords: Choice-freeness, labelled transition systems, persistence, Petri nets, system synthesis
Collection: 26th International Conference on Concurrency Theory (CONCUR 2015)
Issue Date: 2015
Date of publication: 26.08.2015

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI