{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:27:06Z","timestamp":1777645626684,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"2-4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["FI"],"published-print":{"date-parts":[[2022,10,19]]},"abstract":"<jats:p>We define a new method for taking advantage of net reductions in combination with a SMT-based model checker. Our approach consists in transforming a reachability problem about some Petri net, into the verification of an updated reachability property on a reduced version of this net. This method relies on a new state space abstraction based on systems of constraints, called polyhedral abstraction. We prove the correctness of this method using a new notion of equivalence between nets. We provide a complete framework to define and check the correctness of equivalence judgements; prove that this relation is a congruence; and give examples of basic equivalence relations that derive from structural reductions. Our approach has been implemented in a tool, named SMPT, that provides two main procedures: Bounded Model Checking (BMC) and Property Directed Reachability (PDR). Each procedure has been adapted in order to use reductions and to work with arbitrary Petri nets. We tested SMPT on a large collection of queries used in the Model Checking Contest. Our experimental results show that our approach works well, even when we only have a moderate amount of reductions.<\/jats:p>","DOI":"10.3233\/fi-222134","type":"journal-article","created":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T11:56:44Z","timestamp":1666353404000},"page":"103-138","source":"Crossref","is-referenced-by-count":6,"title":["A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking"],"prefix":"10.1177","volume":"187","author":[{"given":"Nicolas","family":"Amat","sequence":"first","affiliation":[{"name":"LAAS-CNRS, Universit\u00e9 de Toulouse, CNRS, INSA, Toulouse, France. nicolas.amat@laas.fr"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernard","family":"Berthomieu","sequence":"additional","affiliation":[{"name":"LAAS-CNRS, Universit\u00e9 de Toulouse, CNRS, Toulouse, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silvano","family":"Dal Zilio","sequence":"additional","affiliation":[{"name":"LAAS-CNRS, Universit\u00e9 de Toulouse, CNRS, Toulouse, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","container-title":["Fundamenta Informaticae"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/FI-222134","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:32:47Z","timestamp":1777444367000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/FI-222134"}},"subtitle":[],"editor":[{"given":"Didier","family":"Buchs","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"Josep","family":"Carmona","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"Jetty","family":"Kleijn","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2022,10,19]]},"references-count":0,"journal-issue":{"issue":"2-4"},"URL":"https:\/\/doi.org\/10.3233\/fi-222134","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,19]]}}}