{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T03:20:22Z","timestamp":1709263222388},"reference-count":0,"publisher":"Springer Science and Business Media LLC","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory of Computing Systems"],"published-print":{"date-parts":[[1997,9,1]]},"DOI":"10.1007\/s002240000063","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T06:46:52Z","timestamp":1027579612000},"page":"475-494","source":"Crossref","is-referenced-by-count":0,"title":["Deciding a Class of Path Formulas for Conflict-Free Petri Nets"],"prefix":"10.1007","volume":"30","author":[{"given":"Hsu-Chun","family":"Yen","sequence":"first","affiliation":[]},{"given":"Bow-Yaw","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Ming-Sheng","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","container-title":["Theory of Computing Systems"],"original-title":[],"deposited":{"date-parts":[[2019,11,4]],"date-time":"2019-11-04T17:58:03Z","timestamp":1572890283000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s002240000063"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9,1]]},"references-count":0,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1997,9,1]]}},"alternative-id":["X1PW8MBUN2N5HT83"],"URL":"https:\/\/doi.org\/10.1007\/s002240000063","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,9,1]]}}}