par Doyen, Laurent ;Raskin, Jean-François
Référence Lecture notes in computer science, 6015, page (2-22)
Publication Publié, 2010
Article révisé par les pairs
Résumé : We present a general theory that exploits simulation relations on transition systems to obtain antichain algorithms for solving the reachability and repeated reachability problems. Antichains are more succinct than the sets of states manipulated by the traditional fixpoint algorithms. The theory justifies the correctness of the antichain algorithms, and applications such as the universality problem for finite automata illustrate efficiency improvements. Finally, we show that new and provably better antichain algorithms can be obtained for the emptiness problem of alternating automata over finite and infinite words. © 2010 Springer-Verlag.

Documents en relation

DI-fusion