On MITL and alternating timed automata

Authors:
Thomas Brihaye;Morgane Estiévenart;Gilles Geeraerts
Affiliations:
Département de Mathématiques, Université de Mons (UMONS), Belgium;Département de Mathématiques, Université de Mons (UMONS), Belgium;Département d'Informatique, Université Libre de Bruxelles (U.L.B.), Belgium
Venue:
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
Year:
2013

Citing 11
Cited 0

Specifying real-time properties with metric temporal logic

Real-Time Systems
The temporal specification and verification of real-time systems

The temporal specification and verification of real-time systems
Symbolic model checking: 1020 states and beyond

Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
A theory of timed automata

Theoretical Computer Science
The benefits of relaxing punctuality

Journal of the ACM (JACM)
On the Decidability of Metric Temporal Logic

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Alternating timed automata

ACM Transactions on Computational Logic (TOCL)
Antichains: alternative algorithms for LTL satisfiability and model-checking

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
From MITL to timed automata

FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Antichain algorithms for finite automata

TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
The unary fragments of metric interval temporal logic: bounded versus lower bound constraints

ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

One clock alternating timed automata (OCATA) have been recently introduced as natural extension of (one clock) timed automata to express the semantics of MTL [12]. We consider the application of OCATA to problem of model-checking MITL formulas (a syntactic fragment of MTL) against timed automata. We introduce a new semantics for OCATA where, intuitively, clock valuations are intervals instead of single values in ℝ. Thanks to this new semantics, we show that we can bound the number of clock copies that are necessary to allow an OCATA to recognise the models of an MITL formula. Equipped with this technique, we propose a new algorithm to translate an MITL formula into a timed automaton, and we sketch several ideas to define new model checking algorithms for MITL.