Church's Problem Revisited

DOI10.2307/421091MaRDI QIDQ4262605zbMATH OpenOpenAlexFDO

Authors Orna Kupferman, Moshe Y. Vardi

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, http://www.math.ucla.edu/~asl/bsl/0502-toc.htm

zbMATH Keywords

alternating tree automataalternationbranching temporal logicsclosed systemlinear temporal logicsopen systemprogram synthesisspecificationsynthesis with incomplete information

Mathematics Subject Classification ID

Temporal logic (03B44) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 1444727
• scientific article; zbMATH DE number 1759436
• SEMI-AUTOMATIC DISTRIBUTED SYNTHESIS
• Automated Technology for Verification and Analysis

Cites work

• A Deductive Approach to Program Synthesis
• Alternating automata on infinite trees
• Deciding full branching time logic
• Decision procedures and expressiveness in the temporal logic of branching time
• Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
• The temporal semantics of concurrent programs
• Using branching time temporal logic to synthesize synchronization skeletons
• “Sometimes” and “not never” revisited

Cited in

(28)

• Latticed-LTL synthesis in the presence of noisy inputs
• Supervisory control and reactive synthesis: a comparative introduction
• CTL^ with graded path modalities
• GR(1)*: GR(1) specifications extended with existential guarantees
• Synthesis in presence of dynamic links
• Distributed synthesis for regular and contextfree specifications
• On the affirmative solution to Salem's problem
• Synthesizing structured reactive programs via deterministic tree automata
• Modular strategies for recursive game graphs
• Synthesis with rational environments
• SEMI-AUTOMATIC DISTRIBUTED SYNTHESIS
• Distributed Synthesis for Alternating-Time Logics
• ATL* Satisfiability Is 2EXPTIME-Complete
• Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems
• Synthesis of fault-tolerant distributed systems
• Finding and fixing faults
• scientific article; zbMATH DE number 1759436 (Why is no real title available?)
• scientific article; zbMATH DE number 1444727 (Why is no real title available?)
• scientific article; zbMATH DE number 7455739 (Why is no real title available?)
• Automated synthesis: a distributed viewpoint
• Assume-guarantee synthesis for concurrent reactive programs with partial information
• Sensing as a complexity measure
• scientific article; zbMATH DE number 5241980 (Why is no real title available?)
• scientific article; zbMATH DE number 3289402 (Why is no real title available?)
• scientific article; zbMATH DE number 7594201 (Why is no real title available?)
• DEL-sequents for progression
• DEL-sequents for progression
• Distributed synthesis for well-connected architectures

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)