{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:25:41Z","timestamp":1758266741130},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319510453"},{"type":"electronic","value":"9783319510460"}],"license":[{"start":{"date-parts":[[2016,12,18]],"date-time":"2016-12-18T00:00:00Z","timestamp":1482019200000},"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-51046-0_8","type":"book-chapter","created":{"date-parts":[[2016,12,17]],"date-time":"2016-12-17T12:05:53Z","timestamp":1481976353000},"page":"144-161","source":"Crossref","is-referenced-by-count":2,"title":["What Makes Petri Nets Harder to Verify: Stack or Data?"],"prefix":"10.1007","author":[{"given":"Ranko","family":"Lazi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Totzke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,18]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., \u010cer\u0101ns, K., Jonsson, B., Tsay, Y.-K.: Algorithmic analysis of programs with well quasi-ordered domains. Inform. Comput. 160(1\u20132), 109\u2013127 (2000)","DOI":"10.1006\/inco.1999.2843"},{"key":"8_CR2","unstructured":"Atig, M.F., Ganty, P.: Approximating Petri net reachability along context-free traces. In: FSTTCS. LIPIcs, vol. 13, pp. 152\u2013163. LZI (2011)"},{"issue":"3:4","key":"8_CR3","first-page":"1","volume":"10","author":"M Boja\u0144czyk","year":"2014","unstructured":"Boja\u0144czyk, M., Klin, B., Lasota, S.: Automata theory in nominal sets. Logic. Meth. Comput. Sci. 10(3:4), 1\u201344 (2014)","journal-title":"Logic. Meth. Comput. Sci."},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Chambart, P., Schnoebelen, P.: The ordinal recursive complexity of lossy channel systems. In: LICS, pp. 205\u2013216. IEEE Press (2008)","DOI":"10.1109\/LICS.2008.47"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-662-49630-5_16","volume-title":"Foundations of Software Science and Computation Structures","author":"N Decker","year":"2016","unstructured":"Decker, N., Thoma, D.: On freeze LTL with ordered attributes. In: Jacobs, B., L\u00f6ding, C. (eds.) FoSSaCS 2016. LNCS, vol. 9634, pp. 269\u2013284. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-49630-5_16"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Figueira, D., Figueira, S., Schmitz, S., Schnoebelen, P.: Ackermannian and primitive-recursive bounds with Dickson\u2019s Lemma. In: LICS, pp. 269\u2013278. IEEE Press (2011)","DOI":"10.1109\/LICS.2011.39"},{"issue":"1\u20132","key":"8_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ic.2004.01.005","volume":"195","author":"A Finkel","year":"2004","unstructured":"Finkel, A., McKenzie, P., Picaronny, C.: A well-structured framework for analysing Petri net extensions. Inform. Comput. 195(1\u20132), 1\u201329 (2004)","journal-title":"Inform. Comput."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theor. Comput. Sci. 256(1\u20132), 63\u201392 (2001)","DOI":"10.1016\/S0304-3975(00)00102-X"},{"issue":"4:4","key":"8_CR9","first-page":"1","volume":"10","author":"C Haase","year":"2014","unstructured":"Haase, C., Schmitz, S., Schnoebelen, P.: The power of priority channel systems. Logic. Meth. Comput. Sci. 10(4:4), 1\u201339 (2014)","journal-title":"Logic. Meth. Comput. Sci."},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Haddad, S., Schmitz, S., Schnoebelen, P.: The ordinal recursive complexity of timed-arc Petri nets, data nets, and other enriched nets. In: LICS, pp. 355\u2013364. IEEE Press (2012)","DOI":"10.1109\/LICS.2012.46"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-662-49630-5_26","volume-title":"Foundations of Software Science and Computation Structures","author":"P Hofman","year":"2016","unstructured":"Hofman, P., Lasota, S., Lazi\u0107, R., Leroux, J., Schmitz, S., Totzke, P.: Coverability trees for Petri nets with unordered data. In: Jacobs, B., L\u00f6ding, C. (eds.) FoSSaCS 2016. LNCS, vol. 9634, pp. 445\u2013461. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-49630-5_26"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Hofman, P., Leroux, J., Totzke, P.: Linear combinations of unordered data vectors. arXiv:1610.01470 [cs.LO] (2016)","DOI":"10.1109\/LICS.2017.8005065"},{"key":"8_CR13","series-title":"Monographs in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03241-1","volume-title":"Coloured Petri Nets - Basic Concepts, Analysis Methods and Practical Use - Volume 1","author":"K Jensen","year":"1996","unstructured":"Jensen, K.: Coloured Petri Nets - Basic Concepts, Analysis Methods and Practical Use - Volume 1. Monographs in Theoretical Computer Science. An EATCS Series, 2nd edn. Springer, Heidelberg (1996)","edition":"2"},{"key":"8_CR14","unstructured":"Lazi\u0107, R.: The reachability problem for vector addition systems with a stack is not elementary. arXiv:1310.1767 [cs.FL] (2013)"},{"issue":"3","key":"8_CR15","first-page":"251","volume":"88","author":"R Lazi\u0107","year":"2008","unstructured":"Lazi\u0107, R., Newcomb, T., Ouaknine, J., Roscoe, A.W., Worrell, J.: Nets with tokens which carry data. Fund. Inform. 88(3), 251\u2013274 (2008)","journal-title":"Fund. Inform."},{"issue":"3","key":"8_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2874774","volume":"17","author":"R Lazi\u0107","year":"2016","unstructured":"Lazi\u0107, R., Ouaknine, J., Worrell, J.: Zeno, Hercules, and the Hydra: Safety metric temporal logic is Ackermann-complete. ACM Trans. Comput. Logic 17(3), 1\u201327 (2016). Article 16","journal-title":"ACM Trans. Comput. Logic"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Lazi\u0107, R., Schmitz, S.: The complexity of coverability in $$\\nu $$ -Petri nets. In: LICS, pp. 467\u2013476. ACM (2016)","DOI":"10.1145\/2933575.2933593"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Leroux, J., Praveen, M., Sutre, G.: Hyper-Ackermannian bounds for pushdown vector addition systems. In: CSL-LICS, pp. 63:1\u201363:10. ACM (2014)","DOI":"10.1145\/2603088.2603146"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-319-24537-9_10","volume-title":"Reachability Problems","author":"J Leroux","year":"2015","unstructured":"Leroux, J., Sutre, G., Totzke, P.: On boundedness problems for pushdown vector addition systems. In: Boja\u0144czyk, M., Lasota, S., Potapov, I. (eds.) RP 2015. LNCS, vol. 9328, pp. 101\u2013113. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-24537-9_10"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-662-47666-6_26","volume-title":"Automata, Languages, and Programming","author":"J Leroux","year":"2015","unstructured":"Leroux, J., Sutre, G., Totzke, P.: On the coverability problem for pushdown vector addition systems in one dimension. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 324\u2013336. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-47666-6_26"},{"key":"8_CR21","unstructured":"Lipton, R.: The reachability problem requires exponential space. Technical report 62. Yale University (1976)"},{"issue":"2","key":"8_CR22","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(2), 223\u2013231 (1978)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR23","unstructured":"Rosa-Velardo, F.: Ordinal recursive complexity of unordered data nets. Technical report TR-4-14. Universidad Complutense de Madrid (2014)"},{"issue":"34","key":"8_CR24","doi-asserted-by":"crossref","first-page":"4439","DOI":"10.1016\/j.tcs.2011.05.007","volume":"412","author":"F Rosa-Velardo","year":"2011","unstructured":"Rosa-Velardo, F., de Frutos-Escrig, D.: Decidability and complexity of Petri nets with unordered data. Theor. Comput. Sci. 412(34), 4439\u20134451 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"8_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2858784","volume":"8","author":"S Schmitz","year":"2016","unstructured":"Schmitz, S.: Complexity hierarchies beyond Elementary. ACM Trans. Comput. Theor. 8(1), 1\u201336 (2016)","journal-title":"ACM Trans. Comput. Theor."},{"key":"8_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-642-22012-8_35","volume-title":"Automata, Languages and Programming","author":"S Schmitz","year":"2011","unstructured":"Schmitz, S., Schnoebelen, P.: Multiply-recursive upper bounds with Higman\u2019s lemma. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6756, pp. 441\u2013452. Springer Berlin Heidelberg, Berlin, Heidelberg (2011). doi: 10.1007\/978-3-642-22012-8_35"},{"key":"8_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1007\/978-3-642-15155-2_54","volume-title":"Mathematical Foundations of Computer Science 2010","author":"P Schnoebelen","year":"2010","unstructured":"Schnoebelen, P.: Revisiting Ackermann-hardness for lossy counter machines and reset Petri nets. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 616\u2013628. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-15155-2_54"},{"key":"8_CR28","unstructured":"Stockmeyer, L.J.: The complexity of decision procedures in Automata Theory and Logic, Ph.D. thesis. MIT, Project MAC TR-133 (1974)"}],"container-title":["Lecture Notes in Computer Science","Concurrency, Security, and Puzzles"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-51046-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,16]],"date-time":"2019-09-16T17:00:03Z","timestamp":1568653203000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-51046-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,18]]},"ISBN":["9783319510453","9783319510460"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-51046-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016,12,18]]}}}