An automaton learning approach to solving safety games over infinite graphs

DOI10.1007/978-3-662-49674-9_12zbMath1420.68109arXiv1601.01660OpenAlexW2226549490MaRDI QIDQ2272917

Daniel Neider, Ufuk Topcu

Publication date: 17 September 2019

Full work available at URL: https://arxiv.org/abs/1601.01660

Mathematics Subject Classification ID

Computational learning theory (68Q32) Games involving graphs (91A43) Formal languages and automata (68Q45)

Related Items

Regular model checking revisited, Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis, A symbolic algorithm for lazy synthesis of eager strategies, Optimally Resilient Strategies in Pushdown Safety Games