{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T11:52:11Z","timestamp":1761393131762,"version":"3.28.0"},"reference-count":8,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/iscas.2003.1205001","type":"proceedings-article","created":{"date-parts":[[2003,11,21]],"date-time":"2003-11-21T01:19:26Z","timestamp":1069377566000},"page":"III-244-III-247","source":"Crossref","is-referenced-by-count":8,"title":["Insufficiently marked siphon of Petri nets - extension of token-free siphon"],"prefix":"10.1109","volume":"3","author":[{"given":"A.","family":"Ohta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Tsuji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/3-540-55676-1_4","article-title":"A polynomial-time graph algorithm to decide liveness of some basic classes of bounded Petri nets","volume":"616","author":"barkaoui","year":"1992","journal-title":"Lecture Notes in Computer Science"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/978-3-540-47919-2_8","article-title":"Structure theory of Petri nets: the free choice hiatus","volume":"254","author":"best","year":"1987","journal-title":"Lecture Notes in Computer Science"},{"key":"ref6","first-page":"1817","article-title":"Finding minimal siphons in general Petri nets","volume":"e79 a","author":"tanimoto","year":"1996","journal-title":"IEICE Trans Fundamentals"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1007\/3-540-58152-9_20","article-title":"Liveness in Bounded Petri Nets which are Covered by T-invariants","volume":"815","author":"lautenbach","year":"1994","journal-title":"Lecture Notes in Computer Science"},{"key":"ref8","first-page":"771","article-title":"A Heuristic Algorithm FMDB for the Minimum Initial Marking Problem of Petri Nets","volume":"e84 a","author":"nishi","year":"2001","journal-title":"IEICE Trans Fundamentals"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0019979"},{"key":"ref2","article-title":"The reachability problem and the boundedness problem for Petri nets are exponential space hard","author":"lipton","year":"1976","journal-title":"Yale Research Report"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/5.24143"}],"event":{"name":"ISCAS 2003. International Symposium on Circuits and Systems","acronym":"ISCAS-03","location":"Bangkok, Thailand"},"container-title":["Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8570\/27130\/01205001.pdf?arnumber=1205001","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T02:26:59Z","timestamp":1497580019000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1205001\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":8,"URL":"https:\/\/doi.org\/10.1109\/iscas.2003.1205001","relation":{},"subject":[]}}