{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T15:44:16Z","timestamp":1784216656442,"version":"3.55.0"},"reference-count":11,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2011,6]]},"abstract":"<jats:p> In [19], Yen defines a class of formulas for paths in Petri nets and claims that its satisfiability problem is EXPSPACE-complete. In this paper, we show that in fact the satisfiability problem for this class of formulas is as hard as the reachability problem for Petri nets. Moreover, we salvage almost all of Yen's results by defining a fragment of this class of formulas for which the satisfiability problem is EXPSPACE-complete by adapting his proof. <\/jats:p>","DOI":"10.1142\/s0129054111008428","type":"journal-article","created":{"date-parts":[[2011,6,10]],"date-time":"2011-06-10T12:52:34Z","timestamp":1307710354000},"page":"783-799","source":"Crossref","is-referenced-by-count":20,"title":["ON YEN'S PATH LOGIC FOR PETRI NETS"],"prefix":"10.1142","volume":"22","author":[{"given":"MOHAMED FAOUZI","family":"ATIG","sequence":"first","affiliation":[{"name":"LIAFA, CNRS &amp; University Paris Diderot (Paris 7), Case 7014, 75205 Paris 13, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"PETER","family":"HABERMEHL","sequence":"additional","affiliation":[{"name":"LIAFA, CNRS &amp; University Paris Diderot (Paris 7), Case 7014, 75205 Paris 13, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf3","first-page":"244","volume":"52","author":"Esparza Javier","journal-title":"Bulletin of the EATCS"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(91)90228-T"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90173-D"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289268"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(78)90036-1"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1007\/BF00290730"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289715"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(81)90067-2"},{"key":"rf19","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90059-O"},{"key":"rf20","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0020-0190(95)00168-2","volume":"56","author":"Yen Hsu-Chun","journal-title":"Inf. Process. Lett."},{"key":"rf21","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.0013"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054111008428","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:33:16Z","timestamp":1565137996000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054111008428"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":11,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2011,6]]}},"alternative-id":["10.1142\/S0129054111008428"],"URL":"https:\/\/doi.org\/10.1142\/s0129054111008428","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6]]}}}