{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T09:26:00Z","timestamp":1750843560799,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030769826"},{"type":"electronic","value":"9783030769833"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-76983-3_17","type":"book-chapter","created":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T23:06:10Z","timestamp":1623798370000},"page":"339-359","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Efficient Algorithms for Three Reachability Problems in Safe Petri Nets"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Bouvier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hubert","family":"Garavel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,16]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-030-17502-3_4","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E Amparore","year":"2019","unstructured":"Amparore, E., et al.: Presentation of the 9th edition of the Model Checking Contest. In: Beyer, D., Huisman, M., Kordon, F., Steffen, B. (eds.) TACAS 2019. LNCS, vol. 11429, pp. 50\u201368. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17502-3_4"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-51831-8_1","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"P Bouvier","year":"2020","unstructured":"Bouvier, P., Garavel, H., Ponce-de-Le\u00f3n, H.: Automatic decomposition of Petri nets into automata networks \u2013 a synthetic account. In: Janicki, R., Sidorova, N., Chatain, T. (eds.) PETRI NETS 2020. LNCS, vol. 12152, pp. 3\u201323. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51831-8_1"},{"issue":"1\u20132","key":"17_CR3","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(94)00231-7","volume":"147","author":"A Cheng","year":"1995","unstructured":"Cheng, A., Esparza, J., Palsberg, J.: Complexity Results for 1-Safe Nets. Theoret. Comput. Sci. 147(1\u20132), 117\u2013136 (1995)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Desel, J., Esparza, J.: Free Choice Petri Nets, Cambridge Tracts in Theoretical Computer Science, vol. 40. Cambridge University Press, Cambridge (1995)","DOI":"10.1017\/CBO9780511526558"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.jlamp.2018.11.005","volume":"104","author":"H Garavel","year":"2019","unstructured":"Garavel, H.: Nested-unit Petri nets. J. Logical Algebraic Methods Program. 104, 60\u201385 (2019)","journal-title":"J. Logical Algebraic Methods Program."},{"key":"17_CR6","unstructured":"Garavel, H.: Proposal for Adding Useful Features to Petri-Net Model Checkers, December 2020. https:\/\/arxiv.org\/abs\/2101.05024"},{"issue":"2","key":"17_CR7","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.tcs.2005.09.064","volume":"351","author":"H Garavel","year":"2006","unstructured":"Garavel, H., Serwe, W.: State space reduction for process algebra specifications. Theoret. Comput. Sci. 351(2), 131\u2013145 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR8","unstructured":"ISO\/IEC: High-level Petri Nets - Part 2: Transfer Format. International Standard 15909\u20132:2011, International Organization for Standardization, Geneva (2011)"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0304-3975(84)90014-8","volume":"29","author":"R Janicki","year":"1984","unstructured":"Janicki, R.: Nets, sequential components and concurrency relations. Theoret. Comput. Sci. 29, 87\u2013121 (1984)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-55676-1_17","volume-title":"Application and Theory of Petri Nets 1992","author":"A Kovalyov","year":"1992","unstructured":"Kovalyov, A.: Concurrency relations and the safety problem for Petri nets. In: Jensen, K. (ed.) ICATPN 1992. LNCS, vol. 616, pp. 299\u2013309. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55676-1_17"},{"key":"17_CR11","doi-asserted-by":"publisher","unstructured":"Kovalyov, A.: A polynomial algorithm to compute the concurrency relation of a regular STG. In: Yakovlev, A., Gomes, L., Lavagno, L. (eds.) Hardware Design and Petri Nets, chap. 6, pp. 107\u2013126. Springer, Boston, MA, USA, January 2000. https:\/\/doi.org\/10.1007\/978-1-4757-3143-9_6","DOI":"10.1007\/978-1-4757-3143-9_6"},{"key":"17_CR12","unstructured":"Kovalyov, A., Esparza, J.: A polynomial algorithm to compute the concurrency relation of free-choice signal transition graphs. In: Proceedings of the 3rd Workshop on Discrete Event Systems (WODES 1996), Edinburgh, Scotland, UK, pp. 1\u20136 (1996)"},{"issue":"4","key":"17_CR13","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T Murata","year":"1989","unstructured":"Murata, T.: Petri nets: analysis and applications. Proc. IEEE 77(4), 541\u2013580 (1989)","journal-title":"Proc. IEEE"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/3-540-48745-X_4","volume-title":"Application and Theory of Petri Nets 1999","author":"K Schmidt","year":"1999","unstructured":"Schmidt, K.: Stubborn sets for standard properties. In: Donatelli, S., Kleijn, J. (eds.) ICATPN 1999. LNCS, vol. 1639, pp. 46\u201365. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48745-X_4"},{"key":"17_CR15","unstructured":"Semenov, A., Yakovlev, A.: Combining partial orders and symbolic traversal for efficient verification of asynchronous circuits. In: Ohtsuki, T., Johnson, S. (eds.) Proceedings of the 12th International Conference on Computer Hardware Description Languages and their Applications (CHDL 1995), Makuhari, Chiba, Japan. IEEE (1995)"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Wi\u015bniewski, R., Karatkevich, A., Adamski, M., Kur, D.: Application of comparability graphs in decomposition of Petri nets. In: Proceedings of the 7th International Conference on Human System Interactions (HSI 2014), Costa da Caparica, Portugal. IEEE (2014)","DOI":"10.1109\/HSI.2014.6860478"}],"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-76983-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T23:08:33Z","timestamp":1623798513000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-76983-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030769826","9783030769833"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-76983-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"16 June 2021","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apn2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lipn.univ-paris13.fr\/petrinets2021\/","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":"39","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":"22","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":"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":"3","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":"2 keynote papers are also included.","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)"}}]}}