Pages that link to "Item:Q5573394"

The following pages link to Solving Sequential Conditions by Finite-State Strategies (Q5573394):

Displaying 50 items.

• A survey of stochastic \(\omega \)-regular games (Q414898) (← links)
• The complexity of stochastic Müller games (Q418128) (← links)
• Towards a notion of unsatisfiable and unrealizable cores for LTL (Q433349) (← links)
• Reliability-aware automatic composition approach for web services (Q439793) (← links)
• Synthesis of Reactive(1) designs (Q439954) (← links)
• Synthesis from scenario-based specifications (Q439960) (← links)
• Parametric linear dynamic logic (Q515660) (← links)
• Synthesis of deterministic top-down tree transducers from automatic tree relations (Q515670) (← links)
• Choice functions and well-orderings over the infinite binary tree (Q607442) (← links)
• Selection over classes of ordinals expanded by monadic predicates (Q636340) (← links)
• On Gabbay's temporal fixed point operator (Q673958) (← links)
• Gurevich-Harrington's games defined by finite automata (Q685082) (← links)
• The Church problem for expansions of \((\mathbb{N},<)\) by unary predicates (Q690498) (← links)
• Program repair without regret (Q746769) (← links)
• Extension of Gurevich-Harrington's restricted memory determinacy theorem: A criterion for the winning player and an explicit class of winning strategies (Q752703) (← links)
• Regular sets over extended tree structures (Q764339) (← links)
• Distributed synthesis for well-connected architectures (Q842581) (← links)
• Update games and update networks (Q876693) (← links)
• Randomness for free (Q897644) (← links)
• Topological complexity of locally finite \(\omega\)-languages (Q944222) (← links)
• Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
• From liveness to promptness (Q1039845) (← links)
• Infinite-word languages and continuous mappings (Q1082087) (← links)
• Fine hierarchy of regular \(\omega\)-languages (Q1127312) (← links)
• On branching and looping. I (Q1134530) (← links)
• On branching and looping. II (Q1134531) (← links)
• Noiselike transforms of \(\omega\)-events (Q1227706) (← links)
• Infinite games played on finite graphs (Q1314640) (← links)
• Determinization and memoryless winning strategies (Q1357005) (← links)
• Finite automata on timed \(\omega\)-trees (Q1395427) (← links)
• Ambiguity in omega context free languages (Q1399989) (← links)
• A hierarchy of deterministic context-free \(\omega\)-languages. (Q1401159) (← links)
• Structural measures for games and process control in the branch learning model (Q1575709) (← links)
• Finite variability interpretation of monadic logic of order (Q1606122) (← links)
• Hierarchical information and the synthesis of distributed strategies (Q1629748) (← links)
• Model-checking iterated games (Q1674862) (← links)
• Supervisory control and reactive synthesis: a comparative introduction (Q1693819) (← links)
• Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics (Q1749477) (← links)
• Energy parity games (Q1758152) (← links)
• Learning to win process-control games watching game-masters (Q1854518) (← links)
• On omega context free languages which are Borel sets of infinite rank. (Q1874398) (← links)
• Quantitative solution of omega-regular games (Q1887716) (← links)
• On control of systems modelled as deterministic Rabin automata (Q1902499) (← links)
• McNaughton games and extracting strategies for concurrent programs (Q1919769) (← links)
• Decidability of well-connectedness for distributed synthesis (Q1941703) (← links)
• \( \omega \)-automata (Q2074208) (← links)
• Automata on infinite trees (Q2074210) (← links)
• Reactive synthesis from visibly register pushdown automata (Q2119985) (← links)
• Certifying DFA bounds for recognition and separation (Q2147179) (← links)
• Finite-state strategies in delay games (Q2182729) (← links)