Church's Problem Revisited
DOI10.2307/421091zbMATH Open0932.03029OpenAlexW2024941371MaRDI QIDQ4262605FDOQ4262605
Moshe Y. Vardi, Orna Kupferman
Publication date: 22 September 1999
Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/4470e014837a60ede7678296d7ac2ff1dc35bdc4
specificationopen systemalternationprogram synthesisclosed systembranching temporal logicsalternating tree automatalinear temporal logicssynthesis with incomplete information
Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44) Logic in computer science (03B70)
Cites Work
- The temporal semantics of concurrent programs
- Using branching time temporal logic to synthesize synchronization skeletons
- Decision procedures and expressiveness in the temporal logic of branching time
- “Sometimes” and “not never” revisited
- Alternating automata on infinite trees
- Deciding full branching time logic
- A Deductive Approach to Program Synthesis
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
Cited In (25)
- Finding and fixing faults
- GR(1)*: GR(1) specifications extended with existential guarantees
- ATL* Satisfiability Is 2EXPTIME-Complete
- Synthesis in presence of dynamic links
- Distributed synthesis for well-connected architectures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Synthesis of Fault-Tolerant Distributed Systems
- CTL\(^\ast\) with graded path modalities
- Synthesizing structured reactive programs via deterministic tree automata
- Sensing as a Complexity Measure
- Supervisory control and reactive synthesis: a comparative introduction
- Distributed Synthesis for Alternating-Time Logics
- Automated Synthesis: a Distributed Viewpoint
- Modular strategies for recursive game graphs
- Synthesis with rational environments
- Distributed synthesis for regular and contextfree specifications
- Latticed-LTL synthesis in the presence of noisy inputs
- Title not available (Why is that?)
- SEMI-AUTOMATIC DISTRIBUTED SYNTHESIS
- On the affirmative solution to Salem's problem
- DEL-sequents for progression
- Title not available (Why is that?)
- Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems
- DEL-sequents for progression
This page was built for publication: Church's Problem Revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4262605)
