Publication detail

Summaries for Context-Free Games

HOLÍK, L. MEYER, R. MUSKALLA, S.

Original Title

Summaries for Context-Free Games

Type

conference paper

Language

English

Original Abstract

We study two-player games played on the infinite graph of sentential forms induced by a context-free grammar (that comes with an ownership partitioning of the non-terminals). The winning condition is inclusion of the derived terminal word in the language of a finite automaton. Our contribution is a new algorithm to decide the winning player and to compute her strategy. It is based on a novel representation of all plays starting in a non-terminal. The representation uses the domain of Boolean formulas over the transition monoid of the target automaton. The elements of the monoid are essentially procedure summaries, and our approach can be seen as the first summary-based algorithm for the synthesis of recursive programs. We show that our algorithm has optimal (doubly exponential) time complexity, that it is compatible with recent antichain optimizations, and that it admits a lazy evaluation strategy. Our preliminary experiments indeed show encouraging results, indicating a speed up of three orders of magnitude over a competitor. 

Keywords

summaries, context-free games, Kleene iteration, transition monoid, strategy synthesis

Authors

HOLÍK, L.; MEYER, R.; MUSKALLA, S.

Released

13. 12. 2016

Publisher

Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik

Location

Dagstuhl

ISBN

978-3-95977-027-9

Book

36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)

Edition

Leibniz International Proceedings in Informatics (LIPIcs)

Pages from

41

Pages to

57

Pages count

16

URL

http://drops.dagstuhl.de/opus/volltexte/2016/6876

BibTex

@inproceedings{BUT133506,
  author="Lukáš {Holík} and Roland {Meyer} and Sebastian {Muskalla}",
  title="Summaries for Context-Free Games",
  booktitle="36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)",
  year="2016",
  series="Leibniz International Proceedings in Informatics (LIPIcs)",
  pages="41--57",
  publisher="Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik",
  address="Dagstuhl",
  doi="10.4230/LIPIcs.FSTTCS.2016.41",
  isbn="978-3-95977-027-9",
  url="http://drops.dagstuhl.de/opus/volltexte/2016/6876"
}