{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T03:07:39Z","timestamp":1780628859111,"version":"3.54.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030308056","type":"print"},{"value":"9783030308063","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-30806-3_13","type":"book-chapter","created":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T09:08:36Z","timestamp":1567760916000},"page":"164-177","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On the Computation of the Minimal Coverability Set of Petri Nets"],"prefix":"10.1007","author":[{"given":"Pierre-Alain","family":"Reynier","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Servais","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,9,6]]},"reference":[{"key":"13_CR1","unstructured":"Blondin, M., Finkel, A., Goubault-Larrecq, J.: Forward analysis for wsts, part III: Karp-Miller trees. In: 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017, vol. 93 of LIPIcs, pp. 16:1\u201316:15. Leibniz-Zentrum fuer Informatik (2017)"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-662-49674-9_28","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M Blondin","year":"2016","unstructured":"Blondin, M., Finkel, A., Haase, C., Haddad, S.: Approaching the coverability problem continuously. In: Chechik, M., Raskin, J.-F. (eds.) TACAS 2016. LNCS, vol. 9636, pp. 480\u2013496. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49674-9_28"},{"key":"13_CR3","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: Proceedings of the 8th Annual ACM Symposium on Theory of Computing, Hershey, Pennsylvania, USA, 3\u20135 May 1976, pp. 50\u201354. ACM (1976)","DOI":"10.1145\/800113.803630"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/3-540-18088-5_43","volume-title":"Automata, Languages and Programming","author":"A Finkel","year":"1987","unstructured":"Finkel, A.: A generalization of the procedure of Karp and Miller to well structured transition systems. In: Ottmann, T. (ed.) ICALP 1987. LNCS, vol. 267, pp. 499\u2013508. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-18088-5_43"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/3-540-56689-9_45","volume-title":"Advances in Petri Nets 1993","author":"A Finkel","year":"1993","unstructured":"Finkel, A.: The minimal coverability graph for Petri nets. In: Rozenberg, G. (ed.) ICATPN 1991. LNCS, vol. 674, pp. 210\u2013243. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-56689-9_45"},{"key":"13_CR6","unstructured":"Finkel, A., Goubault-Larrecq, J.: Forward analysis for WSTS, part I: completions. In: Proceedings of STACS 2009, vol. 3 of LIPIcs, pp. 433\u2013444. Leibniz-Zentrum f\u00fcr Informatik (2009)"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Finkel, A., Goubault-Larrecq, J.: Forward analysis for WSTS, part II: complete WSTS. Log. Methods Comput. Sci. 8(3) (2012)","DOI":"10.2168\/LMCS-8(3:28)2012"},{"issue":"1","key":"13_CR8","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., Begin, L.V.: 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":"13_CR9","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 coverability set for petri nets. Int. J. Found. Comput. Sci. 21(2), 135\u2013165 (2010)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"13_CR10","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":"13_CR11","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). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_10"},{"issue":"3","key":"13_CR12","doi-asserted-by":"publisher","first-page":"283","DOI":"10.14778\/3157794.3157798","volume":"11","author":"Y Li","year":"2017","unstructured":"Li, Y., Deutsch, A., Vianu, V.: VERIFAS: a practical verifier for artifact systems. Proc. VLDB Endow. 11(3), 283\u2013296 (2017)","journal-title":"Proc. VLDB Endow."},{"key":"13_CR13","unstructured":"L\u00fcttge, K.: Zustandsgraphen von Petri-Netzen. Master\u2019s thesis, Humboldt-Universit\u00e4t (1995)"},{"key":"13_CR14","unstructured":"Petri, C.A.: Kommunikation mit Automaten. Ph.D. thesis, Institut f\u00fcr Instrumentelle Mathematik, Bonn, Germany (1962)"},{"issue":"3\u20134","key":"13_CR15","doi-asserted-by":"publisher","first-page":"393","DOI":"10.3233\/FI-2016-1319","volume":"143","author":"A Piipponen","year":"2016","unstructured":"Piipponen, A., Valmari, A.: Constructing minimal coverability sets. Fundam. Inf. 143(3\u20134), 393\u2013414 (2016)","journal-title":"Fundam. Inf."},{"key":"13_CR16","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":"13_CR17","first-page":"1","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. Inf. 122(1\u20132), 1\u201330 (2013)","journal-title":"Fundam. Inf."},{"issue":"3","key":"13_CR18","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1023\/A:1008753219837","volume":"15","author":"K Schmidt","year":"1999","unstructured":"Schmidt, K.: Model-checking with coverability graphs. Form. Methods Syst. Des. 15(3), 239\u2013254 (1999)","journal-title":"Form. Methods Syst. Des."}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30806-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T15:00:41Z","timestamp":1664290841000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30806-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030308056","9783030308063"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30806-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reachability Problems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brussels","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rp2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.uclouvain.be\/rp2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}