An automata theoretic decision procedure for the propositional mu-calculus
Information and Computation
On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Progress measures for complementation of &ohgr;-automata with applications to temporal logic
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The complexity of mean payoff games on graphs
Theoretical Computer Science
Fast and simple nested fixpoints
Information Processing Letters
An improved algorithm for the evaluation of fixpoint expressions
Theoretical Computer Science
Weak alternating automata and tree automata emptiness
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Infinite games on finitely coloured graphs with applications to automata on infinite trees
Theoretical Computer Science
Deciding the winner in parity games is in UP ∩ co-UP
Information Processing Letters
Fully Local and Efficient Evaluation of Alternating Fixed Points (Extended Abstract)
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
On Model-Checking for Fragments of µ-Calculus
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Pushdown Processes: Games and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
The complexity of tree automata and logics of programs
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Automata and Games for Synthesis
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
A Discrete Subexponential Algorithm for Parity Games
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
A Hierarchy of Polynomial-Time Computable Simulations for Automata
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
State Space Reductions for Alternating Büchi Automata
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Implementation of a Strategy Improvement Algorithm for Finite-State Parity Games
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Trading Probability for Fairness
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
On the Variable Hierarchy of the Modal µ-Calculus
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Controller Synthesis with Budget Constraints
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
25 Years of Model Checking
A CSP-Based Approach for Solving Parity Game
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
The Descriptive Complexity of Parity Games
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Timed Parity Games: Complexity and Robustness
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
LTL Generalized Model Checking Revisited
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Algorithms for Solving Infinite Games
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Games on Multi-stack Pushdown Systems
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Solving μ-Calculus Parity Games by Symbolic Planning
Model Checking and Artificial Intelligence
On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
An Automata-Theoretic Approach to Regular XPath
DBPL '09 Proceedings of the 12th International Symposium on Database Programming Languages
Games on Higher Order Multi-stack Pushdown Systems
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Solving Parity Games in Practice
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
A Solver for Modal Fixpoint Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Information and Computation
Automata for coalgebras: an approach using predicate liftings
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Synthesis of live behaviour models
Proceedings of the eighteenth ACM SIGSOFT international symposium on Foundations of software engineering
Synthesis of trigger properties
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems
Information and Computation
Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems
Information and Computation
Bisimulation minimisations for boolean equation systems
HVC'09 Proceedings of the 5th international Haifa verification conference on Hardware and software: verification and testing
Faster algorithms for mean-payoff games
Formal Methods in System Design
Qualitative concurrent parity games
ACM Transactions on Computational Logic (TOCL)
Stuttering mostly speeds up solving parity games
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Does it pay to extend the perimeter of a world model?
FM'11 Proceedings of the 17th international conference on Formal methods
Logic and games on automatic structures: playing with quantifiers and decompositions
Logic and games on automatic structures: playing with quantifiers and decompositions
Automated distributed implementation of component-based models with priorities
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Two variable vs. linear temporal logic in model checking and games
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Rational behaviour and strategy construction in infinite multiplayer games
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
An O(n2) time algorithm for alternating Büchi games
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On the µ-calculus augmented with sabotage
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Semi-automatic distributed synthesis
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
A survey of stochastic ω-regular games
Journal of Computer and System Sciences
Solving parity games by a reduction to SAT
Journal of Computer and System Sciences
Solving games without determinization
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Satisfiability and finite model property for the alternating-time µ-calculus
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
A subexponential lower bound for the random facet algorithm for parity games
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Fixpoint logics on hierarchical structures
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Safraless compositional synthesis
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Minimizing generalized büchi automata
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Robustness in the presence of liveness
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Synthesis of Reactive(1) designs
Journal of Computer and System Sciences
Simulation relations for alternating parity automata and parity games
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Finitary winning in ω-regular games
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Recent challenges and ideas in temporal synthesis
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
RV'11 Proceedings of the Second international conference on Runtime verification
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Security-by-contract: toward a semantics for digital signatures on mobile code
EuroPKI'07 Proceedings of the 4th European conference on Public Key Infrastructure: theory and practice
Entanglement and the complexity of directed graphs
Theoretical Computer Science
A cure for stuttering parity games
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
Concurrent small progress measures
HVC'11 Proceedings of the 7th international Haifa Verification conference on Hardware and Software: verification and testing
The rabin index of parity games
HVC'11 Proceedings of the 7th international Haifa Verification conference on Hardware and Software: verification and testing
Synthesizing nonanomalous event-based controllers for liveness goals
ACM Transactions on Software Engineering and Methodology (TOSEM)
Fatal attractors in parity games
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
An overview of the mCRL2 toolset and its recent advances
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A superpolynomial lower bound for strategy iteration based on snare memorization
Discrete Applied Mathematics
Optimal bounds in parametric LTL games
Theoretical Computer Science
GOAL for games, omega-automata, and logics
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
A constraint-based approach to solving games on infinite graphs
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Alternating traps in Muller and parity games
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper we develop a new algorithm for deciding the winner in parity games, and hence also for the modal µ-calculus model checking. The design and analysis of the algorithm is based on a notion of game progress measures: they are witnesses for winning strategies in parity games. We characterize game progress measures as pre-fixed points of certain monotone operators on a complete lattice. As a result we get the existence of the least game progress measures and a straightforward way to compute them. The worst-case running time of our algorithm matches the best worst-case running time bounds known so far for the problem, achieved by the algorithms due to Browne et al., and Seidl. Our algorithm has better space complexity: it works in small polynomial space; the other two algorithms have exponential worst-case space complexity.