A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
On the Expressiveness and Complexity of ATL
[chapter]
Foundations of Software Science and Computational Structures
ATL is a temporal logic geared towards the specification and verification of properties in multi-agents systems. It allows to reason on the existence of strategies for coalitions of agents in order to enforce a given property. We prove that the standard definition of ATL (built on modalities "Next", "Always" and "Until") has to be completed in order to express the duals of its modalities: it is necessary to add the modality "Release". We then precisely characterize the complexity of ATL
doi:10.1007/978-3-540-71389-0_18
dblp:conf/fossacs/LaroussinieMO07
fatcat:hhxmacfvffcqxeavvh2co7d6eu