Reachability Games on Automatic Graphs
In this work we study two-person reachability games on finite and infinite automatic graphs. For the finite case we empirically show that automatic game encodings are competitive to well-known symbolic techniques such as BDDs, SAT and QBF formulas. For the infinite case we present a novel algorithm utilizing algorithmic learning techniques, which allows to solve huge classes of automatic reachability games.
KeywordsRegular Language Winning Strategy Automaton Learn Vertex Label Game Graph
Unable to display preview. Download preview PDF.
- 6.Touili, T.: Regular model checking using widening techniques. Electr. Notes Theor. Comput. Sci. 50(4) (2001)Google Scholar