8 citations · 26 across the 7 of their papers we have counts for
3 papers · 1 filter
On the Complexity of Proving Polyhedral Reductions
Nicolas Amat, Silvano Dal Zilio, Didier Le Botlan
We propose an automated procedure to prove polyhedral abstractions (also known as polyhedral reductions) for Petri nets. Polyhedral abstraction is a new type of state space equival…
SMPT: A Testbed for Reachability Methods in Generalized Petri Nets
Nicolas Amat, Silvano Dal Zilio
SMPT (for Satisfiability Modulo Petri Net) is a model checker for reachability problems in Petri nets. It started as a portfolio of methods to experiment with symbolic model checki…
Leveraging polyhedral reductions for solving Petri net reachability problems
Nicolas Amat, Silvano Dal Zilio, Didier Le Botlan
We propose a new method that takes advantage of structural reductions to accelerate the verification of reachability properties on Petri nets. Our approach relies on a state space…