68 search results - page 2 / 14 » Sequential optimisation without state space exploration |
CAV
2005
Springer
13 years 10 months ago
2005
Springer
We consider in the current paper the issue of exploiting the structural form of Esterel programs [BG92] to partition the algorithmic RSS (reachable state space) fix-point construc...
CVPR
2004
IEEE
14 years 7 months ago
2004
IEEE
We present Propagation Networks (P-Nets), a novel approach for representing and recognizing sequential activities that include parallel streams of action. We represent each activi...
CAV
1992
Springer
13 years 9 months ago
1992
Springer
State-space caching is a veri cation technique for nite-state concurrent systems. It performs an exhaustive exploration of the state space of the system being checked while storin...
SARA
2009
Springer
13 years 11 months ago
2009
Springer
Classical planning deals with finding a (shortest) sequence of actions transferring the world from its initial state to a state satisfying the goal condition. Traditional planning...
STTT
2008
13 years 5 months ago
2008
Explicit model checking algorithms explore the full state space of a system. State spaces are usually treated as directed graphs without any specific features. We gather a large co...