License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2017.6
URN: urn:nbn:de:0030-drops-77802
URL: http://drops.dagstuhl.de/opus/volltexte/2017/7780/
Go to the corresponding LIPIcs Volume Portal


Schlachter, Uli ; Wimmel, Harro

k-Bounded Petri Net Synthesis from Modal Transition Systems

pdf-format:
LIPIcs-CONCUR-2017-6.pdf (0.6 MB)


Abstract

We present a goal-oriented algorithm that can synthesise k-bounded Petri nets (k in N^+) from hyper modal transition systems (hMTS), an extension of labelled transition systems with optional and required behaviour. The algorithm builds a potential reachability graph of a Petri net from scratch, extending it stepwise with required behaviour from the given MTS and over-approximating the result to a new valid reachability graph. Termination occurs if either the MTS yields no additional requirements or the resulting net of the second step shows a conflict with the behaviour allowed by the MTS, making it non-sythesisable.

BibTeX - Entry

@InProceedings{schlachter_et_al:LIPIcs:2017:7780,
  author =	{Uli Schlachter and Harro Wimmel},
  title =	{{k-Bounded Petri Net Synthesis from Modal Transition Systems}},
  booktitle =	{28th International Conference on Concurrency Theory (CONCUR 2017)},
  pages =	{6:1--6:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-048-4},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{85},
  editor =	{Roland Meyer and Uwe Nestmann},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7780},
  URN =		{urn:nbn:de:0030-drops-77802},
  doi =		{10.4230/LIPIcs.CONCUR.2017.6},
  annote =	{Keywords: Modal transition system, bounded Petri net, synthesis}
}

Keywords: Modal transition system, bounded Petri net, synthesis
Seminar: 28th International Conference on Concurrency Theory (CONCUR 2017)
Issue Date: 2017
Date of publication: 25.08.2017


DROPS-Home | Fulltext Search | Imprint Published by LZI