GAMES logo Nodes: Bordeaux
Aachen Bordeaux Edinburgh Paris Rice Uppsala Warsaw Vienna

Task 1: Minimizing automata and simplifying games


Algorithms for minimizing automata preserving their infinite behaviour will be designed and analysed. An algebraic approach to automata on (game) trees will be developed, modular and hierarchical decomposition of games, and methods for simplifying games will be studied. To make automata-based methods more practical, efficient on-the-fly constructions of automata will be developed.


Background literature

[1] R. Alur, T. A. Henzinger, O. Kupferman, and M. Y. Vardi, Alternating refinement relations, in International Conference on Concurrency Theory, pp. 163-178, 1998.
[ .ps.gz ]

This file has been generated by bibtex2html 1.56