Skip to Main content Skip to Navigation
New interface

L'analyse formelle des systèmes temporisés en pratique

Abstract : In this thesis we propose a complete formal framework for the analysis of timed systems, with the emphasis given on the practicality of the approach. We describe timed systems in the formal model of timed automata, finite-discrete-state automata equipped with clocks in a dense-time domain. Properties of such systems are expressed in the linear-time formalism of timed Büchi automata (timed automata with acceptance conditions), or in one of the branching-time logics CTL, TCTL or \etctl. These formalisms cover a large spectrum of properties on the order of events and the timing constraints on the delays between events. We also examine other interesting properties such as deadlock and timelock freedom or reachability. We consider two types of analysis. Verification : given a system and a property, check whether the system satisfies the property. Controller synthesis : given a system and a property, find a restriction of the system which satisfies the property. These problems have been proven decidable in previous works, however, with a high (exponential) complexity, basically due to the fact that the state space is extremely large (state explosion) and has to be entirely generated and explored. To respond to the challenge of making the approach tractable, we propose methods which are efficient in practice, despite of the high worst-case theoretical complexity. Our approach is based on two key elements. First, on abstractions which reduce the concrete state space to a much smaller abstract state space, while preserving all properties of interest. Second, on efficient techniques to compute and explore the abstract state space. We define two sets of abstractions and study the properties they preserve. Time-abstracting bisimulations are equivalences which hide the quantitative aspect of time : we know that some time passes, but not how much. The stronger of these bisimulations preserves all properties of interest. Time-abstracting simulations are abstractions derived by a forward reachability analysis on the system. These abstractions preserve only linear properties. The analysis methods differ depending on the underlying abstraction(s) used. In the case of bisimulations, the approach consists in two steps : first, generate the time-abstracting quotient of the state space, then apply classical (untimed) analysis techniques to the quotient to prove properties of the concrete system. In the case of simulations, the generation of the abstract state space and the analysis are performed at the same time. This technique is called on-the-fly and can often provide fast answers without having to generate the entire (abstract) state space. We develop on-the-fly verification techniques for TBA and ETCTL. To make the verification task easier for the user, we develop techniques for extracting concrete diagnostic sequences (both finite and infinite) from the abstract sequences usually returned by the algorithms. The concrete diagnostics contain information both about the discrete state changes as well as the exact time delays during the execution. For the problem of controller synthesis, we develop an on-the-fly algorithm for untimed systems and use on the time-abstracting quotient to solve the problem in the timed setting. To put our methods to the test, we have implemented the algorithms developed in the thesis, on top of Kronos, the real-time tool-suite of Verimag. We have extended Kronos with a number of functionalities, including time-abstracting quotient generation, on-the-fly parallel composition of TA, on-the-fly TBA verification, concrete diagnostic generation and controller synthesis. We have also connected Kronos to the verification programming environment Open-Caesar, developed at INRIA and Verimag. Using Kronos, we have treated a number of non-trivial case studies, including two industrial communication protocols by CNET and Bang&Olufsen, the asynchronous electronic circuit Stari, a multimedia document authoring language developed at INRIA, a real-time scheduling example and a benchmark example for timed verification tools. The analysis results have been interesting. Sometimes we found errors in the systems and in the case of multimedia documents we managed to solve a scheduling problem using controller synthesis techniques. The performance results have been encouraging. Most of the times we managed to improve the results of previous versions of Kronos and other similar verification tools by many orders of magnitude.
Document type :
Complete list of metadata
Contributor : Ist Rennes Connect in order to contact the contributor
Submitted on : Monday, July 30, 2012 - 9:26:05 AM
Last modification on : Friday, March 25, 2022 - 11:10:29 AM
Long-term archiving on: : Friday, December 16, 2016 - 3:31:40 AM


  • HAL Id : tel-00004907, version 2



Stavros Tripakis. L'analyse formelle des systèmes temporisés en pratique. Autre [cs.OH]. Université Joseph-Fourier - Grenoble I, 1998. Français. ⟨NNT : ⟩. ⟨tel-00004907v2⟩



Record views


Files downloads