The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
Alternating-time temporal logic
Journal of the ACM (JACM)
Distributed Controller Synthesis for Local Specifications
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Synthesizing Distributed Systems
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Alternating-time temporal logics with irrevocable strategies
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
Distributed reactive systems are hard to synthesize
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
ATL with Strategy Contexts and Bounded Memory
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
A decidable class of problems for control under partial observation
Information Processing Letters
A generic constructive solution for concurrent games with expressive constraints on strategies
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Satisfiability and finite model property for the alternating-time µ-calculus
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
What makes ATL* decidable? a decidable fragment of strategy logic
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
On the Boundary of Behavioral Strategies
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We introduce Coordination Logic (CL), a new temporal logic that reasons about the interplay between behavior and informedness in distributed systems. CL provides a logical representation for the distributed realizability problem and extends the game-based temporal logics, including the alternating-time temporal logics, strategy logic, and game logic, with quantification over strategies under incomplete information. We show that the structure in CL that results from the nesting of the quantifiers is sufficient to guarantee the decidability of the logic and at the same time general enough to subsume and extend all previously known decidable cases of the distributed realizability problem.