Presents an SMT encoding to automatically prove polyhedral abstractions for Petri nets, complete for flat nets via Presburger reachability.
Property Directed Reachability for Generalized Petri Nets
1 Pith paper cite this work, alongside 4 external citations. Polarity classification is still indexing.
1
Pith paper citing it
4
external citations · OpenAlex
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.