STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Weak alternating automata and tree automata emptiness
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Weak alternating automata are not that weak
ACM Transactions on Computational Logic (TOCL)
Quantitative solution of omega-regular games380872
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Information and Computation
Monadic second-order logic on tree-like structures
Theoretical Computer Science
A linear time special case for MC Games
Fundamenta Informaticae
Games and Model Checking for Guarded Logics
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Symbolic Strategy Synthesis for Games on Pushdown Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Two-Way Alternating Automata and Finite Models
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A Discrete Subexponential Algorithm for Parity Games
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Fate and Free Will in Error Traces
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Small Progress Measures for Solving Parity Games
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Lifting Temporal Proofs through Abstractions
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
The Control of Synchronous Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Symbolic Algorithms for Infinite-State Games
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
The Finite Graph Problem for Two-Way Alternating Automata
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
On the Complexity of Parity Word Automata
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
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 '01 Proceedings of the 13th International Conference on Computer Aided Verification
Model Checking Linear Properties of Prefix-Recognizable Systems
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Fixpoint Alternation and the Game Quantifier
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
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
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
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Probabilistic Linear-Time Model Checking: An Overview of the Automata-Theoretic Approach
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
From bidirectionality to alternation
Theoretical Computer Science - Mathematical foundations of computer science
Note on winning positions on pushdown games with ω-regular conditions
Information Processing Letters
Journal of Automata, Languages and Combinatorics - Selected papers of the workshop on logic and algebra for concurrency
The finite graph problem for two-way alternating automata
Theoretical Computer Science - Foundations of software science and computation structures
Convertibility verification and converter synthesis: two faces of the same coin
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Relating word and tree automata
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Modal Mu-Calculus for Durational Transition Systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Concurrent Omega-Regular Games
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
The description logic handbook
Automata logics, and infinite games
Mu-depth 3 is more than 2: a game-theoretic proof
Mathematical Structures in Computer Science
Memoryless determinacy of parity and mean payoff games: a simple proof
Theoretical Computer Science
Quantitative stochastic parity games
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Quantitative solution of omega-regular games
Journal of Computer and System Sciences - STOC 2001
Improving Ariadne's Bundle by Following Multiple Threads in Abstraction Refinement
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Towards the hierarchical verification of reactive systems
Theoretical Computer Science - Logic, semantics and theory of programming
Simulation relations for alternating Büchi automata
Theoretical Computer Science
On reasoning about structural equality in XML: a description logic approach
Theoretical Computer Science - Database theory
Games in system design and verification
TARK '05 Proceedings of the 10th conference on Theoretical aspects of rationality and knowledge
A decidable class of problems for control under partial observation
Information Processing Letters
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Games where you can play optimally without any memory
CONCUR 2005 - Concurrency Theory
A deterministic subexponential algorithm for solving parity games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The complexity of quantitative concurrent parity games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A fixpoint calculus for local and global program flows
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the universal and existential fragments of the μ-calculus
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
On the positional determinacy of edge-labeled games
Theoretical Computer Science
Automata and fixed point logic: a coalgebraic perspective
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Combinatorial structure and randomized subexponential algorithms for infinite games
Theoretical Computer Science
The alternation hierarchy in fixpoint logic with chop is strict too
Information and Computation
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
Discrete Applied Mathematics
Theoretical Computer Science - Components and objects
The NP-completeness column: Finding needles in haystacks
ACM Transactions on Algorithms (TALG)
Complexity results on branching-time pushdown model checking
Theoretical Computer Science
Efficient static analysis of XML paths and types
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
When not losing is better than winning: Abstraction and refinement for the full μ-calculus
Information and Computation
Theoretical Computer Science
Continuous Separation of Game Languages
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
Modular Games for Coalgebraic Fixed Point Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Cyclic games and linear programming
Discrete Applied Mathematics
An Incremental Technique for Automata-Based Decision Procedures
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Idempotent Transductions for Modal Logics
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Controller Synthesis with Budget Constraints
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
The Beginning of Model Checking: A Personal Perspective
25 Years of Model Checking
Model Checking: From Tools to Theory
25 Years of Model Checking
25 Years of Model Checking
Precise Interval Analysis vs. Parity Games
FM '08 Proceedings of the 15th international symposium on Formal Methods
Describing the Wadge Hierarchy for the Alternation Free Fragment of μ-Calculus (I)
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
A CSP-Based Approach for Solving Parity Game
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Environment Assumptions for Synthesis
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Strategy Construction for Parity Games with Imperfect Information
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
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
Types and higher-order recursion schemes for verification of higher-order programs
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Alternation Elimination by Complementation (Extended Abstract)
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Polynomial-Time Under-Approximation of Winning Regions in Parity Games
Electronic Notes in Theoretical Computer Science (ENTCS)
An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Formal Methods in System Design
Solving μ-Calculus Parity Games by Symbolic Planning
Model Checking and Artificial Intelligence
Facets of Synthesis: Revisiting Church's Problem
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
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
Tighter Bounds for the Determinisation of Büchi Automata
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
Terminal Sequence Induction via Games
Logic, Language, and Computation
Winning Regions of Pushdown Parity Games: A Saturation Method
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Branching-Time Logics Repeatedly Referring to States
Journal of Logic, Language and Information
Finitary winning in ω-regular games
ACM Transactions on Computational Logic (TOCL)
The planning spectrum: one, two, three, infinity
Journal of Artificial Intelligence Research
Reasoning in expressive description logics with fixpoints based on automata on infinite trees
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Solving Parity Games in Practice
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Computational Aspects of Equilibria
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Discounting Infinite Games But How and Why?
Electronic Notes in Theoretical Computer Science (ENTCS)
Deciding Nondeterministic Hierarchy of Deterministic Tree Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Compositional Properties of Sequential Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Automata and fixed point logic: A coalgebraic perspective
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
A decidable class of problems for control under partial observation
Information Processing Letters
Automatic verification of sequential infinite-state processes
Automatic verification of sequential infinite-state processes
Higher order pushdown automata, the Caucal hierarchy of graphs and parity games
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Discounting the future in systems theory
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Information flow in concurrent games
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Bounded-variable fragments of hybrid logics
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
On the alternation-free horn µ-calculus
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
On the universal and existential fragments of the µ-calculus
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
An accelerated algorithm for 3-color parity games with an application to timed games
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Formal Methods in System Design
Computing game values for crash games
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Model checking the first-order fragment of higher-order fixpoint logic
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
On reachability games of ordinal length
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
A hybrid algorithm for LTL games
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Verification of higher-order computation: a game-semantic approach
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
Solving games via three-valued abstraction refinement
Information and Computation
Church's problem and a tour through automata theory
Pillars of computer science
ACM Transactions on Computational Logic (TOCL)
Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1
EXPTIME tableaux for the coalgebraic µ-calculus
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
On the complexity of branching-time logics
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Solving fully-observable non-deterministic planning problems via translation into a general game
KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
On hierarchically developing reactive systems
Information and Computation
Strategy construction for parity games with imperfect information
Information and Computation
An automata-theoretic approach to infinite-state systems
Time for verification
Towards a theory of time-bounded verification
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Alternation removal in büchi automata
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Safraless procedures for timed specifications
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Energy and mean-payoff games with imperfect information
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Exploring the boundary of half positionality
CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
Connection between logical and algebraic approaches to concurrent systems†
Mathematical Structures in Computer Science
The complexity of partial-observation parity games
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
A saturation method for the modal μ-calculus over pushdown systems
Information and Computation
Qualitative concurrent parity games
ACM Transactions on Computational Logic (TOCL)
The transitive µ-calculus is Büchi definable
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Generalized rabin(1) synthesis with applications to robust system synthesis
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Stuttering mostly speeds up solving parity games
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Subexponential lower bounds for randomized pivoting rules for the simplex algorithm
Proceedings of the forty-third annual ACM symposium on Theory of computing
Logic and games on automatic structures: playing with quantifiers and decompositions
Logic and games on automatic structures: playing with quantifiers and decompositions
Energy and mean-payoff parity markov decision processes
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Parity games on graphs with medium tree-width
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Software model checking using languages of nested trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Minimum attention controller synthesis for omega-regular objectives
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Max and sum semantics for alternating weighted automata
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Measuring permissiveness in parity games: mean-payoff parity games revisited
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Exploring the boundary of half-positionality
Annals of Mathematics and Artificial Intelligence
Improved model checking of hierarchical systems
Information and Computation
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
Deterministic priority mean-payoff games as limits of discounted games
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Half-Positional determinacy of infinite games
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Reasoning about Co-Büchi tree automata
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Logics for unranked trees: an overview
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Unsafe grammars and panic automata
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Regular sets over extended tree structures
Theoretical Computer Science
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
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Algorithms for omega-regular games with imperfect information
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Solving games without determinization
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Game quantification on automatic structures and hierarchical model checking games
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Church synthesis problem with parameters
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
Improved model checking of hierarchical systems
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Model checking for database theoreticians
ICDT'05 Proceedings of the 10th international conference on Database Theory
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Weak automata for the linear time µ-calculus
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
A subexponential lower bound for the random facet algorithm for parity games
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Regular languages with variables on graphs
Information and Computation
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
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
Minimizing generalized büchi automata
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
The complexity of model checking higher order fixpoint logic
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
The variable hierarchy of the µ-calculus is strict
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Complementation constructions for nondeterministic automata on infinite words
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Robustness in the presence of liveness
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Complexity results on branching-time pushdown model checking
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Tree automata and discrete distributed games
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Compositionality of fixpoint logic with chop
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Automata on directed graphs: edge versus vertex marking
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Finding shortest witnesses to the nonemptiness of automata on infinite words
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Selective approaches for solving weak games
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
State space representation for verification of open systems
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Simulation relations for alternating parity automata and parity games
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Concurrency, Compositionality, and Correctness
Fair adversaries and randomization in two-player games
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
A decision procedure for CTL* based on tableaux and automata
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Automatic verification of parameterized data structures
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
On the complexity of parity games
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
The dag-width of directed graphs
Journal of Combinatorial Theory Series B
Survey: Equilibria, fixed points, and complexity classes
Computer Science Review
On topological completeness of regular tree languages
Logic and Program Semantics
Optimized inlining of runtime monitors
NordSec'11 Proceedings of the 16th Nordic conference on Information Security Technology for Applications
Partial-Observation Stochastic Games: How to Win When Belief Fails
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Time and parallelizability results for parity games with bounded treewidth
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Approximately bisimilar symbolic models for digital control systems
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Continuous Separation of Game Languages
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
A Linear Time Special Case for MC Games
Fundamenta Informaticae
Parity games on undirected graphs
Information Processing Letters
Theoretical Computer Science
Solving games via three-valued abstraction refinement
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Omega-regular half-positional winning conditions
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Perfect information stochastic priority games
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Entanglement and the complexity of directed graphs
Theoretical Computer Science
How to translate efficiently extensions of temporal logics into alternating automata
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
A cure for stuttering parity games
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
Strategy synthesis for multi-dimensional quantitative objectives
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
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
Deciding monotone duality and identifying frequent itemsets in quadratic logspace
Proceedings of the 32nd symposium on Principles of database systems
A superpolynomial lower bound for strategy iteration based on snare memorization
Discrete Applied Mathematics
Model Checking Higher-Order Programs
Journal of the ACM (JACM)
Optimal bounds in parametric LTL games
Theoretical Computer Science
Topological extension of parity automata
Information and Computation
The proof-search problem between bounded-width resolution and bounded-degree semi-algebraic proofs
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Proof graphs for parameterised boolean equation systems
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
A constraint-based approach to solving games on infinite graphs
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
A theory of robust omega-regular software synthesis
ACM Transactions on Embedded Computing Systems (TECS)
Alternating traps in Muller and parity games
Theoretical Computer Science
Synthesis of hierarchical systems
Science of Computer Programming
A survey of partial-observation stochastic parity games
Formal Methods in System Design
A Characterization Theorem for the Alternation-Free Fragment of the Modal µ-Calculus
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
On Modal μ-Calculus in S5 and Applications
Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011
| Hi-index | 0.02 |
It is shown that the propositional mu-calculus is equivalent in expressive power to finite automata on infinite trees. Since complementation is trivial in the mu-calculus, the equivalence 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. It is also shown how mu-calculus can be used to establish determinacy of infinite games used in earlier proofs of complementation lemma, and certain games used in the theory of online algorithms.