Publications

On the Complexity of Proving Polyhedral Reductions. To appear in Fundamenta Informaticae (FI), 2024.

Project

Behind the Scene of the Model Checking Contest, Analysis of Results from 2018 to 2023. To appear in TOOLympics 2023, Part III of the Proceedings of the 29th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2024.

Project

A Toolchain to Compute Concurrent Places of Petri Nets. ToPNoC, 2023.

PDF Project DOI

Automated Polyhedral Abstraction Proving. Petri Nets, 2023.

PDF Project Slides DOI

Leveraging polyhedral reductions for solving Petri net reachability problems. STTT, 2022.

PDF Project DOI

Kong: a Tool to Squash Concurrent Places. Petri Nets, 2022.

PDF Project Slides DOI

Property Directed Reachability for Generalized Petri Nets. TACAS, 2022.

PDF Project Slides DOI