Alternating automata, the weak monadic theory of the tree, and its complexity
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Reasoning about infinite computations
Information and Computation
An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
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
Improved Automata Generation for Linear Temporal Logic
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Efficient Büchi Automata from LTL Formulae
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Fast LTL to Büchi Automata Translation
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Another Look at LTL Model Checking
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Improved algorithms for the automata-based approach to model-checking
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Proceedings of the 14th international SPIN conference on Model checking software
Antichains: alternative algorithms for LTL satisfiability and model-checking
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
GOAL extended: towards a research tool for omega automata and temporal logic
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Symbolic implementation of alternating automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Antichains: a new algorithm for checking universality of finite automata
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Bounded model checking for weak alternating büchi automata
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Truly on-the-fly LTL model checking
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Symbolic systems, explicit properties: on hybrid approaches for LTL symbolic model checking
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Fixpoint Guided Abstraction Refinement for Alternating Automata
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
A theory of sampling for continuous-time metric temporal logic
ACM Transactions on Computational Logic (TOCL)
Fixed point guided abstraction refinement for alternating automata
Theoretical Computer Science
Antichain algorithms for finite automata
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |
ALASKA is a verification tool that implements new algorithms based on antichains [5, 7, 6] to efficiently solve the emptiness problem for both alternating finite automata (AFW) and alternating Büchi automata (ABW). Using the well-known translation from LTL to alternating automata, the tool can decide the satisfiability and validity problems for LTL over finite or infinite words. Moreover, ALASKA can solve the model-checking problem for ABW, LTL, AFW and finite-word LTL over symbolic (BDD-encoded) Kripke structures.