Alternating timed automata over bounded time

Mark Jenkins*, Joël Ouaknine, Alexander Rabinovich, James Worrell

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

13 Scopus citations


Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, in providing verification algorithms for prominent specification formalisms such as Metric Temporal Logic. Unfortunately, when interpreted over an infinite dense time domain (such as the reals), alternating timed automata have an undecidable language emptiness problem. The main result of this paper is that, over bounded time domains, language emptiness for alternating timed automata is decidable (but nonelementary). The proof involves showing decidability of a class of parametric McNaughton games that are played over timed words and that have winning conditions expressed in the monadic logic of order augmented with the distance-one relation. As a corollary, we establish the decidability of the time-bounded model-checking problem for Alur-Dill timed automata against specifications expressed as alternating timed automata.

Original languageEnglish
Title of host publicationProceedings - 25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages10
ISBN (Print)9780769541143
StatePublished - 2010
Event25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010 - Edinburgh, United Kingdom
Duration: 11 Jul 201014 Jul 2010

Publication series

NameProceedings - Symposium on Logic in Computer Science
ISSN (Print)1043-6871


Conference25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010
Country/TerritoryUnited Kingdom


FundersFunder number
Engineering and Physical Sciences Research CouncilEP/G069727/1, EP/H005617/1, EP/E049028/1, EP/H018581/1


    • Alternation
    • Church's problem
    • Timed automata


    Dive into the research topics of 'Alternating timed automata over bounded time'. Together they form a unique fingerprint.

    Cite this