Weak Alternating Timed Automata

Pawel Parys (1) , Igor Walukiewicz (2)

1 Institute of Informatics [Warsaw]
2 LaBRI - Laboratoire Bordelais de Recherche en Informatique

Alternating timed automata on infinite words are considered. The main result is the characterization of acceptance conditions for which the emptiness problem for the 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 constrains are allowed.

Mots clés: Real-time; Alternating Timed Automata; temporal logics

Domaines: Logique en informatique [cs.LO]

Pawel Parys, Igor Walukiewicz. Weak Alternating Timed Automata. ICALP'09, 2009, Greece. pp.273--284. ⟨hal-00360122v2⟩