8 citations · 13 across the 2 of their papers we have counts for
3 papers
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…
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…
A Polyhedral Abstraction for Petri nets and its Application to SMT-Based Model Checking
Nicolas Amat, Bernard Berthomieu, Silvano Dal Zilio
We define a new method for taking advantage of net reductions in combination with a SMT-based model checker. Our approach consists in transforming a reachability problem about some…