{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:37:04Z","timestamp":1753889824390,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2012,10,22]],"date-time":"2012-10-22T00:00:00Z","timestamp":1350864000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We investigate the decidability and complexity status of model-checking\nproblems on unlabelled reachability graphs of Petri nets by considering\nfirst-order and modal languages without labels on transitions or atomic\npropositions on markings. We consider several parameters to separate decidable\nproblems from undecidable ones. Not only are we able to provide precise borders\nand a systematic analysis, but we also demonstrate the robustness of our proof\ntechniques.<\/jats:p>","DOI":"10.2168\/lmcs-8(4:9)2012","type":"journal-article","created":{"date-parts":[[2013,11,29]],"date-time":"2013-11-29T13:21:33Z","timestamp":1385731293000},"source":"Crossref","is-referenced-by-count":5,"title":["Petri Net Reachability Graphs: Decidability Status of First Order Properties"],"prefix":"10.46298","volume":"Volume 8, Issue 4","author":[{"given":"Philippe","family":"Darondeau","sequence":"first","affiliation":[]},{"given":"Stephane","family":"Demri","sequence":"additional","affiliation":[]},{"given":"Roland","family":"Meyer","sequence":"additional","affiliation":[]},{"given":"Christophe","family":"Morvan","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2012,10,22]]},"reference":[{"key":"744:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/872\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/872\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T19:58:16Z","timestamp":1681243096000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/872"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,22]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-8(4:9)2012","relation":{"is-same-as":[{"id-type":"arxiv","id":"1210.2972","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1210.2972","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2012,10,22]]},"article-number":"872"}}