Nicolas Amat

23 papers A* 1B 4Journal 12Unranked 5
YearRankTypeTitle / Venue / Authors
2026 — conf
Deciding Serializability in Network Systems.
TACAS (2)
Guy Amir, Mark Barbone, Nicolas Amat, Jules Jacobs
2026 J jnl
Deciding Serializability in Network Systems.
CoRR
Guy Amir, Mark Barbone, Nicolas Amat, Jules Jacobs
2025 A* conf
How Big is the Automaton? Certified Lower Bounds on the Size of Presburger DFAs.
ASE
Nicolas Amat, Pierre Ganty, Alessio Mansutti
2024 J jnl
On the Complexity of Proving Polyhedral Reductions.
Fundam. Informaticae
Nicolas Amat, Silvano Dal-Zilio, Didier Le Botlan
2024 — conf
Project and Conquer: Fast Quantifier Elimination for Checking Petri Net Reachability.
VMCAI (1)
Nicolas Amat, Silvano Dal-Zilio, Didier Le Botlan
2024 J jnl
Project and Conquer: Fast Quantifier Elimination for Checking Petri Net Reachability.
CoRR
Nicolas Amat, Silvano Dal-Zilio, Didier Le Botlan
2023 J jnl
A Toolchain to Compute Concurrent Places of Petri Nets.
Trans. Petri Nets Other Model. Concurr.
Nicolas Amat, Pierre Bouvier, Hubert Garavel
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 B conf
Automated Polyhedral Abstraction Proving.
Petri Nets
Nicolas Amat, Silvano Dal-Zilio, Didier Le Botlan
2023 J jnl
Automated Polyhedral Abstraction Proving.
CoRR
Nicolas Amat, Silvano Dal-Zilio, Didier Le Botlan
2023 — conf
Behind the Scene of the Model Checking Contest, Analysis of Results from 2018 to 2023.
TOOLympics@ETAPS
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, Jirí Srba, Yann Thierry-Mieg, Karsten Wolf
2023 J jnl
Leveraging polyhedral reductions for solving Petri net reachability problems.
CoRR
Nicolas Amat, Silvano Dal-Zilio, Didier Le Botlan
2023 J jnl
Leveraging polyhedral reductions for solving Petri net reachability problems.
Int. J. Softw. Tools Technol. Transf.
Nicolas Amat, Silvano Dal-Zilio, Didier Le Botlan
2023 B conf
SMPT: A Testbed for Reachability Methods in Generalized Petri Nets.
FM
Nicolas Amat, Silvano Dal-Zilio
2023 J jnl
SMPT: A Testbed for Reachability Methods in Generalized Petri Nets.
CoRR
Nicolas Amat, Silvano Dal-Zilio
2022 J jnl
A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking.
Fundam. Informaticae
Nicolas Amat, Bernard Berthomieu, Silvano Dal-Zilio
2022 B conf
Kong: A Tool to Squash Concurrent Places.
Petri Nets
Nicolas Amat, Louis Chauvet
2022 — conf
Property Directed Reachability for Generalized Petri Nets.
TACAS (1)
Nicolas Amat, Silvano Dal-Zilio, Thomas Hujsa
2022 J jnl
Property Directed Reachability for Generalized Petri Nets.
CoRR
Nicolas Amat, Silvano Dal-Zilio, Thomas Hujsa
2021 — conf
Accelerating the Computation of Dead and Concurrent Places Using Reductions.
SPIN
Nicolas Amat, Silvano Dal-Zilio, Didier Le Botlan
2021 J jnl
Accelerating the Computation of Dead and Concurrent Places using Reductions.
CoRR
Nicolas Amat, Silvano Dal-Zilio, Didier Le Botlan
2021 B conf
On the Combination of Polyhedral Abstraction and SMT-Based Model Checking for Petri Nets.
Petri Nets
Nicolas Amat, Bernard Berthomieu, Silvano Dal-Zilio
2021 J jnl
On the Combination of Polyhedral Abstraction and SMT-based Model Checking for Petri nets.
CoRR
Nicolas Amat, Bernard Berthomieu, Silvano Dal-Zilio