Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:episciences.org:lmcs:1214

Weak Alternating Timed Automata

Authors
Publication date
19 September 2012
Publisher
Doi

    Abstract

    Alternating timed automata on infinite words are considered. The main resultis a characterization of acceptance conditions for which the emptiness problemfor these automata is decidable. This result implies new decidability resultsfor fragments of timed temporal logics. It is also shown that, unlike for MITL,the characterisation remains the same even if no punctual constraints areallowed

    Similar works

    Full text

    thumbnail-image

    Episciences.org

    redirect
    oaioai:episciences.org:lmcs:1214
    Last time updated on 02/12/2023

    This paper was published in Episciences.org.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.