Automated polyhedral abstraction proving

DOI10.1007/978-3-031-33620-1_18zbMATH Open1541.68235MaRDI QIDQ6535199FDOQ6535199

Authors: Nicolas Amat, Silvano Dal Zilio, Didier Le Botlan 

Publication date: 16 November 2023

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Presburger vector addition systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the combination of polyhedral abstraction and SMT-based model checking for Petri nets
• Petri Net Reductions for Counting Markings
• Accelerating the computation of dead and concurrent places using reductions
• Hierarchical Set Decision Diagrams and Regular Models
• Title not available (Why is that?)
• A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking
• Property directed reachability for generalized Petri nets

Cited In (2)

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

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)