The following pages link to (Q5725991):
Displaying 49 items.
- Synthesis with rational environments (Q314471) (← links)
- A survey of stochastic \(\omega \)-regular games (Q414898) (← links)
- Finding and fixing faults (Q414907) (← links)
- Towards a notion of unsatisfiable and unrealizable cores for LTL (Q433349) (← links)
- Synthesis of Reactive(1) designs (Q439954) (← links)
- Synthesis from scenario-based specifications (Q439960) (← links)
- Synthesis of deterministic top-down tree transducers from automatic tree relations (Q515670) (← links)
- Optimal paths in weighted timed automata (Q596026) (← links)
- Choice functions and well-orderings over the infinite binary tree (Q607442) (← links)
- The Church problem for expansions of \((\mathbb{N},<)\) by unary predicates (Q690498) (← links)
- Counting branches in trees using games (Q729823) (← links)
- Supervision based on place invariants: a survey (Q858151) (← links)
- Synchronous counting and computational algorithm design (Q896024) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- Automata over continuous time (Q1399970) (← links)
- Compositional and symbolic synthesis of reactive controllers for multi-agent systems (Q1641032) (← links)
- Supervisory control and reactive synthesis: a comparative introduction (Q1693819) (← links)
- Decidability of well-connectedness for distributed synthesis (Q1941703) (← links)
- Vacuity in synthesis (Q2058393) (← links)
- Strategy synthesis for multi-dimensional quantitative objectives (Q2249657) (← links)
- Efficient controller synthesis for a fragment of \(\mathrm{MTL}_{0,\infty}\) (Q2249659) (← links)
- Compositional construction of most general controllers (Q2350495) (← links)
- Synthesis of succinct systems (Q2353397) (← links)
- The computational complexity of scenario-based agent verification and design (Q2372186) (← links)
- Distributed synthesis is simply undecidable (Q2445907) (← links)
- Effective Synthesis of Asynchronous Systems from GR(1) Specifications (Q2891421) (← links)
- Randomization in Automata on Infinite Trees (Q2946733) (← links)
- Synthesizing Non-Vacuous Systems (Q2961552) (← links)
- Graph Games and Reactive Synthesis (Q3176385) (← links)
- On Distributed Monitoring and Synthesis (Q3195680) (← links)
- On Synthesis of Specifications with Arithmetic (Q3297765) (← links)
- Playing with Repetitions in Data Words Using Energy Games (Q3300789) (← links)
- Distributed Synthesis for Alternating-Time Logics (Q3510801) (← links)
- Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets (Q3543289) (← links)
- Facets of Synthesis: Revisiting Church’s Problem (Q3617717) (← links)
- Decidable Extensions of Church’s Problem (Q3644764) (← links)
- (Q5002830) (← links)
- (Q5005148) (← links)
- (Q5021006) (← links)
- (Q5089310) (← links)
- (Q5094153) (← links)
- From Logic to Theoretical Computer Science – An Update (Q5452171) (← links)
- Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey (Q5452198) (← links)
- Church’s Problem and a Tour through Automata Theory (Q5452202) (← links)
- From Monadic Logic to PSL (Q5452203) (← links)
- Measuring and Synthesizing Systems in Probabilistic Environments (Q5501954) (← links)
- (Q5743484) (← links)
- Combinations of Qualitative Winning for Stochastic Parity Games (Q5875367) (← links)
- (Q5875386) (← links)
