Recommendations
- A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking
- On the combination of polyhedral abstraction and SMT-based model checking for Petri nets
- From Many Places to Few: Automatic Abstraction Refinement for Petri Nets
- From many places to few: automatic abstraction refinement for Petri nets
- PVS strategies for proving abstraction properties of automata
Cites work
- A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking
- Accelerating the computation of dead and concurrent places using reductions
- Hierarchical Set Decision Diagrams and Regular Models
- scientific article; zbMATH DE number 4033100 (Why is no real title available?)
- scientific article; zbMATH DE number 1302047 (Why is no real title available?)
- scientific article; zbMATH DE number 1361123 (Why is no real title available?)
- scientific article; zbMATH DE number 559221 (Why is no real title available?)
- scientific article; zbMATH DE number 1555184 (Why is no real title available?)
- On the combination of polyhedral abstraction and SMT-based model checking for Petri nets
- Petri Net Reductions for Counting Markings
- Presburger vector addition systems
- Property directed reachability for generalized Petri nets
Cited in
(2)
This page was built for publication: Automated polyhedral abstraction proving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535199)
