Pawel Parys ; Igor Walukiewicz - Weak Alternating Timed Automata

lmcs:1214 - Logical Methods in Computer Science, September 19, 2012, Volume 8, Issue 3 -
Weak Alternating Timed AutomataArticle

Authors: Pawel Parys ; Igor Walukiewicz

    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.

    Volume: Volume 8, Issue 3
    Published on: September 19, 2012
    Imported on: December 1, 2009
    Keywords: Computer Science - Logic in Computer Science,F.1.1, F.4.3

    1 Document citing this article

    Consultation statistics

    This page has been seen 941 times.
    This article's PDF has been downloaded 353 times.