134 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
Verification of temporal properties of infinite state systems
No es ningún secreto que tanto los sistemas software como hardware generalmente presentan
errores. Los métodos de testeo y simulación pueden identificar muchos problemas importantes,
pero para sistemas que tienen requerimientos de seguridad o que son económicamente críticos, es
indispensable llevar a cabo una verificación exhaustiva. Tal análisis se puede realizar utilizando
métodos de verificación formal.
Un enfoque de la verificación formal es la verificación de modelos, que es un proceso totalmente
automático basado en la construcción de modelos abstractos para representar sistemas. Poste-
riormente, sobre estos modelos se comprueban propiedades deseadas del sistema, normalmente
expresadas en alguna lógica temporal, como por ejemplo lógica linear temporal. Las propiedades
expresadas con fórmulas de lógica linear temporal pueden describir el orden de los eventos en el
tiempo sin describir el tiempo explícitamente. Por eso mismo, son útiles a la hora de verificar las
posibles ejecuciones de un sistema.
Este proyecto pretende implementar algoritmos de verificación de modelos que determinen si una
fórmula de lógica linear temporal que exprese una propiedad de un cierto sistema es satisfecha por
éste.It is no secret that computer software programs, computer hardware designs, and computer sys-
tems in general exhibit errors. Testing and simulation methods can identify many significant
problems, but for systems that have safety or economically critical requirements, exhaustive ver-
ification is indispensable. Such exhaustive analysis can be performed with the use of formal
verification methods.
One approach to formal verification is model checking, which is a fully automated process based
on the construction of abstract models to represent systems. These models are then checked
against desired properties defining a specification, usually expressed in some temporal logic, such
as linear temporal logic (LTL). Temporal properties can describe the ordering of events in time
without introducing time explicitly, thereby being useful when verifying the possible executions
of a system.
This project aims to implement model checking algorithms that determine whether an LTL formula
expressing a desired property is satisfied in a computing system
One Theorem to Rule Them All: A Unified Translation of LTL into {\omega}-Automata
We present a unified translation of LTL formulas into deterministic Rabin
automata, limit-deterministic B\"uchi automata, and nondeterministic B\"uchi
automata. The translations yield automata of asymptotically optimal size
(double or single exponential, respectively). All three translations are
derived from one single Master Theorem of purely logical nature. The Master
Theorem decomposes the language of a formula into a positive boolean
combination of languages that can be translated into {\omega}-automata by
elementary means. In particular, Safra's, ranking, and breakpoint constructions
used in other translations are not needed
Runtime Verification Using a Temporal Description Logic Revisited
Formulae of linear temporal logic (LTL) can be used to specify (wanted or unwanted) properties of a dynamical system. In model checking, the system’s behaviour is described by a transition system, and one needs to check whether all possible traces of this transition system satisfy the formula. In runtime verification, one observes the actual system behaviour, which at any point in time yields a finite prefix of a trace. The task is then to check whether all continuations of this prefix to a trace satisfy (violate) the formula. More precisely, one wants to construct a monitor, i.e., a finite automaton that receives the finite prefix as input and then gives the right answer based on the state currently reached. In this paper, we extend the known approaches to LTL runtime verification in two directions. First, instead of propositional LTL we use the more expressive temporal logic ALC-LTL, which can use axioms of the Description Logic (DL) ALC instead of propositional variables to describe properties of single states of the system. Second, instead of assuming that the observed system behaviour provides us with complete information about the states of the system, we assume that states are described in an incomplete way by ALC-knowledge bases. We show that also in this setting monitors can effectively be constructed. The (double-exponential) size of the constructed monitors is in fact optimal, and not higher than in the propositional case. As an auxiliary result, we show how to construct Büchi automata for ALC-LTL-formulae, which yields alternative proofs for the known upper bounds of deciding satisfiability in ALC-LTL
Robust Model-Checking of Linear-Time Properties in Timed Automata
International audienceFormal verification of timed systems is well understood, but their \emphimplementation is still challenging. Recent works by Raskin \emphet al. have brought out a model of parameterized timed automata that can be used to prove \emphimplementability of timed systems for safety properties. We define here a more general notion of robust model-checking for linear-time properties, which consists in verifying whether a property still holds even if the transitions are slightly delayed or expedited. We provide PSPACE algorithms for the robust model-checking of Büchi-like and LTL properties. We also verify bounded-response-time properties
Automata and temporal logic over arbitrary linear time
Linear temporal logic was introduced in order to reason about reactive
systems. It is often considered with respect to infinite words, to specify the
behaviour of long-running systems. One can consider more general models for
linear time, using words indexed by arbitrary linear orderings. We investigate
the connections between temporal logic and automata on linear orderings, as
introduced by Bruy\`ere and Carton. We provide a doubly exponential procedure
to compute from any LTL formula with Until, Since, and the Stavi connectives an
automaton that decides whether that formula holds on the input word. In
particular, since the emptiness problem for these automata is decidable, this
transformation gives a decision procedure for the satisfiability of the logic
Verification of temporal properties of infinite state systems
No es ningún secreto que tanto los sistemas software como hardware generalmente presentan
errores. Los métodos de testeo y simulación pueden identificar muchos problemas importantes,
pero para sistemas que tienen requerimientos de seguridad o que son económicamente críticos, es
indispensable llevar a cabo una verificación exhaustiva. Tal análisis se puede realizar utilizando
métodos de verificación formal.
Un enfoque de la verificación formal es la verificación de modelos, que es un proceso totalmente
automático basado en la construcción de modelos abstractos para representar sistemas. Poste-
riormente, sobre estos modelos se comprueban propiedades deseadas del sistema, normalmente
expresadas en alguna lógica temporal, como por ejemplo lógica linear temporal. Las propiedades
expresadas con fórmulas de lógica linear temporal pueden describir el orden de los eventos en el
tiempo sin describir el tiempo explícitamente. Por eso mismo, son útiles a la hora de verificar las
posibles ejecuciones de un sistema.
Este proyecto pretende implementar algoritmos de verificación de modelos que determinen si una
fórmula de lógica linear temporal que exprese una propiedad de un cierto sistema es satisfecha por
éste.It is no secret that computer software programs, computer hardware designs, and computer sys-
tems in general exhibit errors. Testing and simulation methods can identify many significant
problems, but for systems that have safety or economically critical requirements, exhaustive ver-
ification is indispensable. Such exhaustive analysis can be performed with the use of formal
verification methods.
One approach to formal verification is model checking, which is a fully automated process based
on the construction of abstract models to represent systems. These models are then checked
against desired properties defining a specification, usually expressed in some temporal logic, such
as linear temporal logic (LTL). Temporal properties can describe the ordering of events in time
without introducing time explicitly, thereby being useful when verifying the possible executions
of a system.
This project aims to implement model checking algorithms that determine whether an LTL formula
expressing a desired property is satisfied in a computing system
- …