On the Combination of Polyhedral Abstraction and SMT-Based Model Checking for Petri Nets. - Nicolas Amat; Bernard Berthomieu; Silvano Dal-Zilio (Petri Nets, 2021)

Accelerating the Computation of Dead and Concurrent Places Using Reductions. - Nicolas Amat; Silvano Dal-Zilio; Didier Le Botlan (SPIN, 2021)

Kong: A Tool to Squash Concurrent Places. - Nicolas Amat; Louis Chauvet (Petri Nets, 2022)

Property Directed Reachability for Generalized Petri Nets. - Nicolas Amat; Silvano Dal-Zilio; Thomas Hujsa (TACAS (1), 2022)

A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking. - Nicolas Amat; Bernard Berthomieu; Silvano Dal-Zilio (Fundam. Informaticae, 2022)

Automated Polyhedral Abstraction Proving. - Nicolas Amat; Silvano Dal-Zilio; Didier Le Botlan (Petri Nets, 2023)

SMPT: A Testbed for Reachability Methods in Generalized Petri Nets. - Nicolas Amat; Silvano Dal-Zilio (FM, 2023)

Behind the Scene of the Model Checking Contest, Analysis of Results from 2018 to 2023. - Nicolas Amat; Elvio G. Amparore; Bernard Berthomieu; Pierre Bouvier; Silvano Dal-Zilio; Francis Hulin-Hubard; Peter Gjøl Jensen; Loïg Jezequel; Fabrice Kordon; Shuo Li; Emmanuel Paviot-Adet; Laure Petrucci; et al. (TOOLympics@ETAPS, 2023)

A Toolchain to Compute Concurrent Places of Petri Nets. - Nicolas Amat; Pierre Bouvier; Hubert Garavel (Trans. Petri Nets Other Model. Concurr., 2023)

A polyhedral framework for reachability problems in Petri Nets. (Un cadre polyédrique pour les problèmes d'accessibilité dans les réseaux de Petri). - Nicolas Amat (2023)

Leveraging polyhedral reductions for solving Petri net reachability problems. - Nicolas Amat; Silvano Dal-Zilio; Didier Le Botlan (Int. J. Softw. Tools Technol. Transf., 2023)

Project and Conquer: Fast Quantifier Elimination for Checking Petri Net Reachability. - Nicolas Amat; Silvano Dal-Zilio; Didier Le Botlan (VMCAI (1), 2024)

On the Complexity of Proving Polyhedral Reductions. - Nicolas Amat; Silvano Dal-Zilio; Didier Le Botlan (Fundam. Informaticae, 2024)