Infinite games on finitely coloured graphs with applications to automata on infinite trees
Theoretical Computer Science
On model checking for the &mgr;-calculus and its fragments
Theoretical Computer Science
Pushdown processes: games and model-checking
Information and Computation - Special issue on FLOC '96
Topological properties of omega context-free languages
Theoretical Computer Science
A Discrete Strategy Improvement Algorithm for Solving Parity Games
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
An Automata-Theoretic Approach to Reasoning about Infinite-State Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Infinite Games and Verification (Extended Abstract of a Tutorial)
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Optimal Complexity Bounds for Positive LTL Games
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Solving Pushdown Games with a Sigma3 Winning Condition
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Note on winning positions on pushdown games with ω-regular conditions
Information Processing Letters
Games for synthesis of controllers with partial observation
Theoretical Computer Science - Logic and complexity in computer science
On Effective Methods for Diagnosis of Retaining Faults in Circuits
Fundamenta Informaticae
On Winning Conditions of High Borel Complexity in Pushdown Games
Fundamenta Informaticae
| Hi-index | 0.00 |
We first consider infinite two-player games on pushdown graphs. In previous work, Cachat et al. [Solving pushdown games with a Σ3-winning condition, in: Proc. 11th Annu. Conf. of the European Association for Computer Science Logic, CSL 2002, Lecture Notes in Computer Science, Vol. 2471, Springer, Berlin, 2002, pp. 322-336] have presented a winning decidable condition that is Σ3-complete in the Borel hierarchy. This was the first example of a decidable winning condition of such Borel complexity. We extend this result by giving a family of decidable winning conditions of arbitrary finite Borel complexity. From this family, we deduce a family of decidable winning conditions of arbitrary finite Borel complexity for games played on finite graphs. The problem of deciding the winner for these conditions is shown to be non-elementary.