444 search results - page 14 / 89 » Sensitive state-space exploration |
CHARME
2005
Springer
15 years 5 months ago
2005
Springer
In this paper, we explore a parallelization of BMC based on state space partitioning. The parallelization is accomplished by executing multiple instances of BMC independently from ...
CAV
1998
Springer
15 years 4 months ago
1998
Springer
This paper presents a new algorithm for efficiently verifying timed systems. The new algorithm represents timing information using geometric regions and explores the timed state sp...
118
click to vote
ECML
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We present a new reinforcement learning approach for deterministic continuous control problems in environments with unknown, arbitrary reward functions. The difficulty of...
EWC
2000
14 years 11 months ago
2000
: This paper discusses design families and design individuals. Phase space is introduced to complement state space. Phase transition as a generic method of generating design famili...
105
click to vote
CONCUR
2001
Springer
15 years 4 months ago
2001
Springer
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...