文章基本信息

标题：Petri Net Reachability Graphs: Decidability Status of FO Properties
本地全文：下载
作者：Philippe Darondeau ; St{\'e}phane Demri ; Roland Meyer 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2011
卷号：13
页码：140-151
DOI：10.4230/LIPIcs.FSTTCS.2011.140
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：Petri nets; First order logic; Reachability graph