-
Selection by year
-
Selection by authors
-
Complete lists
morvan11a
Ph. Darondeau, S. Demri, R. Meyer, Ch. Morvan. Petri Net Reachability Graphs: Decidability Status of FO Properties. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011), Leibniz International Proceedings in Informatics (LIPIcs), Volume 13, Pages 140-151, Bombay, India, 2011.
Download [help]
Download paper: (link)
Copyright notice:
This material is presented to ensure timely dissemination of scholarly and
technical work. Copyright and all rights therein are retained by authors or
by other copyright holders. All persons copying this information are expected
to adhere to the terms and constraints invoked by each author's
copyright. These works may not be reposted without the explicit permission of
the copyright holder.
This page is automatically generated by bib2html v216, © INRIA 2002-2007, Projet Lagadic
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
Contact
BibTex Reference
@InProceedings{morvan11a,
Author = {Darondeau, Ph. and Demri, S. and Meyer, R. and Morvan, Ch.},
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)},
Volume = {13},
Pages = {140--151},
Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
Publisher = {Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik},
Address = {Bombay, India},
Year = {2011}
}
EndNote Reference [help]
Get EndNote Reference (.ref)