{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:49Z","timestamp":1760202709326},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662496299"},{"type":"electronic","value":"9783662496305"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49630-5_26","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T09:04:32Z","timestamp":1458551072000},"page":"445-461","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Coverability Trees for Petri Nets with Unordered Data"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Hofman","sequence":"first","affiliation":[]},{"given":"S\u0142awomir","family":"Lasota","sequence":"additional","affiliation":[]},{"given":"Ranko","family":"Lazi\u0107","sequence":"additional","affiliation":[]},{"given":"J\u00e9r\u00f4me","family":"Leroux","sequence":"additional","affiliation":[]},{"given":"Sylvain","family":"Schmitz","sequence":"additional","affiliation":[]},{"given":"Patrick","family":"Totzke","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1\u20132","key":"26_CR1","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1999.2843","volume":"160","author":"PA Abdulla","year":"2000","unstructured":"Abdulla, P.A., \u010cer\u0101ns, K., Jonsson, B., Tsay, Y.K.: Algorithmic analysis of programs with well quasi-ordered domains. Inform. and Comput. 160(1\u20132), 109\u2013127 (2000)","journal-title":"Inform. and Comput."},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-642-22993-0_13","volume-title":"Mathematical Foundations of Computer Science 2011","author":"M Blockelet","year":"2011","unstructured":"Blockelet, M., Schmitz, S.: Model checking coverability graphs of vector addition systems. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol. 6907, pp. 108\u2013119. Springer, Heidelberg (2011)"},{"issue":"3:4","key":"26_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":"26_CR4","doi-asserted-by":"crossref","unstructured":"Cardoza, E., Lipton, R.J., Meyer, A.R.: Exponential space complete problems for Petri nets and commutative semigroups: preliminary report. In: STOC 1976, pp. 50\u201354. ACM (1976)","DOI":"10.1145\/800113.803630"},{"issue":"5","key":"26_CR5","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/j.jcss.2013.01.014","volume":"79","author":"S Demri","year":"2013","unstructured":"Demri, S.: On selective unboundedness of VASS. J. Comput. Syst. Sci. 79(5), 689\u2013713 (2013)","journal-title":"J. Comput. Syst. Sci."},{"key":"26_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 2011, pp. 269\u2013278. IEEE Press (2011)","DOI":"10.1109\/LICS.2011.39"},{"issue":"1\u20132","key":"26_CR7","doi-asserted-by":"publisher","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)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Finkel, A., Goubault-Larrecq, J.: Forward analysis for WSTS, part I: completions. In: STACS 2009. LIPIcs, vol. 3, pp. 433\u2013444. LZI (2009)","DOI":"10.1007\/978-3-642-02930-1_16"},{"issue":"3:28","key":"26_CR9","first-page":"1","volume":"8","author":"A Finkel","year":"2012","unstructured":"Finkel, A., Goubault-Larrecq, J.: Forward analysis for WSTS, part II: complete WSTS. Logic. Meth. Comput. Sci. 8(3:28), 1\u201335 (2012)","journal-title":"Logic. Meth. Comput. Sci."},{"issue":"1\u20132","key":"26_CR10","doi-asserted-by":"publisher","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. and Comput. 195(1\u20132), 1\u201329 (2004)","journal-title":"Inform. and Comput."},{"key":"26_CR11","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 2012, pp. 355\u2013364. IEEE Press (2012)","DOI":"10.1109\/LICS.2012.46"},{"issue":"2","key":"26_CR12","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"RM Karp","year":"1969","unstructured":"Karp, R.M., Miller, R.E.: Parallel program schemata. J. Comput. Syst. Sci. 3(2), 147\u2013195 (1969)","journal-title":"J. Comput. Syst. Sci."},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Kosaraju, S.R.: Decidability of reachability in vector addition systems. In: Proceedings STOC 1982, pp. 267\u2013281. ACM (1982)","DOI":"10.1145\/800070.802201"},{"issue":"1","key":"26_CR14","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0304-3975(92)90173-D","volume":"99","author":"JL Lambert","year":"1992","unstructured":"Lambert, J.L.: A structure to decide reachability in Petri nets. Theor. Comput. Sci. 99(1), 79\u2013104 (1992)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"26_CR15","first-page":"251","volume":"88","author":"R Lazi\u0107","year":"2008","unstructured":"Lazi\u0107, R., Newcomb, T., Ouaknine, J., Roscoe, A., Worrell, J.: Nets with tokens which carry data. Fund. Inform. 88(3), 251\u2013274 (2008)","journal-title":"Fund. Inform."},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Leroux, J., Schmitz, S.: Demystifying reachability in vector addition systems. In: LICS 2015, pp. 56\u201367. IEEE Press (2015)","DOI":"10.1109\/LICS.2015.16"},{"key":"26_CR17","unstructured":"Lipton, R.: The reachability problem requires exponential space. Technical Report 62, Yale University (1976)"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Mayr, E.W.: An algorithm for the general Petri net reachability problem. In: Proceedings STOC 1981, pp. 238\u2013246. ACM (1981)","DOI":"10.1145\/800076.802477"},{"issue":"2","key":"26_CR19","doi-asserted-by":"publisher","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":"26_CR20","unstructured":"Rosa-Velardo, F.: Ordinal recursive complexity of unordered data nets. Technical Report TR-4-14, Departamento de Sistemas Inform\u00e1ticos y Computaci\u00f3n, Universidad Complutense de Madrid (2014). http:\/\/antares.sip.ucm.es\/frosa\/docs\/complexityUDN.pdf"},{"issue":"34","key":"26_CR21","doi-asserted-by":"publisher","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":"3\u20134","key":"26_CR22","doi-asserted-by":"crossref","first-page":"313","DOI":"10.3233\/FI-2011-611","volume":"113","author":"F Rosa-Velardo","year":"2011","unstructured":"Rosa-Velardo, F., Martos-Salgado, M., de Frutos-Escrig, D.: Accelerations for the coverability set of Petri nets with names. Fund. Inform. 113(3\u20134), 313\u2013341 (2011)","journal-title":"Fund. Inform."},{"key":"26_CR23","unstructured":"Schmitz, S.: Complexity hierarchies beyond elementary. ACM Trans. Comput. Theor. (2016) (to appear). http:\/\/arxiv.org\/abs\/1312.5686"},{"key":"26_CR24","unstructured":"Schmitz, S., Schnoebelen, P.: Algorithmic aspects of WQO theory. Lecture notes (2012). http:\/\/cel.archives-ouvertes.fr\/cel-00727025"},{"key":"26_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/978-3-642-40184-8_2","volume-title":"CONCUR 2013 \u2013 Concurrency Theory","author":"S Schmitz","year":"2013","unstructured":"Schmitz, S., Schnoebelen, P.: The power of well-structured systems. In: D\u2019Argenio, P.R., Melgratti, H. (eds.) CONCUR 2013 \u2013 Concurrency Theory. LNCS, vol. 8052, pp. 5\u201324. Springer, Heidelberg (2013)"},{"key":"26_CR26","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)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49630-5_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,15]],"date-time":"2022-06-15T19:21:17Z","timestamp":1655320877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49630-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662496299","9783662496305"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49630-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}