Weak Alternating Timed Automata

Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for these automata is decidable. This result implies new decidability results for fragments of timed temporal logics. It is also shown that, unl...

Full description

Saved in:
Bibliographic Details
Published inLogical methods in computer science Vol. 8, Issue 3; no. 3; pp. 1 - 27
Main Authors Parys, Pawel, Walukiewicz, Igor
Format Journal Article
LanguageEnglish
Published Logical Methods in Computer Science Association 19.09.2012
Logical Methods in Computer Science e.V
Subjects
Computer Science
computer science - logic in computer science
f.1.1, f.4.3
Logic in Computer Science
alternating timed automata
verification
timed systems
Online AccessGet full text

Cover

More Information
Summary:Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for these automata is decidable. This result implies new decidability results for fragments of timed temporal logics. It is also shown that, unlike for MITL, the characterisation remains the same even if no punctual constraints are allowed.
ISSN:1860-5974
1860-5974
DOI:10.2168/LMCS-8(3:18)2012