Automated polyhedral abstraction proving

DOI10.1007/978-3-031-33620-1_18MaRDI QIDQ6535199zbMATH OpenFDO

Authors Nicolas Amat, Silvano Dal Zilio, Didier Le Botlan

Publication date 16 November 2023

zbMATH Keywords

Petri netsautomated reasoningabstraction techniquesreachability problems

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

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

• 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?)
• 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
• 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)

• On the complexity of proving polyhedral reductions
• Automatic Abstraction for Congruences

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)