{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T09:26:25Z","timestamp":1750843585655,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031336195"},{"type":"electronic","value":"9783031336201"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-33620-1_18","type":"book-chapter","created":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T08:02:05Z","timestamp":1685174525000},"page":"324-345","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Automated Polyhedral Abstraction Proving"],"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":[[2023,5,28]]},"reference":[{"key":"18_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":"18_CR2","doi-asserted-by":"publisher","unstructured":"Amat, N., Berthomieu, B., Dal Zilio, S.: A polyhedral abstraction for Petri nets and its application to SMT-based model checking. Fundamenta Informaticae 187(2\u20134) (2022). https:\/\/doi.org\/10.3233\/FI-222134","DOI":"10.3233\/FI-222134"},{"key":"18_CR3","doi-asserted-by":"publisher","unstructured":"Amat, N., Dal Zilio, S.: SMPT: A testbed for reachabilty methods in generalized Petri nets. In: Formal Methods (FM). LNCS, Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-27481-7_25","DOI":"10.1007\/978-3-031-27481-7_25"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-030-99524-9_28","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"N Amat","year":"2022","unstructured":"Amat, N., Zilio, S.D., Hujsa, T.: Property Directed Reachability for Generalized Petri Nets. In: TACAS 2022. LNCS, vol. 13243, pp. 505\u2013523. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99524-9_28"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-030-84629-9_3","volume-title":"Model Checking Software","author":"N Amat","year":"2021","unstructured":"Amat, N., Dal Zilio, S., Le Botlan, D.: Accelerating the computation of dead and concurrent places using reductions. In: Laarman, A., Sokolova, A. (eds.) SPIN 2021. LNCS, vol. 12864, pp. 45\u201362. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84629-9_3"},{"key":"18_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-022-00694-8","author":"N Amat","year":"2022","unstructured":"Amat, N., Dal Zilio, S., Le Botlan, D.: Leveraging polyhedral reductions for solving Petri net reachability problems. Int. J. Softw. Tools Technol. Transfer (2022). https:\/\/doi.org\/10.1007\/s10009-022-00694-8","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-540-45069-6_12","volume-title":"Computer Aided Verification","author":"S Bardin","year":"2003","unstructured":"Bardin, S., Finkel, A., Leroux, J., Petrucci, L.: FAST: fast acceleration of symbolic transition systems. In: Hunt, W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 118\u2013121. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45069-6_12"},{"key":"18_CR8","doi-asserted-by":"publisher","unstructured":"Bardin, S., Finkel, A., Leroux, J., Petrucci, L.: FAST: acceleration from theory to practice. Int. J. Softw. Tools Technol. Transf. 10(5) (2008). https:\/\/doi.org\/10.1007\/s10009-008-0064-3","DOI":"10.1007\/s10009-008-0064-3"},{"key":"18_CR9","unstructured":"Barrett, C., Fontaine, P., Tinelli, C.: The SMT-LIB Standard: Version 2.6. Tech. rep., Department of Computer Science, The University of Iowa (2017). http:\/\/www.smt-lib.org\/"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-48320-9_14","volume-title":"CONCUR\u201999 Concurrency Theory","author":"B B\u00e9rard","year":"1999","unstructured":"B\u00e9rard, B., Fribourg, L.: Reachability analysis of (timed) petri nets using real arithmetic. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, pp. 178\u2013193. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48320-9_14"},{"key":"18_CR11","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":"18_CR12","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":"18_CR13","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. Transfer 22(2), 163\u2013181 (2019). https:\/\/doi.org\/10.1007\/s10009-019-00519-1","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/3-540-65306-6_20","volume-title":"Lectures on Petri Nets I: Basic Models","author":"J Esparza","year":"1998","unstructured":"Esparza, J.: Decidability and complexity of Petri net problems \u2014 an introduction. In: Reisig, W., Rozenberg, G. (eds.) ACPN 1996. LNCS, vol. 1491, pp. 374\u2013428. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-65306-6_20"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Esparza, J., Nielsen, M.: Decidability issues for Petri nets. BRICS Report Series 1(8) (1994)","DOI":"10.7146\/brics.v1i8.21662"},{"key":"18_CR17","unstructured":"Hack, M.H.T.: Decidability questions for Petri Nets. Ph.D. thesis, Massachusetts Institute of Technology (1976)"},{"key":"18_CR18","doi-asserted-by":"publisher","unstructured":"Hirshfeld, Y.: Petri nets and the equivalence problem. In: B\u00f6rger, E., Gurevich, Y., Meinke, K. (eds.) CSL 1993. LNCS, vol. 832, pp. 165\u2013174. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/BFb0049331","DOI":"10.1007\/BFb0049331"},{"key":"18_CR19","unstructured":"Hujsa, T., Berthomieu, B., Dal Zilio, S., Le Botlan, D.: Checking marking reachability with the state equation in Petri net subclasses. CoRR abs\/2006.05600 (2020)"},{"key":"18_CR20","unstructured":"Hujsa, T., Berthomieu, B., Dal Zilio, S., Le Botlan, D.: On the Petri nets with a single shared place and beyond. CoRR abs\/2005.04818 (2020)"},{"key":"18_CR21","unstructured":"LAAS-CNRS: SMPT (2020). https:\/\/github.com\/nicolasAmat\/SMPT\/"},{"key":"18_CR22","unstructured":"LAAS-CNRS: Tina Toolbox (2020). http:\/\/projects.laas.fr\/tina"},{"key":"18_CR23","unstructured":"LAAS-CNRS: Reductron (2023). https:\/\/github.com\/nicolasAmat\/Reductron\/"},{"key":"18_CR24","doi-asserted-by":"publisher","unstructured":"Leroux, J.: Presburger vector addition systems. In: 2013 28th Annual ACM\/IEEE Symposium on Logic in Computer Science (2013). https:\/\/doi.org\/10.1109\/LICS.2013.7","DOI":"10.1109\/LICS.2013.7"},{"key":"18_CR25","doi-asserted-by":"publisher","unstructured":"Thierry-Mieg, Y., Poitrenaud, D., Hamez, A., Kordon, F.: Hierarchical Hierarchical Set Decision Diagrams and regular models. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol. 5505. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00768-2","DOI":"10.1007\/978-3-642-00768-2"}],"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-031-33620-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,17]],"date-time":"2023-06-17T23:09:19Z","timestamp":1687043359000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33620-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031336195","9783031336201"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33620-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 May 2023","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":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apn2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/petrinets2023.deec.fct.unl.pt\/","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":"47","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":"21","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":"45% - 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":"4","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":"5","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)"}}]}}