{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:47:31Z","timestamp":1725493651665},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405344"},{"type":"electronic","value":"9783540450719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45071-8_17","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T08:04:43Z","timestamp":1193472283000},"page":"149-158","source":"Crossref","is-referenced-by-count":4,"title":["Petri Nets with Simple Circuits"],"prefix":"10.1007","author":[{"given":"Hsu-Chun","family":"Yen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lien-Po","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"17_CR1","first-page":"24","volume":"30","author":"J. Esparza","year":"1997","unstructured":"Esparza, J. Petri nets, commutative context-free grammars and basic parallel processes, Fundamenta Informaticae 30, 24\u201341, 1997.","journal-title":"Fundamenta Informaticae"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s002360050074","volume":"34","author":"J. Esparza","year":"1997","unstructured":"Esparza, J. Decidability of model checking for infinite-state concurrent systems, Acta Inform. 34, 85\u2013107, 1997.","journal-title":"Acta Inform"},{"key":"17_CR3","unstructured":"Fribourg, L. Petri nets, flat languages and linear arithmetic. 9th Int. Workshop. on Functional and Logic Programming, pp. 344\u2013365, 2000."},{"key":"17_CR4","first-page":"213","volume":"1243","author":"L. Fribourg","year":"1997","unstructured":"Fribourg, L. and Ols\u00e9n, H. Proving safety properties of infinite state systems by compilation into Presburger arithmetic, LNCS 1243, 213\u2013227, 1997.","journal-title":"LNCS"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1023\/A:1009747629591","volume":"2","author":"L. Fribourg","year":"1997","unstructured":"Fribourg, L. and Ols\u00e9n, H. A decompositional approach for computing least fixed-points of datalog programs with z-counters, Constraints, An International Journal 2, 305\u2013335, 1997.","journal-title":"Constraints, An International Journal"},{"key":"17_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/3-540-50580-6_30","volume-title":"Advances in Petri Nets","author":"R. Howell","year":"1988","unstructured":"Howell, R. and Rosier, L. On questions of fairness and temporal logic for conflict-free Petri nets, In G. Rozenberg, editor, Advances in Petri Nets, LNCS 340, 200\u2013226, Springer-Verlag, Berlin, 1988."},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-0000(93)90046-Y","volume":"46","author":"R. Howell","year":"1993","unstructured":"Howell, R., Rosier, L. and Yen, H. Normal and sinkless Petri nets, J. of Computer and System Sciences 46, 1\u201326, 1993.","journal-title":"J. of Computer and System Sciences"},{"key":"17_CR8","first-page":"115","volume":"103","author":"A. Ichikawa","year":"1987","unstructured":"Ichikawa, A. and Hiraishi, K. Analysis and control of discrete event systems represented by Petri nets, LNCIS 103, 115\u2013134, 1987.","journal-title":"LNCIS"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Kosaraju, R. Decidability of reachability in vector addition systems, Proc. the 14th Annual ACM Symposium on Theory of Computing, 267\u2013280, 1982.","DOI":"10.1145\/800070.802201"},{"key":"17_CR10","unstructured":"Lipton, R. The reachability problem requires exponential space, Technical Report 62, Yale University, Dept. of CS., Jan. 1976."},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"E. Mayr","year":"1984","unstructured":"Mayr, E. An algorithm for the general Petri net reachability problem, SIAM J. Comput. 13, 441\u2013460, 1984.","journal-title":"SIAM J. Comput."},{"key":"17_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/3-540-62034-6_40","volume-title":"Proc. FSTTCS\u201996","author":"R. Mayr","year":"1996","unstructured":"Mayr, R. Weak bisimulation and model checking for basic parallel processes, Proc. FSTTCS\u201996, LNCS 1180, 88\u201399, 1996."},{"issue":"4","key":"17_CR13","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T. Murata","year":"1989","unstructured":"Murata, T. Petri nets: properties, analysis and applications, Proc. Of the IEEE 77(4), 541\u2013580, 1989.","journal-title":"Proc. Of the IEEE"},{"key":"17_CR14","unstructured":"Ols\u00e9n, H. Automatic verification of Petri nets in a CLP framework, Ph.D. Thesis, Dept. of Computer and Information Science, IDA, Link\u00f6ping Univ., 1997."},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0304-3975(84)90038-0","volume":"31","author":"H. Yamasaki","year":"1984","unstructured":"Yamasaki, H. Normal Petri nets, Theoretical Comput. Science 31, 307\u2013315, 1984.","journal-title":"Theoretical Comput. Science"},{"issue":"1","key":"17_CR16","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0890-5401(92)90059-O","volume":"96","author":"H. Yen","year":"1992","unstructured":"Yen, H. A unified approach for deciding the existence of certain Petri net paths, Inform. and Comput., 96(1), 119\u2013137, 1992.","journal-title":"Inform. and Comput."},{"issue":"2","key":"17_CR17","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1006\/inco.1996.0013","volume":"124","author":"H. Yen","year":"1996","unstructured":"Yen, H. On the regularity of Petri net languages, Inform. and Comput., 124(2), 168\u2013181, 1996.","journal-title":"Inform. and Comput."},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/S0304-3975(96)00147-8","volume":"179","author":"H. Yen","year":"1997","unstructured":"Yen, H. On reachability equivalence for BPP-nets, Theoretical Computer Science, 179, 301\u2013317, 1997.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45071-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T02:09:05Z","timestamp":1556935745000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45071-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405344","9783540450719"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45071-8_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}