Pages that link to "Item:Q3176385"

The following pages link to Graph Games and Reactive Synthesis (Q3176385):

Displaying 33 items.

• Active learning of sequential transducers with side information about the domain (Q832921) (← links)
• Decoy allocation games on graphs with temporal logic objectives (Q2056945) (← links)
• Reactive synthesis from visibly register pushdown automata (Q2119985) (← links)
• Certifying inexpressibility (Q2233423) (← links)
• Using the compatibility analysis of logical specifications of automata to solve game problems (Q2263301) (← links)
• Synthesizing adaptive test strategies from temporal logic specifications (Q2280227) (← links)
• Practical synthesis of reactive systems from LTL specifications via parity games (Q2303871) (← links)
• Synthesising features by games (Q2863856) (← links)
• Temporal Logic and Fair Discrete Systems (Q3176360) (← links)
• Combining Model Checking and Deduction (Q3176378) (← links)
• The mu-calculus and Model Checking (Q3176384) (← links)
• On Synthesis of Specifications with Arithmetic (Q3297765) (← links)
• (Q5028465) (← links)
• On Repetition Languages (Q5089230) (← links)
• (Q5089265) (← links)
• (Q5089289) (← links)
• Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions (Q5090979) (← links)
• (Q5856426) (← links)
• (Q5875382) (← links)
• Synthesis of Data Word Transducers (Q5875385) (← links)
• (Q5875386) (← links)
• Specifiable robustness in reactive synthesis (Q6102166) (← links)
• Church synthesis on register automata over linearly ordered data domains (Q6151760) (← links)
• LTL reactive synthesis with a few hints (Q6536136) (← links)
• Infinite separation between general and chromatic memory (Q6547948) (← links)
• From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism (Q6566473) (← links)
• Characterizing omega-regularity through finite-memory determinacy of games on infinite graphs (Q6566586) (← links)
• Half-positional objectives recognized by deterministic Büchi automata (Q6597970) (← links)
• A game-theoretic approach to indistinguishability of winning objectives as user privacy (Q6605339) (← links)
• Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete (Q6623016) (← links)
• Synthesis with privacy against an observer (Q6629463) (← links)
• Different strokes in randomised strategies: revisiting Kuhn's theorem under finite-memory assumptions (Q6647764) (← links)
• Adapting to the behavior of environments with bounded memory (Q6649514) (← links)