2014/04/03 by Dimitar P. Guelev
Computer Science · #cs.LO #cs.GT #cs.MA
paper · pdf · doi:10.4204/eptcs.146.8
published as EPTCS 146, 2014, pp. 57-63 · In Proceedings SR 2014, arXiv:1404.0414
arxiv created 2014/04/03 · arxiv updated 2014/04/04
We propose extending Alternating-time Temporal Logic (ATL) by an operator <i refines-to G> F to express that agent i can distribute its powers to a set of sub-agents G in a way which satisfies ATL condition f on the strategic ability of the coalitions they may form, possibly together with others agents. We prove the decidability of model-checking of formulas whose subformulas with this operator as the main connective have the form <i1 refines-to G1>...<im refines-to Gm> f, with no further occurrences of this operator in f.