Dagstuhl Seminar 01451 on Exploration of Large State Spaces



Thursday, Nov. 8, 2001

07:30-09:00 breakfast
Chair: Robert Givan
09:00-09:45
Charles Pecheur (NASA)
Symbolic Model Checking of Domain Models for Autonomous Spacecrafts
09:45-10:30
Christian Stangier (Univ. Trier)
Hierachical Image Computation and Dynamic Conjunction Scheduling in Symbolic Model Checking
10:30-11:00 coffee break
11:00-11:45
Malte Helmert (University Freiburg)
Decidability and Undecidability Results for Planning with Numerical State Variables
11:45-12:30
Jana Köhler (IBM)
What is Large? Searching State Space under Real-Time Requirements
12:30-14:00 lunch break
Chair: Wolfgang Thomas
14:00-14:40
Robert Givan (Purdue University)
Sampling Techniques for Large MDP Problems
14:40-15:20
Ron Parr (Duke University)
Projection Methods
15:20-16:00
Tom Dean (Brown University)
Minimizing Approximate Models versus Approximating Minimal Models
16:00-16:30 coffee break
16:30-17:15
Thomas Wilke (Univ. Kiel)
Reducing the State Space of Buchi Automata using Simulation Relations
17:15-18:00
Colin Stirling (Edinburgh University)
Decidability of Language Equivalence for DPDA
18:00 dinner
Chair: Moshe Y. Vardi
20:00-21:30
Panel: Fahiem Baachus, David Dill, and Robert Givan
What Did We Learn?