Philippe Darondeau, Stephane Demri, Roland Meyer, Christophe Morvan. Petri Net Reachability Graphs: Decidability Status of First Order Properties. Logical Methods in Computer Science, 8(4):1-28, October 2012.
Download paper:
Doi page
Download paper:
Adobe portable document (pdf) 
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
We investigate the decidability and complexity status of model-checking problems on unlabelled reachability graphs of Petri nets by considering first-order and modal 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
Christophe Morvan http://www-igm.univ-mlv.fr/~cmorvan/
@article{darondeau:hal-00743935,
Author = {Darondeau, Philippe and Demri, Stephane and Meyer, Roland and Morvan, Christophe},
Title = {{Petri Net Reachability Graphs: Decidability Status of First Order Properties}},
Journal = {{Logical Methods in Computer Science}},
Volume = {8},
Number = {4},
Pages = {1--28},
Publisher = {International Federation of Computational Logic},
Month = {October},
Year = {2012}
}
Get EndNote Reference (.ref)
|
| VerTeCs
| Team
| Publications
| New Results
| Softwares
|
Irisa - Inria - Copyright 2005 © Projet VerTeCs |