Local abstraction refinement for probabilistic timed programs
From MaRDI portal
Recommendations
- Abstraction Refinement for Probabilistic Software
- Modal stochastic games. Abstraction-refinement of probabilistic automata
- Variable probabilistic abstraction refinement
- Reachability analysis of probabilistic systems by successive refinements
- Stochastic games for verification of probabilistic timed automata
Cites work
- 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
- Denumerable Markov chains. 2nd ed. Originally published by Van Nostrand 1966
- Efficient generation of Craig interpolants in satisfiability modulo theories
- Markov Chains
- Performance analysis of probabilistic timed automata using digital clocks
- Probabilistic CEGAR
- Reachability analysis of probabilistic systems by successive refinements
- Stochastic games for verification of probabilistic timed automata
- Symbolic model checking for probabilistic timed automata
- The existence of refinement mappings
- Timed automata: Semantics, algorithms and tools
Cited in
(4)
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)