Timed Concurrent Game Structures
Résumé
We propose a new model for timed games, based on concurrent game structures~(CGSs). Compared to the classical \emphtimed game automata of~Asarin \emphet~al., our timed~CGSs are "more concurrent", in the sense that they always allow all the agents to act on the system, independently of the delay they want to elapse before their action. Timed CGSs weaken the "element of surprise" of timed game automata reported by de~Alfaro \emphet~al.\par We prove that our model has nice properties, in particular that model-checking timed CGSs against timed \(\textsfATL\) is decidable \emphvia region abstraction, and in particular that strategies are "region-stable" if winning objectives are. We also propose a new extension of \(\textsfTATL\), containing~\(\textsfATL^*\), which we call~\(\textsfTALTL\). We~prove that model-checking this logic remains decidable on timed CGSs. Last, we explain how our algorithms can be adapted in order to rule out Zeno (co-)strategies, based on the ideas of Henzinger \emphet~al.
Domaines
Logique en informatique [cs.LO]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...