An Antichain Algorithm for LTL Realizability [chapter]

Emmanuel Filiot, Naiyong Jin, Jean-François Raskin
2009 Lecture Notes in Computer Science  
In this paper, we study the structure of underlying automata based constructions for solving the LTL realizability problem. We show how to reduce the LTL realizability problem to a game with an observer which checks that the game visits a bounded number of times accepting states of a universal co-Büchi word automaton. We show that such an observer can be made deterministic and that this deterministic observer has a nice structure which can be exploited by an incremental algorithm that
more » ... s antichains of game positions. We have implemented this new algorithm and our first results are very encouraging. 1 Technically, we could have started with Player I, for modeling reason it is conservative to start with Player O. Proposition 5. Given a graph G = (V, E), we can construct in deterministic polynomial time a UK CW A, with K = 0, and an antichain L such that IND(G) =↓ Pre I (Pre O (Pre O ((L))).
doi:10.1007/978-3-642-02658-4_22 fatcat:q4euvc43n5f2dizfsfnhnd6c2m