{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:17:45Z","timestamp":1743106665341,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030846282"},{"type":"electronic","value":"9783030846299"}],"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-84629-9_3","type":"book-chapter","created":{"date-parts":[[2021,8,2]],"date-time":"2021-08-02T11:06:30Z","timestamp":1627902390000},"page":"45-62","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Accelerating the Computation of Dead and Concurrent Places Using Reductions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5969-7346","authenticated-orcid":false,"given":"Nicolas","family":"Amat","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6002-2696","authenticated-orcid":false,"given":"Silvano","family":"Dal Zilio","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6457-2740","authenticated-orcid":false,"given":"Didier","family":"Le Botlan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,3]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-030-76983-3_9","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"N Amat","year":"2021","unstructured":"Amat, N., Berthomieu, B., Dal Zilio, S.: On the combination of polyhedral abstraction and SMT-based model checking for Petri Nets. In: Buchs, D., Carmona, J. (eds.) PETRI NETS 2021. LNCS, vol. 12734, pp. 164\u2013185. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-76983-3_9"},{"key":"3_CR2","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":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-540-47919-2_13","volume-title":"Petri Nets: Central Models and Their Properties","author":"G Berthelot","year":"1987","unstructured":"Berthelot, G.: Transformations and decompositions of nets. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) ACPN 1986. LNCS, vol. 254, pp. 359\u2013376. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/978-3-540-47919-2_13"},{"key":"3_CR4","doi-asserted-by":"publisher","unstructured":"Berthomieu, B., Ribet, P.O., Vernadat, F.: The tool TINA - Construction of abstract state spaces for petri nets and time petri nets. Int. J. Prod. Res. 42(14), 2741\u20132756 (2004). https:\/\/doi.org\/10.1080\/00207540412331312688; https:\/\/doi.org\/10.1080\/00207540412331312688","DOI":"10.1080\/00207540412331312688"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-319-94111-0_4","volume-title":"Model Checking Software","author":"B Berthomieu","year":"2018","unstructured":"Berthomieu, B., Le Botlan, D., Dal Zilio, S.: Petri net reductions for counting markings. In: Gallardo, M.M., Merino, P. (eds.) SPIN 2018. LNCS, vol. 10869, pp. 65\u201384. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94111-0_4"},{"issue":"2","key":"3_CR6","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10009-019-00519-1","volume":"22","author":"B Berthomieu","year":"2019","unstructured":"Berthomieu, B., Le Botlan, D., Dal Zilio, S.: Counting Petri net markings from reduction equations. Int. J. Softw. Tools Technol. Transf. 22(2), 163\u2013181 (2019). https:\/\/doi.org\/10.1007\/s10009-019-00519-1","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.jlamp.2018.09.002","volume":"102","author":"FM B\u00f8nneland","year":"2019","unstructured":"B\u00f8nneland, F.M., Dyhr, J., Jensen, P.G., Johannsen, M., Srba, J.: Stubborn versus structural reductions for Petri nets. J. Logical Algebraic Methods Program. 102, 46\u201363 (2019). https:\/\/doi.org\/10.1016\/j.jlamp.2018.09.002","journal-title":"J. Logical Algebraic Methods Program."},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-030-76983-3_17","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"P Bouvier","year":"2021","unstructured":"Bouvier, P., Garavel, H.: Efficient algorithms for three reachability problems in Safe Petri nets. In: Buchs, D., Carmona, J. (eds.) PETRI NETS 2021. LNCS, vol. 12734, pp. 339\u2013359. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-76983-3_17"},{"key":"3_CR9","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"},{"key":"3_CR10","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). https:\/\/doi.org\/10.1016\/j.jlamp.2018.11.005","journal-title":"J. Logical Algebraic Methods Program."},{"key":"3_CR11","unstructured":"Garavel, H.: Proposal for adding useful features to Petri-net model checkers. Research Report 03087421, Inria Grenoble - Rh\u00f4ne-Alpes (2020). https:\/\/hal.inria.fr\/hal-03087421"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-540-27815-3_16","volume-title":"Algebraic Methodology and Software Technology","author":"H Garavel","year":"2004","unstructured":"Garavel, H., Serwe, W.: State space reduction for process algebra specifications. In: Rattray, C., Maharaj, S., Shankland, C. (eds.) AMAST 2004. LNCS, vol. 3116, pp. 164\u2013180. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27815-3_16"},{"key":"3_CR13","doi-asserted-by":"publisher","unstructured":"Giua, A., DiCesare, F., Silva, M.: Generalized mutual exclusion contraints on nets with uncontrollable transitions. In: IEEE International Conference on Systems, Man, and Cybernetics. IEEE (1992). https:\/\/doi.org\/10.1109\/ICSMC.1992.271666","DOI":"10.1109\/ICSMC.1992.271666"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-319-57861-3_9","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"LM Hillah","year":"2017","unstructured":"Hillah, L.M., Kordon, F.: Petri nets repository: a tool to benchmark and debug Petri net tools. In: van der Aalst, W., Best, E. (eds.) PETRI NETS 2017. LNCS, vol. 10258, pp. 125\u2013135. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57861-3_9"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-642-13675-7_20","volume-title":"Applications and Theory of Petri Nets","author":"LM Hillah","year":"2010","unstructured":"Hillah, L.M., Kordon, F., Petrucci, L., Tr\u00e8ves, N.: PNML framework: an extendable reference implementation of the Petri net markup language. In: Lilius, J., Penczek, W. (eds.) PETRI NETS 2010. LNCS, vol. 6128, pp. 318\u2013327. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13675-7_20"},{"key":"3_CR16","unstructured":"Hujsa, T., Berthomieu, B., Dal Zilio, S., Le Botlan, D.: Checking marking reachability with the state equation in Petri net subclasses, 44 p (2020). https:\/\/hal.laas.fr\/hal-02992521"},{"key":"3_CR17","unstructured":"INRIA: CADP (2020). https:\/\/cadp.inria.fr\/"},{"key":"3_CR18","doi-asserted-by":"publisher","unstructured":"Janicki, R.: Nets, sequential components and concurrency relations. Theor. Comput. Sci. 29(1\u20132) (1984). https:\/\/doi.org\/10.1016\/0304-3975(84)90014-8","DOI":"10.1016\/0304-3975(84)90014-8"},{"key":"3_CR19","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":"AV Kovalyov","year":"1992","unstructured":"Kovalyov, A.V.: 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":"3_CR20","doi-asserted-by":"publisher","unstructured":"Kovalyov, A.: A polynomial algorithm to compute the concurrency relation of a regular STG. In: Hardware Design and Petri Nets. Springer, Boston (2000). https:\/\/doi.org\/10.1007\/978-1-4757-3143-9_6","DOI":"10.1007\/978-1-4757-3143-9_6"},{"key":"3_CR21","unstructured":"LAAS-CNRS: Tina Toolbox (2020). http:\/\/projects.laas.fr\/tina"},{"key":"3_CR22","doi-asserted-by":"publisher","unstructured":"Lipton, R.J.: Reduction: a method of proving properties of parallel programs. Commun. ACM 18(12) (1975). https:\/\/doi.org\/10.1145\/361227.361234","DOI":"10.1145\/361227.361234"},{"issue":"4","key":"3_CR23","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T Murata","year":"1989","unstructured":"Murata, T.: Petri nets: properties, analysis and applications. Proc. IEEE 77(4), 541\u2013580 (1989). https:\/\/doi.org\/10.1109\/5.24143","journal-title":"Proc. IEEE"},{"key":"3_CR24","doi-asserted-by":"publisher","unstructured":"Semenov, A., Yakovlev, A.: Combining partial orders and symbolic traversal for efficient verification of asynchronous circuits. In: Proceedings of ASP-DAC\u201995\/CHDL\u201995\/VLSI\u201995 with EDA Technofair (1995). https:\/\/doi.org\/10.1109\/ASPDAC.1995.486371","DOI":"10.1109\/ASPDAC.1995.486371"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/3-540-65306-6_19","volume-title":"Lectures on Petri Nets I: Basic Models","author":"M Silva","year":"1998","unstructured":"Silva, M., Terue, E., Colom, J.M.: Linear algebraic and linear programming techniques for the analysis of place\/transition net systems. In: Reisig, W., Rozenberg, G. (eds.) ACPN 1996. LNCS, vol. 1491, pp. 309\u2013373. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-65306-6_19"},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-030-51831-8_15","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"Y Thierry-Mieg","year":"2020","unstructured":"Thierry-Mieg, Y.: Structural reductions revisited. In: Janicki, R., Sidorova, N., Chatain, T. (eds.) PETRI NETS 2020. LNCS, vol. 12152, pp. 303\u2013323. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51831-8_15"},{"key":"3_CR27","doi-asserted-by":"publisher","unstructured":"Wisniewski, R., Karatkevich, A., Adamski, M., Costa, A., Gomes, L.: Prototyping of concurrent control systems with application of Petri Nets and comparability graphs. IEEE Trans. Control Syst. Technol. 26(2) (2018). https:\/\/doi.org\/10.1109\/TCST.2017.2692204","DOI":"10.1109\/TCST.2017.2692204"},{"key":"3_CR28","doi-asserted-by":"publisher","unstructured":"Wi\u015bniewski, R., Wi\u015bniewska, M., Jarnut, M.: C-exact hypergraphs in concurrency and sequentiality analyses of cyber-physical systems specified by safe Petri nets. IEEE Access 7 (2019). https:\/\/doi.org\/10.1109\/ACCESS.2019.2893284","DOI":"10.1109\/ACCESS.2019.2893284"}],"container-title":["Lecture Notes in Computer Science","Model Checking Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-84629-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,18]],"date-time":"2021-08-18T23:05:16Z","timestamp":1629327916000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-84629-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030846282","9783030846299"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-84629-9_3","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":"3 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Model Checking Software","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":"12 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spin2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/ecoop-issta-2021\/spin-2021","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":"20","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":"8","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":"40% - 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":"2","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 invited 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)"}}]}}