The following pages link to Church's Problem Revisited (Q4262605):
Displaying 21 items.
- Synthesis with rational environments (Q314471) (← links)
- Finding and fixing faults (Q414907) (← links)
- Distributed synthesis for well-connected architectures (Q842581) (← links)
- Latticed-LTL synthesis in the presence of noisy inputs (Q1677194) (← links)
- Supervisory control and reactive synthesis: a comparative introduction (Q1693819) (← links)
- CTL\(^\ast\) with graded path modalities (Q1784942) (← links)
- GR(1)*: GR(1) specifications extended with existential guarantees (Q1982646) (← links)
- Synthesis in presence of dynamic links (Q2105465) (← links)
- Distributed synthesis for regular and contextfree specifications (Q2249664) (← links)
- Synthesizing structured reactive programs via deterministic tree automata (Q2346409) (← links)
- Modular strategies for recursive game graphs (Q2368953) (← links)
- SEMI-AUTOMATIC DISTRIBUTED SYNTHESIS (Q3426790) (← links)
- Distributed Synthesis for Alternating-Time Logics (Q3510801) (← links)
- ATL* Satisfiability Is 2EXPTIME-Complete (Q3519515) (← links)
- Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems (Q3599069) (← links)
- Synthesis of Fault-Tolerant Distributed Systems (Q3648709) (← links)
- (Q5020999) (← links)
- Automated Synthesis: a Distributed Viewpoint (Q5136292) (← links)
- Sensing as a Complexity Measure (Q5205034) (← links)
- DEL-sequents for progression (Q5891665) (← links)
- DEL-sequents for progression (Q5891666) (← links)
