Property directed reachability for generalized Petri nets
From MaRDI portal
Publication:6535575
DOI10.1007/978-3-030-99524-9_28zbMATH Open1547.68479MaRDI QIDQ6535575FDOQ6535575
Authors: Nicolas Amat, Silvano Dal Zilio, Thomas Hujsa 
Publication date: 23 January 2024
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- TAPAAL 2.0: integrated development environment for timed-arc Petri nets
- Semigroups, Presburger formulas, and languages
- SAT-Based Model Checking without Unrolling
- Infinite-state invariant checking with IC3 and predicate abstraction
- Generalized property directed reachability
- Title not available (Why is that?)
- Title not available (Why is that?)
- The tool TINA – Construction of abstract state spaces for petri nets and time petri nets
- Understanding IC3
- State equation, controllability, and maximal matchings of petri nets
- On the combination of polyhedral abstraction and SMT-based model checking for Petri nets
- The general vector addition system reachability problem by Presburger inductive invariants
- Structural reductions revisited
- The reachability problem for Petri nets is not elementary
- Refinement of trace abstraction for real-time programs
- Commodification of accelerations for the Karp and Miller construction
- An SMT-based approach to coverability analysis
- Abstraction-based incremental inductive coverability for Petri nets
- Applying CEGAR to the Petri net state equation
- Directed reachability for infinite-state systems
Cited In (2)
This page was built for publication: Property directed reachability for generalized Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535575)
