{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:58:53Z","timestamp":1743069533474,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030518301"},{"type":"electronic","value":"9783030518318"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-51831-8_17","type":"book-chapter","created":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T23:05:05Z","timestamp":1593471905000},"page":"345-366","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Dynamic Recursive Petri Nets"],"prefix":"10.1007","author":[{"given":"Serge","family":"Haddad","sequence":"first","affiliation":[]},{"given":"Igor","family":"Khmelnitsky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,30]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Blondin, M., Finkel, A., Haase, C., Haddad, S.: The logical view on continuous Petri nets. ACM Trans. Comput. Log. 18(3), 24:1\u201324:28 (2017)","DOI":"10.1145\/3105908"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BFb0055044","volume-title":"Automata, Languages and Programming","author":"C Dufourd","year":"1998","unstructured":"Dufourd, C., Finkel, A., Schnoebelen, P.: Reset nets between decidability and undecidability. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 103\u2013115. Springer, Heidelberg (1998). \nhttps:\/\/doi.org\/10.1007\/BFb0055044"},{"key":"17_CR3","unstructured":"Seghrouchni, A.E.F., Haddad, S.: A recursive model for distributed planning. In: ICMAS 1996, Kyoto, Japan, pp. 307\u2013314 (1996)"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-3-030-21571-2_23","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"A Finkel","year":"2019","unstructured":"Finkel, A., Haddad, S., Khmelnitsky, I.: Coverability and termination in recursive petri nets. In: Donatelli, S., Haar, S. (eds.) PETRI NETS 2019. LNCS, vol. 11522, pp. 429\u2013448. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-21571-2_23"},{"key":"17_CR5","unstructured":"Finkel, A., Haddad, S., Khmelnitsky, I.: Coverability and termination in recursive Petri nets (2019). \nhttps:\/\/hal.inria.fr\/hal-02081019"},{"key":"17_CR6","unstructured":"Finkel, A., McKenzie, P., Picaronny, C.: A well-structured framework for analysing Petri net extensions. Inf. Comput. 195, 1\u201329 (2004)"},{"issue":"1\u20132","key":"17_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":"17_CR8","unstructured":"Haddad, S., Khmelnitsky, I.: Dynamic recursive Petri nets (2020). \nhttps:\/\/hal.archives-ouvertes.fr\/hal-02511321v1"},{"key":"17_CR9","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). \nhttps:\/\/doi.org\/10.1007\/3-540-48745-X_14"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Haddad, S., Poitrenaud, D.: Modelling and analyzing systems with recursive petri nets. In: WODES 2000, Ghent, Belgium, pp. 449\u2013458. Kluwer Academic Publishers (2000)","DOI":"10.1007\/978-1-4615-4493-7_48"},{"issue":"7\u20138","key":"17_CR11","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 Informatica 44(7\u20138), 463\u2013508 (2007)","journal-title":"Acta Informatica"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-319-11439-2_15","volume-title":"Reachability Problems","author":"J Leroux","year":"2014","unstructured":"Leroux, J., Schnoebelen, P.: On functions weakly computable by petri nets and vector addition systems. In: Ouaknine, J., Potapov, I., Worrell, J. (eds.) RP 2014. LNCS, vol. 8762, pp. 190\u2013202. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-11439-2_15"},{"issue":"3\u20134","key":"17_CR13","first-page":"283","volume":"47","author":"IA Lomazova","year":"2001","unstructured":"Lomazova, I.A.: Nested petri nets: multi-level and recursive systems. Fundam. Inform. 47(3\u20134), 283\u2013293 (2001)","journal-title":"Fundam. Inform."},{"issue":"1\u20132","key":"17_CR14","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1006\/inco.1999.2826","volume":"156","author":"R Mayr","year":"2000","unstructured":"Mayr, R.: Process rewrite systems. Inf. Comput. 156(1\u20132), 264\u2013286 (2000)","journal-title":"Inf. Comput."},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/3-540-08860-1_35","volume-title":"Automata, Languages and Programming","author":"R Valk","year":"1978","unstructured":"Valk, R.: Self-modifying nets, a natural extension of Petri nets. In: Ausiello, G., B\u00f6hm, C. (eds.) ICALP 1978. LNCS, vol. 62, pp. 464\u2013476. Springer, Heidelberg (1978). \nhttps:\/\/doi.org\/10.1007\/3-540-08860-1_35"}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets and Concurrency"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-51831-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,30]],"date-time":"2020-06-30T01:23:24Z","timestamp":1593480204000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-51831-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030518301","9783030518318"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51831-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"30 June 2020","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":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"41","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apn2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/conf-2020.petrinet.net\/","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":"56","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":"0","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":"41% - 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":"1.89","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}