{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:46:39Z","timestamp":1740098799935,"version":"3.37.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319519623"},{"type":"electronic","value":"9783319519630"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-51963-0_8","type":"book-chapter","created":{"date-parts":[[2017,1,10]],"date-time":"2017-01-10T01:17:39Z","timestamp":1484011059000},"page":"91-102","source":"Crossref","is-referenced-by-count":3,"title":["Deciding Structural Liveness of Petri Nets"],"prefix":"10.1007","author":[{"given":"Petr","family":"Jan\u010dar","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,11]]},"reference":[{"issue":"1\u20132","key":"8_CR1","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1006\/inco.1999.2843","volume":"160","author":"PA Abdulla","year":"2000","unstructured":"Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.: Algorithmic analysis of programs with well quasi-ordered domains. Inf. Comput. 160(1\u20132), 109\u2013127 (2000). http:\/\/dx.doi.org\/10.1006\/inco.1999.2843","journal-title":"Inf. Comput."},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/3-540-61363-3_4","volume-title":"Application and Theory of Petri Nets 1996","author":"K Barkaoui","year":"1996","unstructured":"Barkaoui, K., Pradat-Peyre, J.: On liveness and controlled siphons in Petri nets. Application and Theory of Petri Nets 1996. LNCS, vol. 1091, pp. 57\u201372. Springer, Heidelberg (1996). doi: 10.1007\/3-540-61363-3_4"},{"issue":"6","key":"8_CR3","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.ipl.2016.01.011","volume":"116","author":"E Best","year":"2016","unstructured":"Best, E., Esparza, J.: Existence of home states in Petri nets is decidable. Inf. Process. Lett. 116(6), 423\u2013427 (2016). http:\/\/dx.doi.org\/10.1016\/j.ipl.2016.01.011","journal-title":"Inf. Process. Lett."},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/3-540-65306-6_20","volume-title":"Lectures on Petri Nets I: Basic Models","author":"J Esparza","year":"1998","unstructured":"Esparza, J.: Decidability and complexity of Petri net problems\u2014an introduction. In: Reisig, W., Rozenberg, G. (eds.) ACPN 1996. LNCS, vol. 1491, pp. 374\u2013428. Springer, Heidelberg (1998). doi: 10.1007\/3-540-65306-6_20"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Finkel, A., Goubault-Larrecq, J.: Forward analysis for WSTS, Part II: complete WSTS. Logical Methods Comput. Sci. 8(3) (2012). http:\/\/dx.doi.org\/10.2168\/LMCS-8(3:28)2012","DOI":"10.2168\/LMCS-8(3:28)2012"},{"issue":"1\u20132","key":"8_CR6","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere!. Theor. Comput. Sci. 256(1\u20132), 63\u201392 (2001). http:\/\/dx.doi.org\/10.1016\/S0304-3975(00)00102-X","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"8_CR7","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"S Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.H.: Semigroups, presburger formulas, and languages. Pacific J. Math. 16(2), 285\u2013296 (1966)","journal-title":"Pacific J. Math."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Hack, M.: The recursive equivalence of the reachability problem and the liveness problem for Petri nets and vector addition systems. In: 15th Annual Symposium on Switching and Automata Theory, New Orleans, Louisiana, USA, October 14\u201316, 1974, pp. 156\u2013164. IEEE Computer Society (1974). http:\/\/dx.doi.org\/10.1109\/SWAT.1974.28","DOI":"10.1109\/SWAT.1974.28"},{"key":"8_CR9","unstructured":"Hack, M.: Decidability Questions for Petri Nets. Outstanding Dissertations in the Computer Sciences. Garland Publishing, New York (1975)"},{"key":"8_CR10","unstructured":"Leroux, J.: Vector addition systems reachability problem (A simpler solution). In: Voronkov, A. (ed.) Turing-100 - The Alan Turing Centenary, Manchester, UK, June 22\u201325, 2012. EPiC Series in Computing, vol. 10, pp. 214\u2013228. EasyChair (2012). http:\/\/www.easychair.org\/publications\/?page=1673703727"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Leroux, J.: Presburger vector addition systems. In: 28th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, June 25\u201328, 2013, pp. 23\u201332. IEEE Computer Society (2013). http:\/\/dx.doi.org\/10.1109\/LICS.2013.7","DOI":"10.1109\/LICS.2013.7"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Leroux, J., Schmitz, S.: Demystifying reachability in vector addition systems. In: 30th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6\u201310, 2015, pp. 56\u201367. IEEE Computer Society (2015). http:\/\/dx.doi.org\/10.1109\/LICS.2015.16","DOI":"10.1109\/LICS.2015.16"},{"issue":"3","key":"8_CR13","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"EW Mayr","year":"1984","unstructured":"Mayr, E.W.: An algorithm for the general petri net reachability problem. SIAM J. Comput. 13(3), 441\u2013460 (1984). http:\/\/dx.doi.org\/10.1137\/0213029","journal-title":"SIAM J. Comput."},{"key":"8_CR14","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(78)90036-1","volume":"6","author":"C Rackoff","year":"1978","unstructured":"Rackoff, C.: The covering and boundedness problems for vector addition systems. Theor. Comput. Sci. 6, 223\u2013231 (1978)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-33278-4","volume-title":"Understanding Petri Nets (Modeling Techniques, Analysis Methods, Case Studies)","author":"W Reisig","year":"2013","unstructured":"Reisig, W.: Understanding Petri Nets (Modeling Techniques, Analysis Methods, Case Studies). Springer, Heidelberg (2013). 230 pp"},{"key":"8_CR16","volume-title":"Entscheidbarkeit bei Petri Netzen: \u00dcberblick und Kompendium","author":"H Wimmel","year":"2008","unstructured":"Wimmel, H.: Entscheidbarkeit bei Petri Netzen: \u00dcberblick und Kompendium. Springer, Heidelberg (2008). 242 pp"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2017: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-51963-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T03:46:23Z","timestamp":1498362383000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-51963-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319519623","9783319519630"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-51963-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}