Solving Sequential Conditions by Finite-State Strategies
From MaRDI portal
Publication:5573394
DOI10.2307/1994916zbMath0182.02302OpenAlexW4231624530WikidataQ56288492 ScholiaQ56288492MaRDI QIDQ5573394
J. Richard Buchi, Lawrence H. Landweber
Publication date: 1969
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://docs.lib.purdue.edu/cstech/88
Related Items
Decision problems forω-automata, Unnamed Item, Optimal controller synthesis for timed systems, Church synthesis on register automata over linearly ordered data domains, Unnamed Item, Unnamed Item, Tableaux for realizability of safety specifications, Synthesizing Computable Functions from Rational Specifications Over Infinite Words, Semantic flowers for good-for-games and deterministic automata, The complexity of recursion theoretic games, Synthesis of Data Word Transducers, Topological properties of omega context-free languages, Branching time controllers for discrete event systems, Wadge hierarchy of omega context-free languages, Optimizing Winning Strategies in Regular Infinite Games, Unnamed Item, Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey, Church’s Problem and a Tour through Automata Theory, From Monadic Logic to PSL, Stochastic Müller Games are PSPACE-Complete, How Much Lookahead is Needed to Win Infinite Games?, Unnamed Item, How Much Lookahead is Needed to Win Infinite Games?, Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games, Unnamed Item, Supervisory Control with Complete Observations, Logical Player Types for a Theory of Play, Unnamed Item, Reactive synthesis from visibly register pushdown automata, On omega context free languages which are Borel sets of infinite rank., Hyperplane separation technique for multidimensional mean-payoff games, Solving Infinite Games in the Baire Space, Infinite-word languages and continuous mappings, Effective Synthesis of Asynchronous Systems from GR(1) Specifications, Modular strategies for recursive game graphs, Hierarchical information and the synthesis of distributed strategies, The computational complexity of scenario-based agent verification and design, Quantitative solution of omega-regular games, On Determinisation of Good-for-Games Automata, Bounded Synthesis for Petri Games, On decidability of monadic logic of order over the naturals extended by monadic predicates, Minimum Attention Controller Synthesis for Omega-Regular Objectives, Distributed synthesis for well-connected architectures, Graph Games and Reactive Synthesis, Certifying DFA bounds for recognition and separation, Compositional Control Synthesis for Partially Observable Systems, Determinization and memoryless winning strategies, On control of systems modelled as deterministic Rabin automata, Optimal strategy synthesis for request-response games, Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition, From winning strategy to Nash equilibrium, Delay Games with WMSO$$+$$U Winning Conditions, McNaughton games and extracting strategies for concurrent programs, Update games and update networks, Model-checking iterated games, Fine hierarchy of regular \(\omega\)-languages, Choice functions and well-orderings over the infinite binary tree, Verification and Control of Probabilistic Rectangular Hybrid Automata, Finite-state strategies in delay games, Fine hierarchy of regular ω-languages, On branching and looping. I, On branching and looping. II, Unnamed Item, Finite automata on timed \(\omega\)-trees, Delay Games with WMSO+U Winning Conditions, Memory Reduction for Strategies in Infinite Games, Ambiguity in omega context free languages, Randomness for free, A hierarchy of deterministic context-free \(\omega\)-languages., Supervisory control and reactive synthesis: a comparative introduction, A survey of stochastic \(\omega \)-regular games, The complexity of stochastic Müller games, Decidability of well-connectedness for distributed synthesis, Unnamed Item, Unnamed Item, On computability of data word functions defined by transducers, Towards a notion of unsatisfiable and unrealizable cores for LTL, Selection over classes of ordinals expanded by monadic predicates, Reliability-aware automatic composition approach for web services, Synthesis of Reactive(1) designs, Synthesis from scenario-based specifications, Observation and distinction: representing information in infinite games, Unnamed Item, Unnamed Item, Distributed synthesis is simply undecidable, Well-Quasi Orders and Hierarchy Theory, Indecision and delays are the parents of failure -- taming them algorithmically by synthesizing delay-resilient control, Certifying inexpressibility, Encodings of Bounded Synthesis, Topological complexity of locally finite \(\omega\)-languages, On Gabbay's temporal fixed point operator, Fine hierarchies and m-reducibilities in theoretical computer science, Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics, Parametric linear dynamic logic, Synthesis of deterministic top-down tree transducers from automatic tree relations, Gurevich-Harrington's games defined by finite automata, A survey of partial-observation stochastic parity games, Efficient controller synthesis for a fragment of \(\mathrm{MTL}_{0,\infty}\), Distributed synthesis for regular and contextfree specifications, The Church problem for expansions of \((\mathbb{N},<)\) by unary predicates, Energy parity games, Interface synthesis and protocol conversion, Noiselike transforms of \(\omega\)-events, Unnamed Item, From Philosophical to Industrial Logics, Unnamed Item, Unnamed Item, Facets of Synthesis: Revisiting Church’s Problem, Tighter Bounds for the Determinisation of Büchi Automata, Synthesis from Component Libraries, Program repair without regret, A symbolic algorithm for lazy synthesis of eager strategies, Extension of Gurevich-Harrington's restricted memory determinacy theorem: A criterion for the winning player and an explicit class of winning strategies, Optimally Resilient Strategies in Pushdown Safety Games, Büchi Good-for-Games Automata Are Efficiently Recognizable, Decidable Extensions of Church’s Problem, Regular sets over extended tree structures, \( \omega \)-automata, Automata on infinite trees, From liveness to promptness, Structural measures for games and process control in the branch learning model, On composition and lookahead delegation of \(e\)-services modeled by automata, Learning to win process-control games watching game-masters, Synthesizing structured reactive programs via deterministic tree automata, Infinite games played on finite graphs, Compositional construction of most general controllers, Finite variability interpretation of monadic logic of order, Synthesis for continuous time
