Dagstuhl Seminar 01451 on Exploration of Large State Spaces



Monday, Nov. 5, 2001

07:30-08:45 breakfast
Chair: Moshe Y. Vardi
08:45-09:00 Welcome and Introductions
09:00-10:00
David Dill (Stanford University)
Verification Tutorial: Explicit Search
10:00-11:00
Fabio Somenzi (University of Colorado)
Verification Tutorial: Implicit Search
11:00-11:30 coffee break
11:30-12:15
Wolfgang Thomas (RWTH AAchen)
Algorithmic Results in Infinite Automata Theory
12:15-14:00 lunch break
Chair: David Dill
14:00-14:40
Prasad Sistla (University of Illinois, Chicago)
Symmetry Reductions
14:40-15:20
David Basin (Freiburg University)
Exploration of Large State Spaces using Monadic Logics, Automata, BDDs, and SAT Solvers
15:20-16:00
Javier Esparza (Edinburgh University)
An Unfolding Approach to exploring State Spaces of Concurrent Systems
16:00-16:30 coffee break
Chair: David Dill
16:30-17:15
Pierre Wolper (University of Liege)
Exploring Infinite State Spaces with Finite Automata
17:15-18:00
Orna Kupferman (Hebrew University)
Exploring Infinite State Spaces with Tree Automata
18:00 dinner