On the Complexity of Proving Polyhedral Reductions
Nicolas Amat, Silvano Dal Zilio, Didier Le Botlan Fundamenta Informaticae 192(3-4), sep 2024.
Reductions
Project and Conquer: Fast Quantifier Elimination for Checking Petri Net Reachability
Nicolas Amat, Silvano Dal Zilio, Didier Le Botlan In VMCAI 2024 — Verification, Model Checking, and Abstract Interpretation, jan 2024.
Leveraging polyhedral reductions for solving Petri net reachability problems
Nicolas Amat, Silvano Dal Zilio, Didier Le Botlan International Journal on Software Tools for Technology Transfer 25, dec 2023.
Polyhedral Reductions for Petri nets (Poster)
Nicolas Amat, Bernard Berthomieu, Silvano Dal Zilio, Didier Le Botlan In MSR 2023 — Modélisation des Systèmes Réactifs, nov 2023.
Automated Polyhedral Abstraction Proving
Nicolas Amat, Silvano Dal Zilio, Didier Le Botlan In Petri nets 2023 — 44th International Conference on Application and Theory of Petri Nets and Concurrency, jun 2023.
SMPT: A Testbed for Reachability Methods in Generalized Petri Nets
Nicolas Amat, Silvano Dal Zilio In FM 2023 — 25th International Symposium on Formal Methods, mar 2023.
A Polyhedral Abstraction for Petri nets and its Application to SMT-Based Model Checking
Nicolas Amat, Bernard Berthomieu, Silvano Dal Zilio Fundamenta Informaticae 187(2-4), oct 2022.
Property Directed Reachability for Generalized Petri Nets
Nicolas Amat, Silvano Dal Zilio, Thomas Hujsa In TACAS 2022 — International Conference on Tools and Algorithms for the Construction and Analysis of Systems, mar 2022.
On the Combination of Polyhedral Abstraction and SMT-Based Model Checking for Petri Nets
Nicolas Amat, Silvano Dal Zilio, Bernard Berthomieu In ICATPN 2021 — 42nd International Conference on Application and Theory of Petri Nets and Concurrency, jun 2021.
Accelerating the Computation of Dead and Concurrent Places Using Reductions
Nicolas Amat, Silvano Dal Zilio, Didier Le Botlan In SPIN 2021 — International Symposium on Model Checking Software, jun 2021.