Solving Sequential Conditions by Finite-State Strategies
From MaRDI portal
Cited in
(only showing first 100 items - show all)- From liveness to promptness
- Infinite-word languages and continuous mappings
- Fine hierarchy of regular \(\omega\)-languages
- On branching and looping. I
- On branching and looping. II
- Noiselike transforms of \(\omega\)-events
- Infinite games played on finite graphs
- Determinization and memoryless winning strategies
- Finite automata on timed \(\omega\)-trees
- Ambiguity in omega context free languages
- A hierarchy of deterministic context-free \(\omega\)-languages.
- Structural measures for games and process control in the branch learning model
- Finite variability interpretation of monadic logic of order
- Hierarchical information and the synthesis of distributed strategies
- Model-checking iterated games
- Supervisory control and reactive synthesis: a comparative introduction
- Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics
- Energy parity games
- Learning to win process-control games watching game-masters
- On omega context free languages which are Borel sets of infinite rank.
- Quantitative solution of omega-regular games
- On control of systems modelled as deterministic Rabin automata
- McNaughton games and extracting strategies for concurrent programs
- Decidability of well-connectedness for distributed synthesis
- -automata
- Automata on infinite trees
- Reactive synthesis from visibly register pushdown automata
- Certifying DFA bounds for recognition and separation
- Finite-state strategies in delay games
- On computability of data word functions defined by transducers
- Indecision and delays are the parents of failure -- taming them algorithmically by synthesizing delay-resilient control
- Certifying inexpressibility
- 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
- A symbolic algorithm for lazy synthesis of eager strategies
- Synthesizing structured reactive programs via deterministic tree automata
- Compositional construction of most general controllers
- Synthesis for continuous time
- Hyperplane separation technique for multidimensional mean-payoff games
- Modular strategies for recursive game graphs
- The computational complexity of scenario-based agent verification and design
- On decidability of monadic logic of order over the naturals extended by monadic predicates
- Distributed synthesis is simply undecidable
- Interface synthesis and protocol conversion
- On composition and lookahead delegation of \(e\)-services modeled by automata
- Observation and distinction: representing information in infinite games
- Effective synthesis of asynchronous systems from GR(1) specifications
- From winning strategy to Nash equilibrium
- Verification and control of probabilistic rectangular hybrid automata
- Delay games with WMSO+U winning conditions
- Minimum Attention Controller Synthesis for Omega-Regular Objectives
- Graph Games and Reactive Synthesis
- Compositional Control Synthesis for Partially Observable Systems
- Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition
- Delay games with WMSO+U winning conditions
- Well-Quasi Orders and Hierarchy Theory
- Encodings of bounded synthesis
- Finite-state strategies in delay games
- On Determinisation of Good-for-Games Automata
- Bounded synthesis for Petri games
- Memory Reduction for Strategies in Infinite Games
- From Philosophical to Industrial Logics
- Facets of Synthesis: Revisiting Church’s Problem
- Tighter Bounds for the Determinisation of Büchi Automata
- Synthesis from Component Libraries
- Decidable Extensions of Church’s Problem
- A survey of stochastic -regular games
- The complexity of stochastic Müller games
- Towards a notion of unsatisfiable and unrealizable cores for LTL
- Reliability-aware automatic composition approach for web services
- Synthesis of Reactive(1) designs
- Synthesis from scenario-based specifications
- scientific article; zbMATH DE number 7350772 (Why is no real title available?)
- scientific article; zbMATH DE number 7376069 (Why is no real title available?)
- The complexity of transducer synthesis from multi-sequential specifications
- Optimal strategies in weighted limit games
- Solving Infinite Games in the Baire Space
- Optimally Resilient Strategies in Pushdown Safety Games
- scientific article; zbMATH DE number 7559499 (Why is no real title available?)
- Büchi Good-for-Games Automata Are Efficiently Recognizable
- scientific article; zbMATH DE number 7561705 (Why is no real title available?)
- Synthesis of computable regular functions of infinite words
- Fine hierarchy of regular -languages
- Computability of data-word transductions over different data domains
- Faster algorithms for mean-payoff parity games
- scientific article; zbMATH DE number 7278100 (Why is no real title available?)
- Parametric linear dynamic logic
- Synthesis of deterministic top-down tree transducers from automatic tree relations
- Logical player types for a theory of play
- Optimizing Winning Strategies in Regular Infinite Games
- 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
- Supervisory Control with Complete Observations
- Decision problems forω-automata
- The complexity of recursion theoretic games
- An \(O(n^2)\) time algorithm for alternating Büchi games
- Synthesis of data word transducers
This page was built for publication: Solving Sequential Conditions by Finite-State Strategies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5573394)
