A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking

DOI10.3233/FI-222134OpenAlexW4287205805MaRDI QIDQ5044397

Bernard Berthomieu, Silvano Dal Zilio, Nicolas Amat

Publication date: 31 October 2022

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-222134

Mathematics Subject Classification ID

Computer science (68-XX)

Uses Software

• z3
• Cubicle
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stubborn versus structural reductions for Petri nets
• Directed reachability for infinite-state systems
• Infinite-state invariant checking with IC3 and predicate abstraction
• Understanding IC3
• SAT-Based Model Checking without Unrolling
• Reduction
• Symbolic and Structural Model-Checking
• Model Checking Software
• Bounded model checking using satisfiability solving

This page was built for publication: A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking