Abstraction-based incremental inductive coverability for Petri nets
From MaRDI portal
Publication:2117187
Recommendations
Cites work
- \textsf{PrIC3}: property directed reachability for MDPs
- An SMT-based approach to coverability analysis
- Complexity of some problems in Petri nets
- Counterexample-guided abstraction refinement for symbolic model checking
- Efficient coverability analysis by proof minimization
- From Many Places to Few: Automatic Abstraction Refinement for Petri Nets
- scientific article; zbMATH DE number 3885321 (Why is no real title available?)
- Infinite-state invariant checking with IC3 and predicate abstraction
- SAT-Based Model Checking without Unrolling
- SMT-based induction methods for timed systems
- SMT-based scenario verification for hybrid systems
- Well-structured transition systems everywhere!
Cited in
(4)
This page was built for publication: Abstraction-based incremental inductive coverability for Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117187)