Distributed Synthesis for Alternating-Time Logics
From MaRDI portal
Publication:3510801
DOI10.1007/978-3-540-75596-8_20zbMath1141.68516OpenAlexW1492378530MaRDI QIDQ3510801
Publication date: 3 July 2008
Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-75596-8_20
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44)
Related Items
Cites Work
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
- Alternating-time temporal logic
- Church's Problem Revisited
- Automated Technology for Verification and Analysis
- Alternating tree automata, parity games, and modal \(\mu\)-calculus
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item