Local abstraction refinement for probabilistic timed programs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3543391 (Why is no real title available?)
- scientific article; zbMATH DE number 1884411 (Why is no real title available?)
- A framework for verification of software with time and probabilities
- A game-based abstraction-refinement framework for Markov decision processes
- Abstraction Refinement for Probabilistic Software
- Automatic verification of real-time systems with discrete probability distributions.
- Best probabilistic transformers
- Efficient generation of Craig interpolants in satisfiability modulo theories
- Lectures on Concurrency and Petri Nets
- Markov Chains
- Performance analysis of probabilistic timed automata using digital clocks
- Probabilistic CEGAR
- Stochastic games for verification of probabilistic timed automata
- Symbolic model checking for probabilistic timed automata
- The existence of refinement mappings
Cited in
(3)
This page was built for publication: Local abstraction refinement for probabilistic timed programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453108)