115 research outputs found
Mightyl: A compositional translation from mitl to timed automata
Metric Interval Temporal Logic (MITL) was first proposed in the early 1990s as a specification formalism for real-time systems. Apart from its appealing intuitive syntax, there are also theoretical evidences that make MITL a prime real-time counterpart of Linear Temporal Logic (LTL). Unfortunately, the tool support for MITL verification is still lacking to this day. In this paper, we propose a new construction from MITL to timed automata via very-weak one-clock alternating timed automata. Our construction subsumes the well-known construction from LTL to BĂĽchi automata by Gastin and Oddoux and yet has the additional benefits of being compositional and integrating easily with existing tools. We implement the construction in our new tool MightyL and report on experiments using Uppaal and LTSmin as back-ends
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 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
Real-time and Probabilistic Temporal Logics: An Overview
Over the last two decades, there has been an extensive study on logical
formalisms for specifying and verifying real-time systems. Temporal logics have
been an important research subject within this direction. Although numerous
logics have been introduced for the formal specification of real-time and
complex systems, an up to date comprehensive analysis of these logics does not
exist in the literature. In this paper we analyse real-time and probabilistic
temporal logics which have been widely used in this field. We extrapolate the
notions of decidability, axiomatizability, expressiveness, model checking, etc.
for each logic analysed. We also provide a comparison of features of the
temporal logics discussed
Deciding the Satisfiability of MITL Specifications
In this paper we present a satisfiability-preserving reduction from MITL
interpreted over finitely-variable continuous behaviors to Constraint LTL over
clocks, a variant of CLTL that is decidable, and for which an SMT-based bounded
satisfiability checker is available. The result is a new complete and effective
decision procedure for MITL. Although decision procedures for MITL already
exist, the automata-based techniques they employ appear to be very difficult to
realize in practice, and, to the best of our knowledge, no implementation
currently exists for them. A prototype tool for MITL based on the encoding
presented here has, instead, been implemented and is publicly available.Comment: In Proceedings GandALF 2013, arXiv:1307.416
Model-checking Timed Temporal Logics
AbstractIn this paper, we present several timed extensions of temporal logics, that can be used for model-checking real-time systems. We give different formalisms and the corresponding decidability/complexity results. We also give intuition to explain these results
- …