On the complexity of proving polyhedral reductions

DOI10.3233/FI-242197MaRDI QIDQ6622144zbMATH OpenFDO

Authors Nicolas Amat, Silvano Dal Zilio, Didier Le Botlan

Publication date 22 October 2024

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/FI-242197

zbMATH Keywords

abstraction techniquesautomated reasoningPetri netsreachability problems

Mathematics Subject Classification ID

Computer science (68-XX)

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
• Automated polyhedral abstraction proving
• Hierarchical Set Decision Diagrams and Regular Models
• scientific article; zbMATH DE number 3980500 (Why is no real title available?)
• scientific article; zbMATH DE number 1302047 (Why is no real title available?)
• scientific article; zbMATH DE number 1954380 (Why is no real title available?)
• On the combination of polyhedral abstraction and SMT-based model checking for Petri nets
• On the completeness of a certain system of arithmetic of whole numbers in which addition occurs as the only operation
• Petri Net Reductions for Counting Markings
• Presburger vector addition systems
• Property directed reachability for generalized Petri nets
• Semigroups, Presburger formulas, and languages

This page was built for publication: On the complexity of proving polyhedral reductions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6622144)