Graph minors. V. Excluding a planar graph
Journal of Combinatorial Theory Series B
Bisimulations and abstraction homomorphisms
Journal of Computer and System Sciences
Research in the theory of &ohgr;-languages
Journal of Information Processing and Cybernetics
Alternating automata on infinite trees
Theoretical Computer Science
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
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
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
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Theoretical Computer Science
The complexity of stochastic games
Information and Computation
CTL and ECTL as fragments of the modal &mgr;-calculus
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Supervision of Infinite Behavior of Discrete-Event Systems
SIAM Journal on Control and Optimization
A subexponential randomized algorithm for the simple stochastic game problem
Information and Computation
The monadic second-order logic of graphs IX: machines and their behaviours
Selected papers of the workshop on Topology and completion in semantics
The complexity of mean payoff games on graphs
Theoretical Computer Science
Theory of hybrid systems and discrete event systems
Theory of hybrid systems and discrete event systems
Fast and simple nested fixpoints
Information Processing Letters
Determinization and memoryless winning strategies
Information and Computation
Handbook of formal languages, vol. 3
Languages, automata, and logic
Handbook of formal languages, vol. 3
Fixed point characterization of infinite behavior of finite-state systems
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
The modal mu-calculus alternation hierarchy is strict
Theoretical Computer Science
Deciding the winner in parity games is in UP ∩ co-UP
Information Processing Letters
Journal of the ACM (JACM)
Completeness of Kozen's axiomatisation of the propositional &mgr;-calculus
Information and Computation
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
Why are modal logics so robustly decidable?
Current trends in theoretical computer science
Weak alternating automata are not that weak
ACM Transactions on Computational Logic (TOCL)
Modal and temporal properties of processes
Modal and temporal properties of processes
Datalog LITE: a deductive query language with linear time model checking
ACM Transactions on Computational Logic (TOCL)
Back and forth between guarded and modal logics
ACM Transactions on Computational Logic (TOCL)
Graph Algorithms
Automata, Languages, and Machines
Automata, Languages, and Machines
Automata on Infinite Objects and Church's Problem
Automata on Infinite Objects and Church's Problem
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Handbook of Process Algebra
Automata Theory and Its Applications
Automata Theory and Its Applications
Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures
Theoretical Computer Science
Monadic second-order logic on tree-like structures
Theoretical Computer Science
Modal Logic over Finite Structures
Journal of Logic, Language and Information
Guarded fixed point logics and the monadic theory of countable trees
Theoretical Computer Science - Complexity and logic
The monadic theory of morphic infinite words and generalizations
Information and Computation
On infinite transition graphs having a decidable monadic theory
Theoretical Computer Science
Modal and Guarded Characterisation Theorems over Finite Transition Systems
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
The Complexity of First-Order and Monadic Second-Order Logic Revisited
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Decidability of Monadic Theories
Proceedings of the Mathematical Foundations of Computer Science 1984
Automata for the Modal mu-Calculus and related Results
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
When Can an Equational Simple Graph Be Generated by Hyperedge Replacement?
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
On Infinite Terms Having a Decidable Monadic Theory
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Ehrenfeucht Games, the Composition Method, and the Monadic Theory of Ordinal Words
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Complementation of Büchi Automata Revised
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Realizable and Unrealizable Specifications of Reactive Systems
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity
ICALP '86 Proceedings of the 13th International Colloquium on Automata, Languages and Programming
On Fixed-Point Clones (Extended Abstract)
ICALP '86 Proceedings of the 13th International Colloquium on Automata, Languages and Programming
On Infinite Transition Graphs Having a Decidable Monadic Theory
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
A Hierarchy Theorem for the µ-Calculus
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Simplifying the Modal Mu-Calculus Alternation Hierarchy
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Model Checking for Context-Free Processes
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
The Modal mu-calculus Alternation Hierarchy is Strict
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
A Purely Algebraic Proof of McNaughton's Theorem on Infinite Words
Proceedings of the 11th Conference on Foundations of Software Technology and Theoretical Computer Science
Determinizing Büchi Asnchronous Automata
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
A Discrete Strategy Improvement Algorithm for Solving Parity Games
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Efficient Algorithms for Model Checking Pushdown Systems
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
On Model-Checking for Fragments of µ-Calculus
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract)
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
An Improved Algorithm for the Evaluation of Fixpoint Expressions
CAV '94 Proceedings of the 6th 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
Completeness of Kozen's Axiomatisation of the Propositional Mu-Calculus
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
How much memory is needed to win infinite games?
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
On the Expressive Power of CTL
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
The Two-Variable Guarded Fragment with Transitive Relations
LICS '99 Proceedings of the 14th 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
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Weak Alternating Automata Are Not That Weak
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Automatic verification of sequential infinite-state processes
Automatic verification of sequential infinite-state processes
The weakness of self-complementation
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Eliminating recursion in the µ-calculus
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
| Hi-index | 0.00 |