Implementation of a Strategy Improvement Algorithm for Finite-State Parity Games

@inproceedings{Schmitz2000ImplementationOA,
  title={Implementation of a Strategy Improvement Algorithm for Finite-State Parity Games},
  author={Dominik Schmitz and Jens V{\"o}ge},
  booktitle={CIAA},
  year={2000}
}
An implementation of a recent algorithm (Voge, Jurdzinski, 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… 

Strategien in unendlichen Spielen mit Liveness-Gewinnbedingungen: Syntheseverfahren, Optimierung und Implementierung

In this thesis we develop methods for the solution of infinite games and present implementations of corresponding algorithms in the framework of a platform for the experimental study of automata

Solving parity games by a reduction to SAT

An experimental study of algorithms and optimisations for parity games, with an application to

TLDR
The practical use of various optimisation techniques for solving parity games is investigated, showing that decomposition into strongly connected components and applying efficient algorithms for special cases are highly beneficial and the theoretic dependency on the number of priorities manifests itself in practice.

Timed Control Synthesis for External Specifications

TLDR
The problem of control synthesis for a timed plant and an external timed specification, modelled as timed automata is studied and it is shown that for deterministic specifications, if there is a controller at all, then there is one which uses the combined resources of the plant and specification.

SOLVING BOOLEAN EQUATION SYSTEMS

TLDR
An approach to solve a general form Boolean equation system, which simplifies the process of finding the solution by dividing the system into more simple subsystems and solving these by optimized procedures, is introduced and analyzed.

Techniques for solving Boolean equation systems

TLDR
This thesis presents a general framework that allows for dividing Boolean equation systems into individual blocks and solving these blocks in isolation with special techniques, and gives a translation of the problem of solving a general form Boolean equation system into the issue of finding a stable model of a logic program.

A Bibliography of Papers in Lecture Notes in Computer Science (2003) (Part 1 of 4)

(2 + ε) [?]. (2) [?]. + [?, ?]. {0, ∗, 1} [?]. 0, 1 [?]. 0− 1 [?, ?]. 1 [?, ?]. 2 [?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?]. 2 [?]. 3 [?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?,

Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications

TLDR
A method to solve certain infinite games over finite state spaces and apply this for the automatic synthesis of finitestate controllers and a theoretical solution which synthesizes a finite-state controller for satisfiable specifications is sketched.

A Discrete Strategy Improvement Algorithm for Solving Parity Games

A discrete strategy improvement algorithm is given for constructing winning strategies in parity games, thereby providing also a new solution of the model-checking problem for the modal μ-calculus.

References

SHOWING 1-8 OF 8 REFERENCES

Strategy Construction in Infinite Ganes with Streett and Rabin Chain Winning Conditions

TLDR
An algorithm is presented which solves the problem of program synthesis for finite-state games with Streett winning condition by developing an inductive strategy construction over Rabin chain automata which yields finite automata that realize winning strategies.

Infinite Games Played on Finite Graphs

Tree automata, mu-calculus and determinacy

  • E. EmersonC. Jutla
  • Mathematics, Computer Science
    [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science
  • 1991
TLDR
It is shown that the propositional mu-calculus is equivalent in expressive power to finite automata on infinite trees, which provides a radically simplified, alternative proof of M.O. Rabin's (1989) complementation lemma for tree automata, which is the heart of one of the deepest decidability results.

On Model-Checking for Fragments of µ-Calculus

TLDR
It is shown that the logic L2 is as expressive as ECTL* given in [13], and the model checking problem for the μ-calculus is equivalent to the non-emptiness problem of parity tree automata.

Theory of hybrid systems and discrete event systems

  • A. Puri
  • Mathematics, Computer Science
  • 1996
TLDR
It is shown that for hybrid automata with rectangular inclusions, the reachability question can be answered in a finite number of steps and that an $\omega$-automata game with the chain acceptance condition can be solved as a mean payoff game.

Languages, Automata, and Logic

  • W. Thomas
  • Computer Science
    Handbook of Formal Languages
  • 1997
The subject of this chapter is the study of formal languages (mostly languages recognizable by finite automata) in the framework of mathematical logic.

A Discrete Strategy Improvement Algorithm for Solving Parity Games

A discrete strategy improvement algorithm is given for constructing winning strategies in parity games, thereby providing also a new solution of the model-checking problem for the modal μ-calculus.

Small Progress Measures for Solving Parity Games

TLDR
A new algorithm for deciding the winner in parity games, and hence also for the modal µ-calculus model checking, based on a notion of game progress measures, characterized as pre-fixed points of certain monotone operators on a complete lattice.