Skip to Main content Skip to Navigation
Conference papers

Regular Strategies In Pushdown Reachability Games

Abstract : We show that positional winning strategies in pushdown reachability games can be implemented by deterministic finite state au-tomata 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Arnaud Carayol Connect in order to contact the contributor
Submitted on : Wednesday, February 28, 2018 - 3:00:19 PM
Last modification on : Saturday, January 15, 2022 - 3:56:54 AM
Long-term archiving on: : Monday, May 28, 2018 - 1:22:07 PM


Files produced by the author(s)



Arnaud Carayol, Matthew Hague. Regular Strategies In Pushdown Reachability Games. RP 2014, 2014, Oxford, United Kingdom. pp.58-71, ⟨10.1007/978-3-319-11439-2_5⟩. ⟨hal-01719810⟩



Record views


Files downloads