Announcement

The annual GAMES-Meeting 2005 was be held in Paris, September 21 — 24. The scientific programme consisted of contributed talks on the research tasks of the GAMES network and three invited tutorials.

Invited Tutorials

• Mihalis Yannakakis Testing, Optimization, and Games
• Hubert Comon-Lundh Automatic Verification of Cryptographic Protocols
• Marcin Jurdzinski Algorithms for Solving Stochastic Games

Programme

Wednesday, 21 September
9:00	–	9:15	Anca Muscholl	Welcome to GAMES 05
9:15	–	10:45	Hubert Comon	Automatic verification of cryptographic protocols
10:45	–	11:15		Coffee break
11:15	–	11:45	Olivier Serre	Regularity problems for visibly pushdown languages
11:45	–	12:15	Damian Niwinski	Unsafe grammars and panic automata
12:15	–	12:30	Christof Löding	Propositional dynamic logic with recursive programs
12:30	–	14:00		Lunch
14:00	–	14:30	Erich Grädel	Entanglement -- a measure for the complexity of directed graphs with applications to logic and games
14:30	–	15:00	Paul Hunter	DAG-width -- Cops and robbers on directed graphs
15:00	–	15:30	Jan Obdrzalek	DAG-width -- Connectivity measure for directed graphs
15:30	–	16:00		Coffee break
16:00	–	16:30	Jacques Duparc	An omega-power of a finite context-free language which is Borel of infinite rank
16:30	–	16:45	Filip Murlak	Games for the Wadge hierarchy of deterministic tree languages
16:45	–	17:00	Olivier Finkel	On winning conditions of high Borel complexity in pushdown games
17:00	–	17:15	Sandra Quickert	Transfinite extension of the mu-calculus
17:30	–	19:00		Steering Committee meeting
Thursday, 22 September
9:00	–	10:30	Marcin Jurdzinski	Stochastic games
10:30	–	11:00		Coffee break
11:00	–	11:30	Moshe Vardi	Safraless decision procedures
11:30	–	12:00	Gregoire Sutre	Flat counter automata almost everywhere
12:00	–	12:30	Henrik Bjorklund	Linear complementarity methods for infinite games
12:30	–	14:00		Lunch
14:00	–	14:30	Francois Laroussine	Modal logics for timed control
14:30	–	15:00	Julien Bernet	From distributed games to synchronous distributed games
15:00	–	15:15	Blaise Genest	On the implementation of global concurrent systems with local asynchronous controllers, towards distributed games
15:15	–	15:30	Philipp Rohde	Games and logics over dynamically changing structures
15:30	–	16:00		Coffee break
16:00	–	16:30	Thomas Brihaye	On optimal timed strategies
16:30	–	17:00	Slawomir Lasota	Alternating timed automata
17:00	–	17:15	Olga Grinchtein	Inference of event-recording automata
17:15	–	17:30	Pavel Krcal	On sampled semantics of timed systems
20:00				Joint dinner
Friday, 23 September
9:00	–	10:30	Mihalis Yannakakis	Testing, optimization and games
10:30	–	11:00		Coffee break
11:00	–	11:30	Helmut Veith	Environment abstraction for parameterized verification
11:30	–	12:00	Igor Walukiewicz	Idealized Algol with ground recursion and DPDA equivalence
12:00	–	12:30	Ranko Lazic	Data-abstraction refinement: A game semantic approach
12:30	–	14:00		Lunch
14:00	–	14:30	Antoine Meyer	Infinite automata for context-sensitive languages
14:30	–	15:00	Sibylle Froeschle	Decomposition and complexity of hereditary history preserving bisimulation on BPP
15:00	–	15:15	Jérémie Chalopin	Rendez-vous and election in a Babel world
15:15	–	15:30	Eryk Kopczynski	Half-positionally determined winning conditions in infinite games
15:30	–	16:00		Coffee break
16:00	–	16:30	Thomas Colcombet	Extending omega-regularity with bounds
16:30	–	17:00	Mikolaj Bojanczyk	Unranked tree algebra
17:00	–	17:15	Severine Fratani	Regular sets over tree-structures
17:15	–	17:30	Michal Ceresna	Wrapper learning and games played on trees
17:30	–	17:45	Deian Tabakov	Experimental evaluation of classical automata constructions
Saturday, 24 September
9:00	–	9:30	Wieslaw Zielonka	From one-person games to two-person antagonistic games
9:30	–	10:00	Dietmar Berwanger	Iterated admissibility in omega-regular games
10:00	–	10:30	Anca Muscholl	Two-variable logic with data
10:30	–	10:45	Vince Barany	On intrinsic regularity in automatic structures
10:45	–	11:15		Coffee break
11:15	–	11:30	Michael Ummels	Rational behaviour and strategy construction in infinite multiplayer games
11:30	–	11:45	Florian Horn	Streett games on finite graphs
11:45	–	12:00	Jan Henrik Altenbernd	Reachability over bifix systems
12:00	–	12:15	Jeremie Cabessa	Constructing the algebraic counterpart of the Wagner hierarchy by way of games
12:15	–	12:30	Anca Muscholl	Closing of GAMES 2004

Organisers

General steering committee

• Erich Grädel (Aachen)
• Wolfgang Thomas (Aachen)
• David Janin (Bordeaux)
• Igor Walukiewicz (Bordeaux)
• Julian Bradfield (Edinburgh)
• Anca Muscholl (Paris)
• Jean-Eric Pin (Paris)
• Moshe Vardi (Rice)
• Bengt Jonsson (Uppsala)
• Georg Gottlob (Vienna)
• Jerzy Tyszkiewicz (Warsaw)
• Damian Niwinski (Warsaw)

Local organizing committee

• Anca Muscholl (chair)
• Mikolaj Bojanczyk
• Thierry Cachat
• Irene Guessarian
• Hugo Gimbert
• Luc Segoufin