209 search results - page 3 / 42 » Dealing with stochastic reachability |
HYBRID
2009
Springer
13 years 9 months ago
2009
Springer
ICTAI
2005
IEEE
13 years 11 months ago
2005
IEEE
Stochastic Shortest Path problems (SSPs) can be efficiently dealt with by the Real-Time Dynamic Programming algorithm (RTDP). Yet, RTDP requires that a goal state is always reach...
FMSD
2006
13 years 6 months ago
2006
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...
FORMATS
2006
Springer
13 years 9 months ago
2006
Springer
Current numerical model checkers for stochastic systems can efficiently analyse stochastic models. However, the fact that they are unable to provide debugging information constrain...
FMCAD
2004
Springer
13 years 9 months ago
2004
Springer
The main challenge in BDD-based verification is dealing with the memory explosion problem during reachability analysis. In this paper we advocate a methodology to handle this probl...