Infinite games on finitely coloured graphs with applications to automata on infinite trees
Theoretical Computer Science
Strategy Construction for Parity Games with Imperfect Information
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Qualitative Concurrent Stochastic Games with Imperfect Information
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Strategy construction for parity games with imperfect information
Information and Computation
Synthesis of fault-tolerant embedded systems using games: from theory to practice
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Antichain algorithms for finite automata
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Fairness in non-repudiation protocols
STM'11 Proceedings of the 7th international conference on Security and Trust Management
Hi-index | 0.00 |
Alpaga is a solver for two-player parity games with imperfect information. Given the description of a game, it determines whether the first player can ensure to win and, if so, it constructs a winning strategy. The tool provides a symbolic implementation of a recent algorithm based on antichains.