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)
An automata-theoretic approach to modular model checking
ACM Transactions on Programming Languages and Systems (TOPLAS)
Weak alternating automata are not that weak
ACM Transactions on Computational Logic (TOCL)
Representing Arithmetic Constraints with Finite Automata: An Overview
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Weak Alternating Automata in Isabelle/HOL
TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
Extended Temporal Logic Revisited
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Alternating Automata and Logics over Infinite Words
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Trading Probability for Fairness
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Model checking: a tutorial overview
Modeling and verification of parallel processes
A gap property of deterministic tree languages
Theoretical Computer Science - Logic and complexity in computer science
An effective decision procedure for linear arithmetic over the integers and reals
ACM Transactions on Computational Logic (TOCL)
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Computing Convex Hulls by Automata Iteration
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
LTL with the freeze quantifier and register automata
ACM Transactions on Computational Logic (TOCL)
Handling Liveness Properties in (ω-)Regular Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Use of Automata-based Techniques in Symbolic Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
The weakness of self-complementation
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Resets vs. aborts in linear temporal logic
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
From LTL to symbolically represented deterministic automata
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
On (Omega-)regular model checking
ACM Transactions on Computational Logic (TOCL)
Safety alternating automata on data words
ACM Transactions on Computational Logic (TOCL)
Alternation removal in büchi automata
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Alternating automata on data trees and XPath satisfiability
ACM Transactions on Computational Logic (TOCL)
Weak cost monadic logic over infinite trees
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Safraless compositional synthesis
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Finding shortest witnesses to the nonemptiness of automata on infinite words
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Model Checking Temporal-Epistemic Logic Using Alternating Tree Automata
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Translating to Co-Büchi Made Tight, Unified, and Useful
ACM Transactions on Computational Logic (TOCL)
On the topological complexity of weakly recognizable tree languages
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Regular ideal languages and their boolean combinations
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |