Weak Alternating Timed AutomataReport as inadecuate

Weak Alternating Timed Automata - Download this document for free, or read online. Document in PDF available to download.

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

Abstract : 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.

keyword : Real-time Alternating Timed Automata temporal logics

Author: Pawel Parys - Igor Walukiewicz -

Source: https://hal.archives-ouvertes.fr/


Related documents