168 Hits in 4.3 sec

Tree Transducers and Formal Methods (Dagstuhl Seminar 13192)

Sebastian Maneth, Helmut Seidl, Marc Herbstritt
2013 Dagstuhl Reports  
Open Problems: Which are the most pressing open problems in tree transducer theory? The seminar fully satisfied our expectations.  ...  The 33 participants from 13 countries (Australia, and the US) had been invited by the organizer Sebastian Maneth to give particular survey talks about their recent research on applications and theory of  ...  theoretical results such as the talk by Emmanuel Filiot on their recent breakthrough of proving that one-wayness of a two-way word automaton is decidable.  ... 
doi:10.4230/dagrep.3.5.1 dblp:journals/dagstuhl-reports/ManethS13 fatcat:xxotqpzgnzc3zdlkk4zxsdot5i

Adding Dense-Timed Stack to Integer Reset Timed Automata [chapter]

Devendra Bhave, Shibashis Guha
2017 Lecture Notes in Computer Science  
Visibly pushdown automata is another input-determined class of automata with a stack that is also closed under boolean operations and admits a logical characterization.  ...  Integer reset timed automata (IRTA) are known to be a determinizable subclass of timed automata, but it is not known whether they are input-determined, i.e., the clock values are completely determined  ...  For multistack dense-timed pushdown systems, Akshay et al. [3] have proposed a tree automata based technique for reachability problem on words with k-rounds. Organization.  ... 
doi:10.1007/978-3-319-67089-8_2 fatcat:rj2b3wr37zf7rdjfsw5secr5ha

Solving Infinite Games in the Baire Space [article]

Benedikt Brütsch, Wolfgang Thomas
2022 arXiv   pre-print
We consider such games defined by a natural kind of parity automata over the alphabet ℕ, called ℕ-MSO-automata, where transitions are specified by monadic second-order formulas over the successor structure  ...  Infinite games (in the form of Gale-Stewart games) are studied where a play is a sequence of natural numbers chosen by two players in alternation, the winning condition being a subset of the Baire space  ...  In descriptive set theory, the focus is the problem of determinacy (i.e., the question whether there is a winning strategy for either of the two players), whereas in automata theory the decision who wins  ... 
arXiv:2111.10881v2 fatcat:hwukltkbvrca5jled4huu2jyaq

Note on winning positions on pushdown games with ω-regular conditions

Olivier Serre
2003 Information Processing Letters  
We consider infinite two-player games on pushdown graphs.  ...  Finally, using the same methods, we show, for any ω-regular winning condition, that the set of winning positions for a given player is regular and effective.  ...  They use the decidability of the emptiness problem for alternating two-way tree automata.  ... 
doi:10.1016/s0020-0190(02)00445-3 fatcat:mifkacvxyfgwrn4tfbbzft2zim

Playing Games in the Baire Space

Benedikt Brütsch, Wolfgang Thomas
2016 Electronic Proceedings in Theoretical Computer Science  
We present a natural model of automata ("N-memory automata") equipped with the parity acceptance condition, and we introduce also the corresponding model of "N-memory transducers".  ...  We solve a generalized version of Church's Synthesis Problem where a play is given by a sequence of natural numbers rather than a sequence of bits; so a play is an element of the Baire space rather than  ...  These "Gale-Stewart games" [12] were studied in descriptive set theory focussing on the problem of determinacy (whether one of the two players has a winning strategy).  ... 
doi:10.4204/eptcs.220.2 fatcat:iv2pfofehjdc5myta76sjlmqmm

Parity Games on Bounded Phase Multi-pushdown Systems [chapter]

Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan
2017 Lecture Notes in Computer Science  
In this paper we address the problem of solving parity games over the configuration graphs of bounded phase multi-pushdown systems.  ...  A non-elementary decision procedure was proposed for this problem by A. Seth. In this paper, we provide a simple and inductive construction to solve this problem.  ...  His result is based on an extension of Walukiewicz's proof for solving this problem in the case of pushdown systems [12] .  ... 
doi:10.1007/978-3-319-59647-1_21 fatcat:gyox52gcgng3nmi4f7gvhnlxqa

What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead [article]

Felix Klein, Martin Zimmermann
2015 arXiv   pre-print
We investigate determinacy of delay games with Borel winning conditions, infinite-duration two-player games in which one player may delay her moves to obtain a lookahead on her opponent's moves.  ...  First, we prove determinacy of such games with respect to a fixed evolution of the lookahead. However, strategies in such games may depend on information about the evolution.  ...  The work presented here was initiated by a discussion with Dietmar Berwanger at the Dagstuhl Seminar "Non-Zero-Sum-Games and Control" in 2015.  ... 
arXiv:1504.02627v1 fatcat:4beux5qhbzb5fhe4zsvzfwkmpa

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.  ...  Our first contribution is about the strategy complexity, i.e the memory required for winning strategies: we prove that over general infinite-state graphs, memoryless strategies are sufficient for finitary  ...  The second author is grateful to Olivier Serre for many inspiring discussions, and Florian Horn for interesting comments.  ... 
arXiv:1301.2661v2 fatcat:5c4ptvc62nhupkzfjsbupiorhy

Page 710 of Mathematical Reviews Vol. , Issue 81B [page]

1981 Mathematical Reviews  
{For the entire collection see MR 80m:68007.} Miyano, Satoru One-way weak-stack-counter automata. J. Comput. System Sci. 20 (1980), no. 1, 59-76.  ...  The algorithm is based on the apparatus of -par- titions and was implemented on a computer for some types of automata.  ... 

Languages of Nested Trees [chapter]

Rajeev Alur, Swarat Chaudhuri, P. Madhusudan
2006 Lecture Notes in Computer Science  
We find that the model-checking problem for these automata on pushdown systems is EXPTIME-complete, and that their alternating versions are expressively equivalent to NT-μ, a recently proposed temporal  ...  These graphs can naturally model branching behaviors of pushdown programs, so that the problem of branching-time software model checking may be phrased as a membership question for such languages.  ...  An EXPTIME-hardness result for this problem follows from the known hardness of the model-checking problem for alternating tree automata on pushdown systems [23] .  ... 
doi:10.1007/11817963_31 fatcat:yro5cpjyizfavcna3ok2rwxcf4

Winning Regions of Higher-Order Pushdown Games

Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H. Luke Ong, Olivier Serre
2008 Logic in Computer Science  
From our main result on winning regions of parity games we derive a solution to the Modal Mu-Calculus Global Model-Checking Problem for higher-order pushdown graphs as well as for ranked trees generated  ...  These automata generalise pushdown automata by the use of higher-order stacks, which are nested "stack of stacks" structures.  ...  Hence we establish that the emptiness problem for order-(n + 1) pushdown automata can be polynomially reduced to deciding the winner of two-player order-n game.  ... 
doi:10.1109/lics.2008.41 dblp:conf/lics/CarayolHMOS08 fatcat:lgkwjeewtzgvfcfpqan5dyckji

From Logic to Games [chapter]

Igor Walukiewicz
2005 Lecture Notes in Computer Science  
The µ-calculus is compositional, it permits doing proofs by induction on the syntax. Automata are better for algorithmic issues and problems such as minimization.  ...  The above reduction shows that the satisfiability question for the µ-calculus can be solved via emptiness problem for alternating automata.  ... 
doi:10.1007/11590156_5 fatcat:ps3dhgrvcnhabi6432n2rm5qrm

The Determinacy of Context-Free Games

Olivier Finkel
2013 Journal of Symbolic Logic (JSL)  
We show also that the determinacy of Wadge games between two players in charge of ω-languages accepted by 1-counter Büchi automata is equivalent to the (effective) analytic Wadge determinacy.  ...  We prove that the determinacy of Gale-Stewart games whose winning sets are accepted by realtime 1-counter Büchi automata is equivalent to the determinacy of (effective) analytic Gale-Stewart games which  ...  Then the problem of the synthesis of winning strategies is of great practical interest for the problem of program synthesis in reactive systems.  ... 
doi:10.2178/jsl.7804050 fatcat:mgknwtlahnd5fc4z4axyzeqefm

Pushdown automata, multiset automata, and Petri nets

Yoram Hirshfeld, Faron Moller
2001 Theoretical Computer Science  
In this way, we provide natural definitions for commutative (parallel) context-free automata, multiset (parallel, or random access, pushdown) automata, and Petri nets.  ...  These classes are deÿned by two natural hierarchies, one given by interpreting concatenation of symbols in the rewrite system as sequential composition, and the other by interpreting concatenation as parallel  ...  PDA represents the class of pushdown automata which accept on empty stack.  ... 
doi:10.1016/s0304-3975(00)00099-2 fatcat:xmpdbo5g5vailiuuarvb5mhole

Model Checking Linear Properties of Prefix-Recognizable Systems [chapter]

Orna Kupferman, Nir Piterman, Moshe Y. Vardi
2002 Lecture Notes in Computer Science  
We study the expressive power and the complexity of the decision problems for (two way) path automata.  ...  This is in contrast to [KV00], where the emptiness problem for two-way alternating tree automata is being used.  ...  We note that the membership problem for 2-way alternating Büchi automata on trees (2ABT) is EXPTIMEcomplete.  ... 
doi:10.1007/3-540-45657-0_31 fatcat:b72iabdq3nc6jdg2tjxffglacy
« Previous Showing results 1 — 15 out of 168 results