Announcement

The annual GAMES-Meeting 2004 was held in Bordeaux, September 15 — 18. The scientific programme consisted of contributed talks on the research tasks of the GAMES network and four invited tutorials:

Invited Tutorials

• Tom Henzinger Applications of Games in System Design and Verification
• Marcin Jurdzinski Stochastic games
• Victor Vianu Formal verification of data-centric Web services
• Berthold Vöcking Selfish routing and congestion games: towards a game-based analysis of the Internet

Programme

Wednesday, 15 September
9:00	–	9:05	David Janin	Welcome to GAMES 04
9:05	–	9:20	Maria Georgiadou (European Commission)	Introduction by the Program Officer
9:20	–	10:00	Erich Grädel	Co-ordinator's Report
10:00	–	10:20		Coffee break
10:20	–	10:45	Thomas Colcombet	Characterising memoryless winning conditions
10:45	–	11:10	Christof Löding	Visibly Pushdown Games
11:10	–	11:25	Michal Ceresna	On efficient wrappers learning from games played on trees
11:25	–	11:35		Break
11:35	–	12:00	Mikolaj Bojanczyk	Tree-Walking Automata Cannot Be Determinized
12:00	–	12:25	Pavel Krcal	Timed vs. Time-Triggered Automata
12:25	–	12:40	Martin Leucker	Probablistic Controller Synthesis
12:40	–	14:15		Lunch break
14:15	–	17:30		Midterm Review Meeting
Thursday, 16 September
9:00	–	10:30	Marcin Jurdzinski	Stochastic games
10:30	–	11:00		Coffee break
11:00	–	11:30	Bruno Courcelle	Recognizability and Hypergraph Operations Using Local Information
11:30	–	12:00	Achim Blumensath	A Pumping Lemma for Higher-Order Pushdown Automata
12:00	–	12:30	Luigi Santocanale	A Representation Theorem for the Modal mu-Calculus
12:30	–	14:00		Lunch break
14:00	–	14:15	Lukasz Kaiser	Game reductions and finite appearance records for infinite games
14:15	–	14:30	Jeremie Cabessa	Games on Semigroups
14:30	–	14:45	Michael Luttenberger	Model Checking Pushdown Systems Weighted by Finite Automata
14:45	–	15:00	Henrik Bjorklund	The controlled linear programming problem
15:00	–	15:15	Hugo Gimbert	When can you play positionally?
15:15	–	15:30	Thomas Wilke	Synthesis from Knowledge-Based Specifications
15:30	–	15:45	Marc Zeitoun	Distributed games with causal memory
15:45	–	16:00	Marielle Stoelinga	Fully symmetric timed games
16:00	–	16:30		Coffee break
16:30	–	17:00	Jonathan Panttaja	On the complexity of pebble games
17:00	–	17:30	Luke Ong and Jolie Gracia de Miranda	Safety is not a restriction at level 2 for string languages
17:30	–	18:00	Dietmar Berwanger	The variable hierarchy of the mu-calculus is strict
19:00				Joint dinner with jazz
Friday, 17 September
9:00	–	10:30	Victor Vianu	Formal verification of data-centric Web services
10:30	–	11:00		Coffee break
11:00	–	11:30	Sergei Vorobyov	A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff Games
11:30	–	12:00	Damian Niwinski	Deciding Nondeterministic Hierarchy of Deterministic Tree Automata
12:00	–	12:30	David Janin	Bisimulation invariance in the finite - from Charybde to Scylla
12:30	–	14:00		Lunch break
14:00	–	15:30	Tom Henzinger	Applications of Games in System Design and Verification
15:30	–	16:00		Coffee break
16:00	–	16:30	Sibylle Froeschle	Hereditary history preserving bisimilarity on live free-choice systems
16:30	–	17:00	Luc Segoufin	First-order definable regular tree properties
17:00	–	17:15	Paul Hunter	Complexity of infinite games on finite graphs
17:15	–	17:30	Stephan Kreutzer	Backtracking games
17:30	–	17:45	Antoine Meyer	Symbolic Reachability Analysis of Higher-Order Context-Free Processes
17:45	–	18:00	Marcin Rychlik	Probabilistic Quantified Satisfiability
Saturday, 18 September
9:00	–	10:30	Berthold Vöcking	Selfish routing and congestion games: towards a game-based analysis of the Internet
10:30	–	11:00		Coffee break
11:00	–	11:30	Olivier Serre	Games With Winning Conditions of High Borel Complexity
11:30	–	12:00	Ralf Küsters	Deciding Crytographic Protocols with Game-Theoretic Security Requirement
12:00	–	12:30	Benjamin McMahan	From Pebble Games to Query Optimization
12:30	–	14:00		Lunch break
14:00	–	14:30	Olga Grinchtein	Learning of Event-Recording Automata
14:30	–	15:00	Pritha Mahata	Multi-Clock Timed Networks
15:00	–	15:30	Marcin Peczarski	A Game Model for Multi-Party Communication of Computation on Noisy Channels
15:30			David Janin	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

• David Janin (chair)
• Igor Walukiewicz (co-chair)
• Olivier Ly
• Julien Bernet
• Alexis-Julien Bouquet
• Xavier Briand