منابع مشابه
Weak Alternating Timed Automata
Alternating timed automata on infinite words are considered. The main result is a 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 constraints are allowed.
متن کاملExtended Timed Alternating Finite Automata: Revisited
In this paper, we continue to investigate timed alternating finite automata (TAFA), in particular we generalize the existing theory to the case of extended timed alternating finite automata (ETAFA). We define a framework extension of TAFA, study their power and properties. We develop an algebraic treatment of such ETAFA, along the lines of the algebraic treatment of systems of equations based o...
متن کاملOn MITL and Alternating Timed Automata
One clock alternating timed automata (OCATA) have been recently introducedas natural extension of (one clock) timed automata to express the semantics ofMTL [11]. We consider the application of OCATA to problem of model-checkingMITL formulas (a syntactic fragment of MTL) against timed automata. We intro-duce a new semantics for OCATA where, intuitively, clock valuations are i...
متن کاملOn MITL and Alternating Timed Automata over Infinite Words
One clock alternating timed automata (OCATA) have been introduced as natural extension of (one clock) timed automata to express the semantics of MTL [15]. In this paper, we consider the application of OCATA to the problems of model-checking and satisfiability for MITL (a syntactic fragment of MTL), interpreted over infinite words. Our approach is based on the interval semantics (recently introd...
متن کاملDecidability of Emptiness Checking in various Alternating Timed Automata and Connections to Timed Logics
In the initial parts of this thesis, we start by approaching the problem of decidability of emptiness of one variable alternating stopwatch automata. We start off by presenting an overview of important results in the field of hybrid systems and useful subclasses and their proofs. Then we go on to alternating timed automata and redo the previously known result that one clock ATA has decidable la...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2008
ISSN: 1529-3785,1557-945X
DOI: 10.1145/1342991.1342994