{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:02:49Z","timestamp":1743123769323,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030215705"},{"type":"electronic","value":"9783030215712"}],"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-21571-2_23","type":"book-chapter","created":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T23:04:17Z","timestamp":1560207857000},"page":"429-448","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Coverability and Termination in Recursive Petri Nets"],"prefix":"10.1007","author":[{"given":"Alain","family":"Finkel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Serge","family":"Haddad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Khmelnitsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,31]]},"reference":[{"key":"23_CR1","unstructured":"Atig, M.F., Ganty, P.: Approximating Petri net reachability along context-free traces. In: FSTTCS 2011, Mumbai, India, LIPIcs, vol. 13, pp. 152\u2013163 (2011)"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-642-22993-0_16","volume-title":"Mathematical Foundations of Computer Science 2011","author":"R Bonnet","year":"2011","unstructured":"Bonnet, R.: The reachability problem for vector addition system with one zero-test. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol. 6907, pp. 145\u2013157. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22993-0_16"},{"issue":"11","key":"23_CR3","first-page":"1","volume":"8","author":"R Bonnet","year":"2012","unstructured":"Bonnet, R., Finkel, A., Leroux, J., Zeitoun, M.: Model checking vector addition systems with one zero-test. Logical Methods Comput. Sci. 8(11), 1\u201325 (2012)","journal-title":"Logical Methods Comput. Sci."},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Czerwinski, W., Lasota, S., Lazic, R., Leroux, J., Mazowiecki, F.: The reachability problem for Petri nets is not elementary (extended abstract). CoRR, abs\/1809.07115 (2018)","DOI":"10.1145\/3313276.3316369"},{"issue":"14","key":"23_CR5","first-page":"2808","volume":"15","author":"J Dassow","year":"2009","unstructured":"Dassow, J., Turaev, S.: Petri net controlled grammars: the case of special Petri nets. J. UCS 15(14), 2808\u20132835 (2009)","journal-title":"J. UCS"},{"issue":"1","key":"23_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.jcss.2012.04.002","volume":"79","author":"S Demri","year":"2012","unstructured":"Demri, S., Jurdzi\u0144ski, M., Lachish, O., Lazi\u0107, R.: The covering and boundedness problems for branching vector addition systems. J. Comput. Syst. Sci. 79(1), 23\u201338 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"23_CR7","unstructured":"Fallah Seghrouchni, A.E., Haddad, S.: A recursive model for distributed planning. In: ICMAS 1996, Kyoto, Japan, pp. 307\u2013314 (1996)"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Finkel, A., Haddad, S., Khmelnitsky, I.: Coverability and termination in recursive Petri nets, April 2019. https:\/\/hal.inria.fr\/hal-02081019","DOI":"10.1007\/978-3-030-21571-2_23"},{"issue":"1\u20132","key":"23_CR9","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":"23_CR10","unstructured":"Haddad, S., Poitrenaud, D.: Decidability and undecidability results for recursive Petri nets. Technical Report 019, LIP6, Paris VI University (1999)"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/3-540-48745-X_14","volume-title":"Application and Theory of Petri Nets 1999","author":"S Haddad","year":"1999","unstructured":"Haddad, S., Poitrenaud, D.: Theoretical aspects of recursive Petri nets. In: Donatelli, S., Kleijn, J. (eds.) ICATPN 1999. LNCS, vol. 1639, pp. 228\u2013247. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48745-X_14"},{"key":"23_CR12","series-title":"The International Series in Engineering and Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-1-4615-4493-7_48","volume-title":"Discrete Event Systems","author":"S Haddad","year":"2000","unstructured":"Haddad, S., Poitrenaud, D.: Modelling and analyzing systems with recursive Petri nets. In: Boel, R., Stremersch, G. (eds.) Discrete Event Systems. The International Series in Engineering and Computer Science, vol. 569, pp. 449\u2013458. Springer, Boston (2000). https:\/\/doi.org\/10.1007\/978-1-4615-4493-7_48"},{"key":"23_CR13","unstructured":"Haddad, S., Poitrenaud, D.: Checking linear temporal formulas on sequential recursive Petri nets. In: TIME 2001, Civdale del Friuli, Italy, pp. 198\u2013205. IEEE Computer Society (2001)"},{"issue":"7\u20138","key":"23_CR14","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/s00236-007-0055-y","volume":"44","author":"S Haddad","year":"2007","unstructured":"Haddad, S., Poitrenaud, D.: Recursive Petri nets. Acta Inf. 44(7\u20138), 463\u2013508 (2007)","journal-title":"Acta Inf."},{"issue":"1","key":"23_CR15","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0304-3975(92)90173-D","volume":"99","author":"J-L 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."},{"key":"23_CR16","unstructured":"Lazic, R.: The reachability problem for vector addition systems with a stack is not elementary. CoRR, abs\/1310.1767 (2013)"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Lazic,R., Schmitz, S.: Non-elementary complexities for branching vass, mell, and extensions. In: CSL-LICS 2014, Vienna, Austria, pp. 61:1\u201361:10. ACM (2014)","DOI":"10.1145\/2603088.2603129"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Lazi\u0107, R., Schmitz,S.: The complexity of coverability in $$\\nu $$-Petri nets. In: LICS 2016, pp. 467\u2013476. ACM Press, New York (2016)","DOI":"10.1145\/2933575.2933593"},{"key":"23_CR19","unstructured":"Lipton, R.J.: The reachability problem requires exponential space. Technical Report 062, Yale University, Department of Computer Science, January 1976"},{"issue":"4","key":"23_CR20","first-page":"748","volume":"54","author":"G Mavlankulov","year":"2018","unstructured":"Mavlankulov, G., Othman, M., Turaev, S., Selamat, M.H., Zhumabayeva, L., Zhukabayeva, T.: Concurrently controlled grammars. Kybernetika 54(4), 748\u2013764 (2018)","journal-title":"Kybernetika"},{"issue":"3","key":"23_CR21","doi-asserted-by":"publisher","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)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"23_CR22","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":"23_CR23","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.entcs.2008.12.042","volume":"223","author":"K Reinhardt","year":"2008","unstructured":"Reinhardt, K.: Reachability in Petri nets with inhibitor arcs. Electr. Notes Theor. Comput. Sci. 223, 239\u2013264 (2008)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"23_CR24","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). https:\/\/doi.org\/10.1007\/978-3-642-15155-2_54"},{"key":"23_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-319-24537-9_15","volume-title":"Reachability Problems","author":"G Zetzsche","year":"2015","unstructured":"Zetzsche, G.: The emptiness problem for valence automata or: another decidable extension of Petri nets. In: Boja\u0144czyk, M., Lasota, S., Potapov, I. (eds.) RP 2015. LNCS, vol. 9328, pp. 166\u2013178. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24537-9_15"}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets and Concurrency"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21571-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:01:32Z","timestamp":1710248492000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-21571-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030215705","9783030215712"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21571-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"31 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PETRI NETS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applications and Theory of Petri Nets and Concurrency","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aachen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"23 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"40","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apn2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.petrinets2019.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"56% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}