DRAFT PROGRAM FOR AMETIST PROJECT MEETING IN MUNICH

Monday December 1
=================

9.00 Opening

9.15 Resource-Optimal Scheduling Using Priced Timed Automata
Jacob Illum

10.00 Computing Response Time of Large Acyclic Automata Using Abstraction
Oded Maler

10.30 Lower and Upper Bounds in Zone Based Abstractions of Timed Automata
Kim Larsen

11.00 COFFEE BREAK

11.30 Updates on Partial 0rder Semantics for Timed Automata,
Presentation of Else tool
Peter Niebert

12.00 Scheduling and Partial Order Methods
Yasmina Abdeddaim

12.30 LUNCH

14.00
Stochastic Evaluation of Schedules in MODEST for the First AXXOM Case Study
Yaroslav Usenko

14.30
Relaxation-Guided Search for Timed Automata: First Experimental Results
Sebastian Panek

15.00 TBA

15.00 COFFEE BREAK

16.00
Multi Target Optimization with Branch and Bound
Dirk Surholt

16.30
Timed Automata for Dummies
Oded Maler

17.00
Tools and Application of Timed Automata
Gerd Behrmann

17.30
Timed Automata: Industrial Applications, Vision
Sebastian Engell

18.00 Departure for Dinner


Tuesday December 2
==================
9.00 PCC Meeting

10.00 Bounded Model Checking
Wojtek Penczek / Andrzej Zbrzezny

11.00 COFFEE BREAK

11.30 On Cyclic Plans for Scheduling a Smart Card Personalisation System
Tim Nieberg

12.00 New Challenges for the Cybernetix Case Study
Mathieu Agopian/ Peter Niebert

12.30 LUNCH

14.00 Characterization of Safe States in Manufacturing Systems using SMV
Martijn Hendriks

14.20 Scheduling under Discrete Uncertainty and Shortest Paths in AND/OR Graphs
Oded Maler and Karim Kerbaa

15.00 END OF MEETING