{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T07:03:39Z","timestamp":1725865419608},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319467498"},{"type":"electronic","value":"9783319467504"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-46750-4_2","type":"book-chapter","created":{"date-parts":[[2016,9,20]],"date-time":"2016-09-20T22:11:57Z","timestamp":1474409517000},"page":"25-29","source":"Crossref","is-referenced-by-count":1,"title":["Petri Nets and Semilinear Sets (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Hsu-Chun","family":"Yen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,22]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0304-3975(77)90059-7","volume":"4","author":"T Araki","year":"1977","unstructured":"Araki, T., Kasami, T.: Decidability problems on the strong connectivity of Petri net reachability sets. Theor. Comput. Sci. 4, 99\u2013119 (1977)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR2","first-page":"24","volume":"30","author":"J Esparza","year":"1997","unstructured":"Esparza, J.: Petri nets, commutative grammars and basic parallel processes. Fundamenta Informaticae 30, 24\u201341 (1997)","journal-title":"Fundamenta Informaticae"},{"key":"2_CR3","unstructured":"Hauschildt, D.: Semilinearity of the Reachability Set is Decidable for Petri Nets. Technical report FBI-HH-B-146\/90, University of Hamburg (1990)"},{"key":"2_CR4","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0304-3975(79)90041-0","volume":"8","author":"J Hopcroft","year":"1979","unstructured":"Hopcroft, J., Pansiot, J.: On the reachability problem for 5-dimensional vector addition systems. Theor. Comput. Sci. 8, 135\u2013159 (1979)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR5","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0019-9958(83)80022-9","volume":"57","author":"D Huynh","year":"1983","unstructured":"Huynh, D.: Commutative grammars: the complexity of uniform word problems. Inf. Control 57, 21\u201339 (1983)","journal-title":"Inf. Control"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Kosaraju, R.: Decidability of reachability in vector addition systems. In: 14th ACM Symposium on Theory of Computing, pp. 267\u2013280 (1982)","DOI":"10.1145\/800070.802201"},{"key":"2_CR7","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1145\/322077.322079","volume":"25","author":"L Landweber","year":"1978","unstructured":"Landweber, L., Robertson, E.: Properties of conflict-free and persistent Petri nets. JACM 25, 352\u2013364 (1978)","journal-title":"JACM"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Leroux, J.: The general vector addition system reachability problem by presburger inductive invariants. In: LICS 2009, pp. 4\u201313. IEEE Computer Society (2009)","DOI":"10.1109\/LICS.2009.10"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Leroux, J.: Presburger vector addition systems. In: LICS 2013, pp. 23\u201332. IEEE Computer Society (2013)","DOI":"10.1109\/LICS.2013.7"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/11562948_36","volume-title":"Automated Technology for Verification and Analysis","author":"J Leroux","year":"2005","unstructured":"Leroux, J., Sutre, G.: Flat counter automata almost everywhere!. In: Peled, D.A., Tsay, Y.-K. (eds.) ATVA 2005. LNCS, vol. 3707, pp. 489\u2013503. Springer, Heidelberg (2005). doi: 10.1007\/11562948_36"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Leroux, J., Schmitz, S.: Demystifying reachability in vector addition systems. In: LICS 2015, pp. 56\u201367. IEEE Computer Society (2015)","DOI":"10.1109\/LICS.2015.16"},{"key":"2_CR12","unstructured":"Lipton, R.: The Reachability Problem Requires Exponential Space. Technical report 62, Yale University, Dept. of CS, January 1976"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Mayr, E.: An algorithm for the general Petri net reachability problem. In: 13th ACM Symposium on Theory of Computing, pp. 238\u2013246 (1981)","DOI":"10.1145\/800076.802477"},{"key":"2_CR14","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0020-0190(81)90117-4","volume":"13","author":"H Yamasaki","year":"1981","unstructured":"Yamasaki, H.: On weak persistency of Petri nets. Inf. Process. Lett. 13, 94\u201397 (1981)","journal-title":"Inf. Process. Lett."},{"key":"2_CR15","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0304-3975(84)90038-0","volume":"31","author":"H Yamasaki","year":"1984","unstructured":"Yamasaki, H.: Normal Petri nets. Theor. Comput. Sci. 31, 307\u2013315 (1984)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR16","series-title":"Studies in Computational Intelligence","first-page":"343","volume-title":"Recent Advances in Formal Languages and Applications","author":"H Yen","year":"2006","unstructured":"Yen, H.: Introduction to Petri net theory. In: Esik, Z., Martin-Vide, C., Mitrana, V. (eds.) Recent Advances in Formal Languages and Applications. Studies in Computational Intelligence, vol. 25, pp. 343\u2013373. Springer, Heidelberg (2006)"},{"issue":"4","key":"2_CR17","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1142\/S0129054109006759","volume":"20","author":"H Yen","year":"2009","unstructured":"Yen, H.: Path decomposition and semilinearity of Petri nets. Int. J. Found. Comput. Sci. 20(4), 581\u2013596 (2009)","journal-title":"Int. J. Found. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2016"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-46750-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T16:29:30Z","timestamp":1568392170000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-46750-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319467498","9783319467504"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46750-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}