Weak Alternating Timed Automata - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

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





Autor: Pawel Parys - Igor Walukiewicz -

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

Enviar