Filters








203 Hits in 4.3 sec

Good-for-games ω-Pushdown Automata [article]

Karoliina Lehtinen, Martin Zimmermann
2022 arXiv   pre-print
We introduce good-for-games ω-pushdown automata (ω-GFG-PDA). These are automata whose nondeterminism can be resolved based on the input processed so far.  ...  Moreover, we study closure properties of the class of languages recognized by ω-GFG- PDA and decidability of good-for-gameness of ω-pushdown automata and languages.  ...  We thank Sven Schewe and Patrick Totzke for fruitful discussions leading to the results presented in Section 6.  ... 
arXiv:2001.04392v6 fatcat:a6vyfk4edbbybnagzxaba3uhqi

Good-for-games $\omega$-Pushdown Automata

Karoliina Lehtinen, Martin Zimmermann
2022 Logical Methods in Computer Science  
We introduce good-for-games $\omega$-pushdown automata ($\omega$-GFG-PDA). These are automata whose nondeterminism can be resolved based on the input processed so far.  ...  Good-for-gameness enables automata to be composed with games, trees, and other automata, applications which otherwise require deterministic automata.  ...  We thank Sven Schewe and Patrick Totzke for fruitful discussions leading to the results presented in Section 6.  ... 
doi:10.46298/lmcs-18(1:3)2022 fatcat:2nm6ks4rz5efznj3bgpw6md2ay

Visibly Pushdown Games [chapter]

Christof Löding, P. Madhusudan, Olivier Serre
2004 Lecture Notes in Computer Science  
This leads to an alternative proof that visibly pushdown automata are not determinizable and also shows that visibly pushdown games are determined.  ...  We establish that, unlike pushdown games with pushdown winning conditions, visibly pushdown games are decidable and are 2Exptime-complete.  ...  Deterministic Stair Vpas Visibly pushdown automata over ω-words cannot be determinized [2] .  ... 
doi:10.1007/978-3-540-30538-5_34 fatcat:vm7w2a2ybnba7nn3ldiykdfuay

Regularity Problems for Weak Pushdown ω-Automata and Games [chapter]

Christof Löding, Stefan Repke
2012 Lecture Notes in Computer Science  
We show that this problem is already undecidable for games defined by one-counter automata or visibly pushdown automata with a safety condition.  ...  We show that the regularity and equivalence problems are decidable for deterministic weak pushdown ω-automata, giving a partial answer to a question raised by Cohen and Gold in 1978.  ...  With thanks to Wladimir Fridman for fruitful discussions.  ... 
doi:10.1007/978-3-642-32589-2_66 fatcat:vgv56zhgpzdkridklhexppowg4

A Game-Semantic Model of Computation, Revisited: an Automata-Theoretic Perspective [article]

Norihiro Yamada
2019 arXiv   pre-print
The present paper revisits this result from an automata-theoretic perspective: It shows that deterministic non-erasing pushdown automata whose input tape is equipped with simple directed edges between  ...  cells can implement all the game-semantic PCF-computation, where the edges rather restrict the cells of the tape which the automata may read off.  ...  Acknowledgments The author acknowleges the financial support from Funai Overseas Scholarship, and also he is grateful to Samson Abramsky, Luke Ong and John Longley for fruitful discussions.  ... 
arXiv:1806.10435v2 fatcat:lou6krp5nbabzkylsnp5yyurpa

Two-Way Tree Automata Solving Pushdown Games [chapter]

Thierry Cachat
2002 Lecture Notes in Computer Science  
In this paper we study parity games on a simple class of infinite graphs: the pushdown (transition) graphs.  ...  Parity games (where the winner is determined by the parity of the maximal priority appearing infinitely often) were presented in Chapter 2 and algorithms solving parity games for the case of finite graphs  ...  The emptiness problem for alternating two-way tree automata is in Exptime. Application: Pushdown Games We use alternating two-way automata to solve parity games on pushdown graphs.  ... 
doi:10.1007/3-540-36387-4_17 fatcat:pi24q4youred5lq73w2ufilp6m

Decision Problems for Deterministic Pushdown Automata on Infinite Words

Christof Löding
2014 Electronic Proceedings in Theoretical Computer Science  
The article surveys some decidability results for DPDAs on infinite words (omega-DPDA).  ...  Furthermore, we present some new results on the parity index problem for omega-DPDAs.  ...  good properties of finite automata on finite words are preserved (see [13] for an overview).  ... 
doi:10.4204/eptcs.151.4 fatcat:gxxf7gxwmnhnfmgvsjiskdoj3y

Infinite-state games with finitary conditions [article]

Krishnendu Chatterjee
2013 arXiv   pre-print
We then study pushdown boundedness games, with two contributions. First we prove a collapse result for pushdown omega B games, implying the decidability of solving these games.  ...  B\"uchi games, and finite-memory suffices for finitary parity games.  ...  We thank Denis Kuperberg and Thomas Colcombet for sharing and explaining [7] , and Damian Niwinski for questions related to pushdown finitary games.  ... 
arXiv:1301.2661v2 fatcat:5c4ptvc62nhupkzfjsbupiorhy

Higher-Order Model Checking: An Overview

Luke Ong
2015 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science  
Advances have been made in determining the expressive power of recursion schemes and other higher-order families of generators, automata-theoretic characterisations of these generator families, and the  ...  Because the trees generated by recursion schemes are computation trees of higher-order functional programs, higherorder model checking provides a foundation for model checkers of such programming languages  ...  Acknowledgements: The author is grateful to Takeshi Tsukada for helpful comments on the paper.  ... 
doi:10.1109/lics.2015.9 dblp:conf/lics/Ong15 fatcat:55bfxqlkuzhbtgmzc32m46ooku

Saturation algorithms for model-checking pushdown systems

Arnaud Carayol, Matthew Hague
2014 Electronic Proceedings in Theoretical Computer Science  
We present a survey of the saturation method for model-checking pushdown systems.  ...  Computing the winning region Fix a pushdown parity game P = (Q, Γ, ⊥, ∆, ). Computing the winning region in a pushdown parity game is a direct extension of the algorithm presented for Büchi games.  ...  Moreover, the tuple defines a pushdown game (Q, Γ, ⊥, ∆,W ) where W = {ρ | min((Inf(ρ))) is even } .  ... 
doi:10.4204/eptcs.151.1 fatcat:546kymvwxnfgxikrpfr2ozl5ry

Resource Reachability Games on Pushdown Graphs [chapter]

Martin Lang
2014 Lecture Notes in Computer Science  
We consider two-player reachability games with additional resource counters on arenas that are induced by the configuration graphs of pushdown systems.  ...  We provide an effective, saturation-based method to solve this problem for regular sets of initial and goal configurations.  ...  Moreover, two player games on pushdown graphs with ω-regular winning conditions were solved in [15] by I. Walukiewicz . Later, T.  ... 
doi:10.1007/978-3-642-54830-7_13 fatcat:bguzwt34pneebeglogxo7fgzfq

Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking [chapter]

Luke Ong
2013 Lecture Notes in Computer Science  
Collapsible pushdown automata are a generalisation of pushdown automata to higher-order stacks -which are iterations of stack of stacks -that contain symbols equipped with links.  ...  I am grateful to all my collaborators for their help. Thanks are also due to EPSRC for financial support.  ...  pushdown automata.  ... 
doi:10.1007/978-3-642-37064-9_3 fatcat:vmzogjyskfahbeklhyssyajvuy

Uniform Solution of Parity Games on Prefix-Recognizable Graphs

Thierry Cachat
2003 Electronical Notes in Theoretical Computer Science  
Walukiewicz gave in 1996 a solution for parity games on pushdown graphs: he proved the existence of pushdown strategies and determined the winner with an exptime procedure.  ...  We give a new presentation and a new algorithmic proof of these results, obtain a uniform solution for parity games (independent of their initial configuration), and extend the results to prefix-recognizable  ...  of INFINITY for helpful remarks.  ... 
doi:10.1016/s1571-0661(04)80534-6 fatcat:lzxagcrifverbeqmztmas4shgu

Krivine machines and higher-order schemes

Sylvain Salvati, Igor Walukiewicz
2014 Information and Computation  
Many results in the literature use automata models generalising pushdown automata, most notably higher-order pushdown automata with collapse (CPDA).  ...  Compared to CPDA, this model is closer to lambdacalculus, and incorporates nicely many invariants of computations, as for example the typing information.  ...  [CHM + 08] showed regularity of winning regions in parity games over higher-order pushdown automata without collapse.  ... 
doi:10.1016/j.ic.2014.07.012 fatcat:34wwnvkflrhg7pdqvthvlrl7bi

Krivine Machines and Higher-Order Schemes [chapter]

S. Salvati, I. Walukiewicz
2011 Lecture Notes in Computer Science  
Many results in the literature use automata models generalising pushdown automata, most notably higher-order pushdown automata with collapse (CPDA).  ...  Compared to CPDA, this model is closer to lambdacalculus, and incorporates nicely many invariants of computations, as for example the typing information.  ...  [CHM + 08] showed regularity of winning regions in parity games over higher-order pushdown automata without collapse.  ... 
doi:10.1007/978-3-642-22012-8_12 fatcat:njdu5rjzvvarzhdnewrqjipp6u
« Previous Showing results 1 — 15 out of 203 results