Nicolas Amat
- DTIS, ONERA, Université de Toulouse [Toulouse]
Publications
Publications
How Big is the Automaton? Certified Lower Bounds on the Size of Presburger DFAs40th IEEE/ACM International Conference on Automated Software Engineering - ASE 2025, Nov 2025, Séoul, South Korea |
|
|
|
Project and Conquer: Fast Quantifier Elimination for Checking Petri Net ReachabilityVerification, Model Checking, and Abstract Interpretation. VMCAI 2024, Jan 2024, London, United Kingdom. pp.101-123, ⟨10.1007/978-3-031-50524-9_5⟩ |
|
|
SMPT: A Testbed for Reachability Methods in Generalized Petri Nets25th International Symposium on Formal Methods (FM 2023), Mar 2023, Lübeck, Germany. pp.445-453, ⟨10.1007/978-3-031-27481-7_25⟩ |
|
|
Automated Polyhedral Abstraction Proving44th 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⟩ |
|
|
Property Directed Reachability for Generalized Petri NetsTools and Algorithms for the Construction and Analysis of Systems. TACAS 2022, Apr 2022, Munich, Germany. ⟨10.1007/978-3-030-99524-9_28⟩ |
|
|
Kong: a Tool to Squash Concurrent Places43rd 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⟩ |
|
|
Accelerating the Computation of Dead and Concurrent Places using Reductions27th International SPIN Symposium on Model Checking of Software, Jul 2021, Aarhus, Denmark. ⟨10.1007/978-3-030-84629-9_3⟩ |
|
|
On the Combination of Polyhedral Abstraction and SMT-based Model Checking for Petri nets42rd 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⟩ |
|
|
On the Complexity of Proving Polyhedral ReductionsFundamenta Informaticae, 2024, 192 (3-4), pp.363-394. ⟨10.3233/FI-242197⟩ |
|
|
Leveraging polyhedral reductions for solving Petri net reachability problemsInternational Journal on Software Tools for Technology Transfer, 2023, 25, pp.95-114. ⟨10.1007/s10009-022-00694-8⟩ |
|
|
A Toolchain to Compute Concurrent Places of Petri NetsLNCS 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⟩ |
|
|
A Polyhedral Abstraction for Petri nets and its Application to SMT-Based Model CheckingFundamenta Informaticae, 2022, 187 (2-4), pp.103-138. ⟨10.3233/FI-222134⟩ |
|
|
A polyhedral framework for reachability problems in Petri NetsNetworking and Internet Architecture [cs.NI]. INSA de Toulouse, 2023. English. ⟨NNT : 2023ISAT0033⟩ |
|
|
Polyhedral Reductions for Petri netsModélisation des Systèmes Réactifs (MSR'23), Nov 2023, Toulouse, France. , 2023 |