Regular Strategies in Pushdown Reachability Games

  • A. Carayol
  • M. Hague
Conference paper

DOI: 10.1007/978-3-319-11439-2_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8762)
Cite this paper as:
Carayol A., Hague M. (2014) Regular Strategies in Pushdown Reachability Games. In: Ouaknine J., Potapov I., Worrell J. (eds) Reachability Problems. RP 2014. Lecture Notes in Computer Science, vol 8762. Springer, Cham

Abstract

We show that positional winning strategies in pushdown reachability games can be implemented by deterministic finite state automata of exponential size. Such automata read the stack and control state of a given pushdown configuration and output the set of winning moves playable from that position.

This result can originally be attributed to Kupferman, Piterman and Vardi using an approach based on two-way tree automata. We present a more direct approach that builds upon the popular saturation technique. Saturation for analysing pushdown systems has been successfully implemented by Moped and WALi. Thus, our approach has the potential for practical applications to controller-synthesis problems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • A. Carayol
    • 1
    • 2
  • M. Hague
    • 1
    • 2
  1. 1.LIGMUniversité Paris-Est & CNRSFrance
  2. 2.Royal Holloway University of LondonUK

Personalised recommendations