par De Wulf, Martin ;Doyen, Laurent ;Maquet, Nicolas ;Raskin, Jean-François
Référence Lecture notes in computer science, 5311 LNCS, page (240-245)
Publication Publié, 2008
Article révisé par les pairs
Résumé : 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. © 2008 Springer Berlin Heidelberg.

Documents en relation

DI-fusion