524 search results - page 15 / 105 » Temporal reachability graphs |
113
Voted
AIPS
2000
15 years 5 months ago
2000
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...
200
Voted
ICRA
2010
IEEE
15 years 1 months ago
2010
IEEE
Aerial vehicles are appealing systems for possible future exploration of planets and moons such as Venus and Titan, because they combine extensive coverage with highresolution data...
136
Voted
CAV
2000
Springer
15 years 8 months ago
2000
Springer
We introduce discrete pushdown timed automata that are timed automata with integer-valued clocks augmented with a pushdown stack. A con guration of a discrete pushdown timed automa...
152
Voted
FMCAD
2004
Springer
15 years 9 months ago
2004
Springer
Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...
130
Voted
FOSSACS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this work, we introduce the class of Interrupt Timed Automata (ITA), which are well suited to the description of multi-task systems with interruptions in a single proc...