Presents an SMT encoding to automatically prove polyhedral abstractions for Petri nets, complete for flat nets via Presburger reachability.
Decidability Questions for Petri Nets
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the Complexity of Proving Polyhedral Reductions
Presents an SMT encoding to automatically prove polyhedral abstractions for Petri nets, complete for flat nets via Presburger reachability.