Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Theory of hybrid systems and discrete event systems
Theory of hybrid systems and discrete event systems
Languages, automata, and logic
Handbook of formal languages, vol. 3
Strategy Construction in Infinite Ganes with Streett and Rabin Chain Winning Conditions
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Small Progress Measures for Solving Parity Games
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A Discrete Strategy Improvement Algorithm for Solving Parity Games
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
On Model-Checking for Fragments of µ-Calculus
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Timed Control Synthesis for External Specifications
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Solving parity games by a reduction to SAT
Journal of Computer and System Sciences
| Hi-index | 0.00 |
An implementation of a recent algorithm (Vöge, Jurdziński, to appear in CAV 2000) for the construction of winning strategies in infinite games is presented. The games under consideration are "finite-state parity games", i.e. games over finite graphs where the winning condition is inherited from ω-automata with parity acceptance. The emphasis of the paper is the development of a user interface which supports the researcher in case studies for algorithms of ω-automata theory. Examples of such case studies are provided which might help in evaluating the (so far open) asymptotic runtime of the presented algorithm.