Model checking real-time systems
This chapter surveys timed automata as a formalism for model checking real-time systems.
We begin with introducing the model, as an extension of finite-state automata with real …
We begin with introducing the model, as an extension of finite-state automata with real …
DryVR: Data-Driven Verification and Compositional Reasoning for Automotive Systems
We present the DryVR framework for verifying hybrid control systems that are described by a
combination of a black-box simulator for trajectories and a white-box transition graph …
combination of a black-box simulator for trajectories and a white-box transition graph …
On the decidability of metric temporal logic
J Ouaknine, J Worrell - 20th Annual IEEE Symposium on Logic …, 2005 - ieeexplore.ieee.org
Metric temporal logic (MTL) is a prominent specification formalism for real-time systems. In
this paper, we show that the satisfiability problem for MTL over finite timed words is …
this paper, we show that the satisfiability problem for MTL over finite timed words is …
Some recent results in metric temporal logic
J Ouaknine, J Worrell - International Conference on Formal Modeling and …, 2008 - Springer
Abstract Metric Temporal Logic (MTL) is a widely-studied real-time extension of Linear
Temporal Logic. In this paper we survey results about the complexity of the satisfiability and …
Temporal Logic. In this paper we survey results about the complexity of the satisfiability and …
Decision problems for timed automata: A survey
R Alur, P Madhusudan - Formal Methods for the Design of Real-Time …, 2004 - Springer
Finite automata and regular languages have been useful in a wide variety of problems in
computing, communication and control, including formal modeling and verification …
computing, communication and control, including formal modeling and verification …
On the decidability and complexity of metric temporal logic over finite words
J Ouaknine, J Worrell - Logical Methods in Computer Science, 2007 - lmcs.episciences.org
Metric Temporal Logic (MTL) is a prominent specification formalism for real-time systems. In
this paper, we show that the satisfiability problem for MTL over finite timed words is …
this paper, we show that the satisfiability problem for MTL over finite timed words is …
Learning one-clock timed automata
We present an algorithm for active learning of deterministic timed automata with a single
clock. The algorithm is within the framework of Angluin's L^* algorithm and inspired by …
clock. The algorithm is within the framework of Angluin's L^* algorithm and inspired by …
Model checking timed and stochastic properties with CSL^{TA}
S Donatelli, S Haddad… - IEEE Transactions on …, 2008 - ieeexplore.ieee.org
Markov chains are a well-known stochastic process that provide a balance between being
able to adequately model the system's behavior and being able to afford the cost of the …
able to adequately model the system's behavior and being able to afford the cost of the …
When are timed automata determinizable?
In this paper, we propose an abstract procedure which, given a timed automaton, produces
a language-equivalent deterministic infinite timed tree. We prove that under a certain …
a language-equivalent deterministic infinite timed tree. We prove that under a certain …
Undecidable problems about timed automata
O Finkel - Formal Modeling and Analysis of Timed Systems: 4th …, 2006 - Springer
We solve some decision problems for timed automata which were raised by S. Tripakis in
[Tri04] and by E. Asarin in [Asa04]. In particular, we show that one cannot decide whether a …
[Tri04] and by E. Asarin in [Asa04]. In particular, we show that one cannot decide whether a …