6 citations · 18 across the 4 of their papers we have counts for
4 papers
Project and Conquer: Fast Quantifier Elimination for Checking Petri Net Reachability
Nicolas Amat, Silvano Dal Zilio, Didier Le Botlan
We propose a method for checking generalized reachability properties in Petri nets that takes advantage of structural reductions and that can be used, transparently, as a pre-proce…
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…
Property Directed Reachability for Generalized Petri Nets
Nicolas Amat, Silvano Dal Zilio, Thomas Hujsa
We propose a semi-decision procedure for checking generalized reachability properties, on generalized Petri nets, that is based on the Property Directed Reachability (PDR) method.…