Handbook of theoretical computer science (vol. B)
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Liveness in timed and untimed systems
Information and Computation
Deciding the winner in parity games is in UP ∩ co-UP
Information Processing Letters
Automata-Theoretic Decision of Timed Games
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Modularity for Timed and Hybrid Systems
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
On Model-Checking for Fragments of µ-Calculus
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Efficient on-the-fly algorithms for the analysis of timed games
CONCUR 2005 - Concurrency Theory
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Invited contribution: sociable interfaces
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Optimal strategies in priced timed game automata
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
A Multi-Core Solver for Parity Games
Electronic Notes in Theoretical Computer Science (ENTCS)
Solving μ-Calculus Parity Games by Symbolic Planning
Model Checking and Artificial Intelligence
Timed I/O automata: a complete specification theory for real-time systems
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
A hybrid algorithm for LTL games
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
ECDAR: an environment for compositional design and analysis of real time systems
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Methodologies for specification of real-time systems using timed I/O automata
FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
Generalized rabin(1) synthesis with applications to robust system synthesis
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Robustness in the presence of liveness
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Synchronous interface theories and time triggered scheduling
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
| Hi-index | 0.00 |
Three-color parity games capture the disjunction of a Büchi and a co-Büchi condition. The most efficient known algorithm for these games is the progress measures algorithm by Jurdzinski. We present an acceleration technique that, while leaving the worst-case complexity unchanged, often leads to considerable speed-ups in games arising in practice. As an application, we consider games played in discrete real time, where players should be prevented from stopping time by always choosing moves with delay zero. The time progress condition can be encoded as a three-color parity game. Using the tool TICC as a platform, we compare the performance of a BDD-based symbolic implementation of the progress measure algorithm with acceleration, and of the symbolic implementation of the classical µ-calculus algorithm of Emerson and Jutla.