Announcement

The 2003 Annual Meeting of the RTN "Games and Automata for Synthesis and Validation" was held in Vienna, adjacent to CSL 03. On Saturday, 30th August there were joint events of CSL and GAMES, such as tutorials by Igor Walukiewicz and Ahmed Bouajjani, and an invited talk by Helmut Veith.

Invited Tutorials

• Ahmed Bouajjani Verification of Infinite State Systems
• Igor Walukiewicz Winning Strategies and Synthesis of Controllers
• Helmut Veith Friends or Foes? Communities in Software Verification

Programme

Saturday, 30 August (Joint Day with CSL)
9:00	–	9:15	Erich Grädel	Opening of GAMES 03
9:15	–	11:25	Ahmed Bouajjani	Verification of Infinite State Systems - Tutorial
11:25	–	11:55		Coffee Break
11:55	–	12:25	Krishnendu Chatterjee, Thomas A. Henzinger, and Marcin Jurdzinski:	Simple stochastic parity games
12:25	–	12:55	Parosh Aziz Abdulla, Ahmed Bouajjani, Julien d'Orso	Deciding Monotonic Games
12:55	–	13:00		Break
13:00	–	13:30	Jacques Duparc	Positive Games and Persistent Strategies
13:30	–	15:00		Lunch Break
15:00	–	17:00	Igor Walukiewicz	Winning Strategies and Synthesis of Controllers - Tutorial
17:00	–	17:45		Coffee Break
17:45	–	18:45	Helmut Veith	Friends or Foes? Communities in Software Verification - Invited Talk
18:45	–	19:00	Matthias Baaz	Closing of CSL
Sunday, 31 August
9:00	–	10:00	Thomas Wilke	Minimizing Automata on Infinite Words (Part 1) - Tutorial
10:00	–	10:30		Coffee break
10:30	–	11:00	Thomas Wilke	Minimizing Automata on Infinite Words (Part 2) - Tutorial
11:45	–	11:55	David Janin	Report on Task 1: Minimizing automata and simplifying games
12:00	–	12:30	Georg Gottlob	Pure Nash Equilibria: Hard and Easy Games
12:30	–	14:00		Lunch
14:00	–	14:10	Wolfgang Thomas	Report on Task 2: Algorithmic analysis of parity games
14:15	–	14:45	Stephan Kreutzer	Determinacy, Definability, and Complexity of Path Games
14:45	–	15:15	Luc Segoufin	Context-Free Games
15:20	–	15:30	Bengt Jonsson	Report on Task 3: Synthesis and testing for reactive computation
15:30	–	16:00		Coffe break
16:00	–	16:15	Therese Berg	Insights to Angluins's Learning
16:15	–	16:30	Thierry Cachat	Higher Order Pushdown Automata, the Caucal Hierarchy of Graphs, and Parity Games
16:30	–	16:45	Henrik Bjoerklund	Combinatorial Structure of Strategy Evaluation in Infinite Games
16:45	–	17:00	Sven Sandberg	Randomized Combinatorial Optimization for Games
17:00	–	17:15		Coffee break
17:15	–	17:30	Jan Obdrzalek	Polynomial-time algorithm for parity games when tree-width is bounded
17:30	–	17:45	Christof Löding	Computing Merciful Strategies in One-Pair Streett-Games
17:45	–	18:00	Rafal Somla	Coin Games and Parity Games
Monday, 1 September
9:00	–	9:10	Anca Muscholl	Report on Task 4: Analysis techniques for infinite-state systems
9:15	–	9:45	Olga Grichtein and Martin Leucker	Network Invariants for Real Time Systems
9:45	–	10:15	Marc Zeitoun	Distributed games and applications
10:15	–	10:45		Coffee break
10:45	–	10:55	Georg Gottlob	Report on Task 8: Automata and query languages for semistructured data
11:00	–	11:30	Doron Bustan	Reset vs Abort in Linear Temporal Logic
11:30	–	12:00	Luke Ong	Game semantics: from structures to algorithmics
12:00	–	12:15	Nir Piterman	Enhanced Vacuity Detection in Linear Temporal Logic
12:15	–	12:30	Hugo Gimbert	Solving games on pushdown graphs associated to boolean combinations of parity and explosion winning conditions
12:30	–	14:00		Lunch
14:00	–	14:15	Severine Fratani	Iterated pushdown automata and sequences of rational numbers
14:15	–	14:30	Alexis-Julien Bouquet	Pushdown Games and the Bounded Stack Condition
14:30	–	14:45	Aymeric Vincent	Model checking with an expressive logic
14:45	–	15:00	Tayssir Touili	Reachability Analysis of Process Rewrite Systems: Application to the Symbolic Verification of Multithreaded Programs with Recursive Procedure Call
15:00	–	15:15	Jennifer Tenzer	Games and UML
15:30	–	16:00		Coffee break
16:00	–	16:10	Jerzy Tyszkiewicz	Report on Task 6: Game models for protocols
16:15	–	16:45	Andre Arnold	On ambiguous classes in the mu-calculus hierarchy of tree languages
Tuesday, 2 September
9:00	–	9:15	Julian Bradfield	Report on Task 7: Logics, games, and efficient query evaluation
9:15	–	9:45	Jerzy Tyszkiewicz	On the Semijoin Algebra
9:45	–	10:15	Moshe Vardi	Report on Task 5: Linear-time model checking
10:00	–	10:30	Christoph Koch	Arb: An Implementation for Selecting Tree Automata for XML Query Processing
10:15	–	10:45		Coffee break
11:00	–	11:15	Mikolaj Bojanczyk	1-bounded TWAs cannot be determinized
11:15	–	11:30	Michal Ceresna	Learning wrappers from games played on trees
11:30	–	11:45	Daniel Ford	Generalized Satisfiability with k Occurrences per Variable: A Study through Delta-Matroid Parity
11:45	–	12:00	Philipp Rohde	Sabotage Game and Sabotage Modal Logic
12:00	–	12:15	Marcin Rychlik	On Probabilistic Quantified Satisfiability Games
12:15	–	12:30	Marcin Peczarski	Game Model for Communication on Noisy Channel
12:30	–	14:00		Lunch
14:00	–	15:00	Thomas Schwentick	Tree Automata and Semistructured Data (Part 1) - Tutorial
12:30	–	14:00		Coffee Break
15:30	–	16:30	Thomas Schwentick	Tree Automata and Semistructured Data (Part 2) - Tutorial
16:30			Erich Grädel	Closing of Games

Organisers

• Georg Gottlob (Vienna)
• Erich Grädel (Aachen)