Automated polyhedral abstraction proving
From MaRDI portal
Publication:6535199
DOI10.1007/978-3-031-33620-1_18zbMATH Open1541.68235MaRDI QIDQ6535199
Silvano Dal Zilio, Didier Le Botlan, Nicolas Amat
Publication date: 16 November 2023
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Accelerating the computation of dead and concurrent places using reductions
- On the combination of polyhedral abstraction and SMT-based model checking for Petri nets
- Hierarchical Set Decision Diagrams and Regular Models
- A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking
- Presburger Vector Addition Systems
- Petri Net Reductions for Counting Markings
- Property directed reachability for generalized Petri nets
Related Items (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)