{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:31:24Z","timestamp":1767929484204,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662496732","type":"print"},{"value":"9783662496749","type":"electronic"}],"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-49674-9_28","type":"book-chapter","created":{"date-parts":[[2016,4,8]],"date-time":"2016-04-08T18:49:00Z","timestamp":1460141340000},"page":"480-496","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Approaching the Coverability Problem Continuously"],"prefix":"10.1007","author":[{"given":"Michael","family":"Blondin","sequence":"first","affiliation":[]},{"given":"Alain","family":"Finkel","sequence":"additional","affiliation":[]},{"given":"Christoph","family":"Haase","sequence":"additional","affiliation":[]},{"given":"Serge","family":"Haddad","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,9]]},"reference":[{"issue":"1\u20132","key":"28_CR1","first-page":"109","volume":"160","author":"K Cerans","year":"2000","unstructured":"Cerans, K., Jonsson, B., Tsay, Y.-K.: Algorithmic analysis of programs with well quasi-ordered domains. Inf. Comput. 160(1\u20132), 109\u2013127 (2000)","journal-title":"Inf. Comput."},{"key":"28_CR2","unstructured":"Blondin, M., Finkel, A., Haase, C., Haddad, S.: Approaching the coverability problem continuously (2015). CoRR, \n                      abs\/1510.05724"},{"key":"28_CR3","series-title":"Lecture notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-642-24288-5_10","volume-title":"Reachability Problems","author":"L Bozzelli","year":"2011","unstructured":"Bozzelli, L., Ganty, P.: Complexity analysis of the backward coverability algorithm for VASS. In: Delzanno, G., Potapov, I. (eds.) RP 2011. LNCS, vol. 6945, pp. 96\u2013109. Springer, Heidelberg (2011)"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Cardoza, E., Lipton, R.J., Meyer, A.R.: Exponential space complete problems for Petri nets, commutative semigroups: preliminary report. In: Symposium on Theory of Computing, STOC, pp. 50\u201354 (1976)","DOI":"10.1145\/800113.803630"},{"key":"28_CR5","unstructured":"David, R., Alla, H.: Continuous Petri nets. In: Proceedings of the 8th European Workshop on Application and Theory of Petri nets, pp. 275\u2013294 (1987)"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L Moura de","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.S.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008)"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/3-540-44585-4_28","volume-title":"Computer Aided Verification","author":"G Delzanno","year":"2001","unstructured":"Delzanno, G., Raskin, J.-F., Van Begin, L.: Attacking symbolic state explosion. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, p. 298. Springer, Heidelberg (2001)"},{"issue":"2\u20133","key":"28_CR8","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/s10009-003-0110-0","volume":"5","author":"G Delzanno","year":"2004","unstructured":"Delzanno, G., Raskin, J.-F., Van Begin, L.: Covering sharing trees: a compact data structure for parameterized verification. STTT 5(2\u20133), 268\u2013297 (2004)","journal-title":"STTT"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-642-38856-9_24","volume-title":"Static Analysis","author":"E D\u2019Osualdo","year":"2013","unstructured":"D\u2019Osualdo, E., Kochems, J., Ong, C.-H.L.: Automatic verification of erlang-style concurrency. In: Logozzo, F., F\u00e4hndrich, M. (eds.) Static Analysis. LNCS, vol. 7935, pp. 454\u2013476. Springer, Heidelberg (2013)"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1007\/978-3-319-08867-9_40","volume-title":"Computer Aided Verification","author":"J Esparza","year":"2014","unstructured":"Esparza, J., Ledesma-Garza, R., Majumdar, R., Meyer, P., Niksic, F.: An SMT-based approach to coverability analysis. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 603\u2013619. Springer, Heidelberg (2014)"},{"issue":"2","key":"28_CR11","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1023\/A:1008743212620","volume":"16","author":"J Esparza","year":"2000","unstructured":"Esparza, J., Melzer, S.: Verification of safety properties using integer programming: beyond the state equation. Formal Meth. Syst. Des. 16(2), 159\u2013189 (2000)","journal-title":"Formal Meth. Syst. Des."},{"issue":"6","key":"28_CR12","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S1571-0661(04)80535-8","volume":"68","author":"A Finkel","year":"2002","unstructured":"Finkel, A., Raskin, J.-F., Samuelides, M., Van Begin, L.: Monotonic extensions of Petri nets: forward and backward search revisited. Electr. Notes Theor. Comput. Sci. 68(6), 85\u2013106 (2002)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"1\u20132","key":"28_CR13","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."},{"issue":"1","key":"28_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2015-1168","volume":"137","author":"E Fraca","year":"2015","unstructured":"Fraca, E., Haddad, S.: Complexity analysis of continuous Petri nets. Fundam. Informaticae 137(1), 1\u201328 (2015)","journal-title":"Fundam. Informaticae"},{"key":"28_CR15","unstructured":"Ganty, P.: Algorithmes et structures de donn\u00e9es efficaces pour la manipulation de contraintes sur les intervalles (in French). Master\u2019s thesis, Universit\u00e9 Libre de Bruxelles, Belgium (2002)"},{"key":"28_CR16","unstructured":"Ganty, P., Meuter, C., Delzanno, G., Kalyon, G., Raskin, J.-F., Van Begin, L.: Symbolic data structure for sets of \n                      \n                        \n                      \n                      $$k$$\n                    -uples. Technical report 570, Universit\u00e9 Libre de Bruxelles, Belgium (2007)"},{"issue":"1","key":"28_CR17","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.jcss.2005.09.001","volume":"72","author":"G Geeraerts","year":"2006","unstructured":"Geeraerts, G., Raskin, J.-F., Van Begin, L.: Expand, enlarge and check: new algorithms for the coverability problem of WSTS. J. Comput. Syst. Sci. 72(1), 180\u2013203 (2006)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"28_CR18","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1142\/S0129054110007180","volume":"21","author":"G Geeraerts","year":"2010","unstructured":"Geeraerts, G., Raskin, J.-F., Van Begin, L.: On the efficient computation of the minimal coverability set of petri nets. Int. J. Found. Comput. Sci. 21(2), 135\u2013165 (2010)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"3","key":"28_CR19","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1145\/146637.146681","volume":"39","author":"SM German","year":"1992","unstructured":"German, S.M., Prasad Sistla, A.: Reasoning about systems with many processes. J. ACM 39(3), 675\u2013735 (1992)","journal-title":"J. ACM"},{"issue":"4","key":"28_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2629608","volume":"36","author":"A Kaiser","year":"2014","unstructured":"Kaiser, A., Kroening, D., Wahl, T.: A widening approach to multithreaded program verification. ACM Trans. Program. Lang. Syst. 36(4), 1\u201329 (2014)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"28_CR21","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Miller, R.E.: Parallel program schemata: a mathematical model for parallel computation. In Switching and Automata Theory, pp. 55\u201361. IEEE Computer Society (1967)","DOI":"10.1109\/FOCS.1967.27"},{"key":"28_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-39799-8_10","volume-title":"Computer Aided Verification","author":"J Kloos","year":"2013","unstructured":"Kloos, J., Majumdar, R., Niksic, F., Piskac, R.: Incremental, inductive coverability. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 158\u2013173. Springer, Heidelberg (2013)"},{"key":"28_CR23","doi-asserted-by":"crossref","unstructured":"Leroux, J., Schmitz, S.: Demystifying reachability in vector addition systems. In: Logic in Computer Science, LICS, pp. 56\u201367. IEEE (2015)","DOI":"10.1109\/LICS.2015.16"},{"key":"28_CR24","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, 223\u2013231 (1978)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"28_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2013-781","volume":"122","author":"P-A Reynier","year":"2013","unstructured":"Reynier, P.-A., Servais, F.: Minimal coverability set for petri nets: karp and miller algorithm with pruning. Fundam. Inform. 122(1\u20132), 1\u201330 (2013)","journal-title":"Fundam. Inform."},{"issue":"3","key":"28_CR26","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0020-0190(85)90076-6","volume":"20","author":"ED Sontag","year":"1985","unstructured":"Sontag, E.D.: Real addition and the polynomial hierarchy. Inf. Process. Lett. 20(3), 115\u2013120 (1985)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"28_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2014-1002","volume":"131","author":"A Valmari","year":"2014","unstructured":"Valmari, A., Hansen, H.: Old and new algorithms for minimal coverability sets. Fundam. Inform. 131(1), 1\u201325 (2014)","journal-title":"Fundam. Inform."},{"key":"28_CR28","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/11532231_25","volume-title":"Automated Deduction \u2013 CADE-20","author":"KN Verma","year":"2005","unstructured":"Verma, K.N., Seidl, H., Schwentick, T.: On the complexity of equational horn clauses. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 337\u2013352. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49674-9_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T01:15:04Z","timestamp":1585012504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49674-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662496732","9783662496749"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49674-9_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"9 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}