\textsf{PrIC3}: property directed reachability for MDPs
From MaRDI portal
Publication:2226756
Abstract: IC3 has been a leap forward in symbolic model checking. This paper proposes PrIC3 (pronounced pricy-three), a conservative extension of IC3 to symbolic model checking of MDPs. Our main focus is to develop the theory underlying PrIC3. Alongside, we present a first implementation of PrIC3 including the key ingredients from IC3 such as generalization, repushing, and propagation.
Recommendations
Cited in
(9)- Abstraction-based incremental inductive coverability for Petri nets
- Out of control: reducing probabilistic models by control-state elimination
- Generalized property directed reachability
- Symbolic verification and strategy synthesis for turn-based stochastic games
- The Lattice-Theoretic Essence of Property Directed Reachability Analysis
- Exploiting adjoints in property directed reachability analysis
- Probabilistic program verification via inductive synthesis of inductive invariants
- Adjointness in property directed reachability analysis
- Latticed \(k\)-induction with an application to probabilistic programs
This page was built for publication: \textsf{PrIC3}: property directed reachability for MDPs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2226756)