Abstract. We extend the framework of ATL model-checking to "simply timed" concurrent game structures, i.e., multi-agent structures where each transition carry an integral duration (or interval thereof). While the case of single durations is easily handled from the semantics point of view, intervals of durations raise several interesting questions. Moreover subtle algorithmic problems have to be handled when dealing with model checking. We propose a semantics for which we develop efficient (PTIME) algorithms for timed ATL without equality constraints, while the general case is shown to be EXPTIME-complete.
ATL was also extended to simply timed concurrent game structure REF .
Model checking timed ATL for durational concurrent game structures
In Proc. 4th Intl Conf. on Formal Modeling and Analysis of Timed Systems (FORMATS’06), LNCS 4202
Computer Science