Nicolas Amat

Orcid: 0000-0002-5969-7346

According to our database1, Nicolas Amat authored at least 12 papers between 2021 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On the Complexity of Proving Polyhedral Reductions.
Fundam. Informaticae, 2024

Project and Conquer: Fast Quantifier Elimination for Checking Petri Net Reachability.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2024

2023
Leveraging polyhedral reductions for solving Petri net reachability problems.
Int. J. Softw. Tools Technol. Transf., February, 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).
PhD thesis, 2023

A Toolchain to Compute Concurrent Places of Petri Nets.
Trans. Petri Nets Other Model. Concurr., 2023

SMPT: A Testbed for Reachability Methods in Generalized Petri Nets.
Proceedings of the Formal Methods - 25th International Symposium, 2023

Automated Polyhedral Abstraction Proving.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2023

2022
A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking.
Fundam. Informaticae, 2022

Property Directed Reachability for Generalized Petri Nets.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2022

Kong: A Tool to Squash Concurrent Places.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2022

2021
Accelerating the Computation of Dead and Concurrent Places Using Reductions.
Proceedings of the Model Checking Software - 27th International Symposium, 2021

On the Combination of Polyhedral Abstraction and SMT-Based Model Checking for Petri Nets.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2021


  Loading...