License
when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-33563
URL:

; ; ;

Petri Net Reachability Graphs: Decidability Status of FO Properties

pdf-format:


Abstract

We investigate the decidability and complexity status of model-checking problems on unlabelled reachability graphs of Petri nets by considering first-order, modal and pattern-based languages without labels on transitions or atomic propositions on markings. We consider several parameters to separate decidable problems from undecidable ones. Not only are we able to provide precise borders and a systematic analysis, but we also demonstrate the robustness of our proof techniques.

BibTeX - Entry

@InProceedings{darondeau_et_al:LIPIcs:2011:3356,
  author =	{Philippe Darondeau and St{\'e}phane Demri and Roland Meyer and Christophe Morvan},
  title =	{{Petri Net Reachability Graphs: Decidability Status of FO Properties}},
  booktitle =	{IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
  pages =	{140--151},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-34-7},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{13},
  editor =	{Supratik Chakraborty and Amit Kumar},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2011/3356},
  URN =		{urn:nbn:de:0030-drops-33563},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2011.140},
  annote =	{Keywords: Petri nets, First order logic, Reachability graph}
}

Keywords: Petri nets, First order logic, Reachability graph
Seminar: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)
Issue date: 2011
Date of publication: 2011


DROPS-Home | Fulltext Search | Imprint Published by LZI