Distributed Synthesis for Alternating-Time Logics
From MaRDI portal
Recommendations
Cites work
- Alternating tree automata, parity games, and modal -calculus
- Alternating-time temporal logic
- Automated Technology for Verification and Analysis
- Church's Problem Revisited
- scientific article; zbMATH DE number 3870578 (Why is no real title available?)
- scientific article; zbMATH DE number 3767031 (Why is no real title available?)
- scientific article; zbMATH DE number 1759436 (Why is no real title available?)
- scientific article; zbMATH DE number 3189696 (Why is no real title available?)
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
Cited in
(10)- Distributed synthesis for parameterized temporal logics
- Distributed synthesis in continuous time
- SEMI-AUTOMATIC DISTRIBUTED SYNTHESIS
- scientific article; zbMATH DE number 1258216 (Why is no real title available?)
- Distributed PROMPT-LTL synthesis
- Symmetric synthesis
- Automated Technology for Verification and Analysis
- CONCUR 2005 – Concurrency Theory
- Verification of multi-agent systems with public actions against strategy logic
- Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs
This page was built for publication: Distributed Synthesis for Alternating-Time Logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3510801)