325 search results - page 5 / 65 » Structured Reachability Analysis for Markov Decision Process... |
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. This paper presents a novel technique for counterexample generation in probabilistic model checking of Markov chains and Markov Decision Processes. (Finite) paths in coun...
FSTTCS
2004
Springer
15 years 2 months ago
2004
Springer
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...
105
click to vote
QEST
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract— This paper reports on our efforts to link an industrial state-of-the-art modelling tool to academic state-of-the-art analysis algorithms. In a nutshell, we enable timed...
FM
2001
Springer
15 years 2 months ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
ECAI
2008
Springer
14 years 11 months ago
2008
Springer
Time is a crucial variable in planning and often requires special attention since it introduces a specific structure along with additional complexity, especially in the case of dec...