Church's Problem Revisited
From MaRDI portal
Publication:4262605
DOI10.2307/421091zbMath0932.03029MaRDI QIDQ4262605
Moshe Y. Vardi, Orna Kupferman
Publication date: 22 September 1999
Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/4470e014837a60ede7678296d7ac2ff1dc35bdc4
specification; alternation; alternating tree automata; program synthesis; open system; closed system; branching temporal logics; linear temporal logics; synthesis with incomplete information
03B70: Logic in computer science
03D05: Automata and formal grammars in connection with logical questions
68Q60: Specification and verification (program logics, model checking, etc.)
03B44: Temporal logic
Cites Work
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
- Using branching time temporal logic to synthesize synchronization skeletons
- Alternating automata on infinite trees
- The temporal semantics of concurrent programs
- Decision procedures and expressiveness in the temporal logic of branching time
- Deciding full branching time logic
- “Sometimes” and “not never” revisited
- A Deductive Approach to Program Synthesis