SEMI-AUTOMATIC DISTRIBUTED SYNTHESIS

DOI10.1142/S0129054107004590zbMath1112.68095OpenAlexW2059305812MaRDI QIDQ3426790

Bernd Finkbeiner, Sven Schewe

Publication date: 13 March 2007

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054107004590

zbMATH Keywords

synthesisrealizabilitytemporal logicconcurrency

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Temporal logic (03B44)

Cites Work

• Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
• Alternating automata on infinite trees
• Church's Problem Revisited