Nicolas Amat

Identifiants chercheurs

IdHAL :

nicolas-amat

ORCID :

0000-0002-5969-7346

IdRef :

275776611

Publications

Communication dans un congrès (8)

How Big is the Automaton? Certified Lower Bounds on the Size of Presburger DFAs Nicolas Amat,Pierre Ganty,Alessio Mansutti 40th IEEE/ACM International Conference on Automated Software Engineering - ASE 2025, Nov 2025, Séoul, South Korea Communication dans un congrès hal-05523231v1
Project and Conquer: Fast Quantifier Elimination for Checking Petri Net Reachability Nicolas Amat,Silvano Dal Zilio,Didier Le Botlan Verification, Model Checking, and Abstract Interpretation. VMCAI 2024, Jan 2024, London, United Kingdom. pp.101-123, ⟨10.1007/978-3-031-50524-9_5⟩ Communication dans un congrès hal-04375443v1
SMPT: A Testbed for Reachability Methods in Generalized Petri Nets Nicolas Amat,Silvano Dal Zilio 25th International Symposium on Formal Methods (FM 2023), Mar 2023, Lübeck, Germany. pp.445-453, ⟨10.1007/978-3-031-27481-7_25⟩ Communication dans un congrès hal-04007410v1
Automated Polyhedral Abstraction Proving Nicolas Amat,Silvano Dal Zilio,Didier Le Botlan 44th International Conference on Application and Theory of Petri Nets and Concurrency (Petri Nets 2023), Jun 2023, Lisbon, Portugal. pp.324-345, ⟨10.1007/978-3-031-33620-1_18⟩ Communication dans un congrès hal-04115006v1
Property Directed Reachability for Generalized Petri Nets Nicolas Amat,Silvano Dal Zilio,Thomas Hujsa Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2022, Apr 2022, Munich, Germany. ⟨10.1007/978-3-030-99524-9_28⟩ Communication dans un congrès hal-03545594v1
Kong: a Tool to Squash Concurrent Places Nicolas Amat,Louis Chauvet 43rd International Conference on Application and Theory of Petri Nets and Concurrency (Petri Nets 2022), Jun 2022, Bergen, Norway. ⟨10.1007/978-3-031-06653-5_6⟩ Communication dans un congrès hal-03614426v1
Accelerating the Computation of Dead and Concurrent Places using Reductions Nicolas Amat,Silvano Dal Zilio,Didier Le Botlan 27th International SPIN Symposium on Model Checking of Software, Jul 2021, Aarhus, Denmark. ⟨10.1007/978-3-030-84629-9_3⟩ Communication dans un congrès hal-03268388v1
On the Combination of Polyhedral Abstraction and SMT-based Model Checking for Petri nets Nicolas Amat,Bernard Berthomieu,Silvano Dal Zilio 42rd International Conference on Application and Theory of Petri Nets and Concurrency (Petri Nets 2021), Jun 2021, Paris (virtual), France. ⟨10.1007/978-3-030-76983-3_9⟩ Communication dans un congrès hal-03202111v1

Article dans une revue (4)

On the Complexity of Proving Polyhedral Reductions Nicolas Amat,Silvano Dal Zilio,Didier Le Botlan Fundamenta Informaticae, 2024, 192 (3-4), pp.363-394. ⟨10.3233/FI-242197⟩ Article dans une revue hal-04712076v1
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, 2023, 25, pp.95-114. ⟨10.1007/s10009-022-00694-8⟩ Article dans une revue hal-03973463v1
A Toolchain to Compute Concurrent Places of Petri Nets Nicolas Amat,Pierre Bouvier,Hubert Garavel LNCS Transactions on Petri Nets and Other Models of Concurrency, 2023, Lecture Notes in Computer Science, 14150, pp.1-26. ⟨10.1007/978-3-662-68191-6_1⟩ Article dans une revue hal-04392784v1
A Polyhedral Abstraction for Petri nets and its Application to SMT-Based Model Checking Nicolas Amat,Bernard Berthomieu,Silvano Dal Zilio Fundamenta Informaticae, 2022, 187 (2-4), pp.103-138. ⟨10.3233/FI-222134⟩ Article dans une revue hal-03455697v2

Thèse (1)

A polyhedral framework for reachability problems in Petri Nets Nicolas Amat Networking and Internet Architecture [cs.NI]. INSA de Toulouse, 2023. English. ⟨NNT : 2023ISAT0033⟩ Thèse tel-04458457v2

Poster de conférence (1)

Polyhedral Reductions for Petri nets Nicolas Amat,Bernard Berthomieu,Silvano Dal Zilio,Didier Le Botlan Modélisation des Systèmes Réactifs (MSR'23), Nov 2023, Toulouse, France. , 2023 Poster de conférence hal-04355257v1