( en | de | ru )

 

Disambiguation of "Amat, Nicolas"

Author of the publication

copydeleteadd this publication to your clipboard
A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking.

, , and . Fundam. Informaticae, 187 (2-4): 103-138 (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Amat Kane

Philippe Amat

Laure Amate

Reja Amatya

Soven Amatya

 

Other publications of authors with the same name

Project and Conquer: Fast Quantifier Elimination for Checking Petri Net Reachability., , and . VMCAI (1), volume 14499 of Lecture Notes in Computer Science, page 101-123. Springer, (2024)On the Combination of Polyhedral Abstraction and SMT-Based Model Checking for Petri Nets., , and . Petri Nets, volume 12734 of Lecture Notes in Computer Science, page 164-185. Springer, (2021)Automated Polyhedral Abstraction Proving., , and . Petri Nets, volume 13929 of Lecture Notes in Computer Science, page 324-345. Springer, (2023)Property Directed Reachability for Generalized Petri Nets., , and . TACAS (1), volume 13243 of Lecture Notes in Computer Science, page 505-523. Springer, (2022)A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking., , and . Fundam. Informaticae, 187 (2-4): 103-138 (2022)Kong: A Tool to Squash Concurrent Places., and . Petri Nets, volume 13288 of Lecture Notes in Computer Science, page 115-126. Springer, (2022)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).. INSA Toulouse, France, (2023)Accelerating the Computation of Dead and Concurrent Places Using Reductions., , and . SPIN, volume 12864 of Lecture Notes in Computer Science, page 45-62. Springer, (2021)SMPT: A Testbed for Reachability Methods in Generalized Petri Nets., and . FM, volume 14000 of Lecture Notes in Computer Science, page 445-453. Springer, (2023)Leveraging polyhedral reductions for solving Petri net reachability problems., , and . CoRR, (2023)