On Timed Alternating Simulation for Concurrent Timed Games

Authors Laura Bozzelli, Axel Legay, Sophie Pinchinat

Thumbnail PDF


  • Filesize: 155 kB
  • 12 pages

Document Identifiers

Author Details

Laura Bozzelli
Axel Legay
Sophie Pinchinat

Cite AsGet BibTex

Laura Bozzelli, Axel Legay, and Sophie Pinchinat. On Timed Alternating Simulation for Concurrent Timed Games. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 85-96, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)


We address the problem of alternating simulation refinement for concurrent timed games (\TG). We show that checking timed alternating simulation between\TG is \EXPTIME-complete, and provide a logical characterization of thispreorder in terms of a meaningful fragment of a new logic, \TAMTLSTAR.\TAMTLSTAR is an action-based timed extension of standard alternating-timetemporal logic \ATLSTAR, which allows to quantify on strategies where thedesignated player is not responsible for blocking time. While for full \TAMTLSTAR, model-checking \TG is undecidable, we show that for its fragment \TAMTL, corresponding to the timed version of \ATL, in \EXPTIME.
  • Concurrent Timed Games
  • Timed Alternating Simulation
  • Timed Alternating Temporal Logics


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads