875 search results - page 43 / 175 » On Reachability Under Uncertainty |
111
click to vote
ICCAD
2010
IEEE
14 years 10 months ago
2010
IEEE
State-based model checking methods comprise computing and storing reachable states, while stateless model checking methods directly reason about reachable paths using decision proc...
128
click to vote
VIZSEC
2007
Springer
15 years 6 months ago
2007
Springer
Abstract Attack graphs for large enterprise networks improve security by revealing critical paths used by adversaries to capture network assets. Even with simplification, current a...
105
click to vote
CONCUR
2000
Springer
15 years 4 months ago
2000
Springer
We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augment...
98
Voted
AIPS
2003
15 years 2 months ago
2003
Planning in nondeterministic domains with temporally extended goals under partial observability is one of the most challenging problems in planning. Subsets of this problem have b...
130
Voted
ICRA
2002
IEEE
15 years 5 months ago
2002
IEEE
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...