Skip to Main content Skip to Navigation

Vérification d'automates étendus : algorithmes d'analyse symbolique et mise en oeuvre

Abstract : Within the framework of telecommunication, the companies develop protocols performing the data transfer between machines. These protocols work on the principle of sending of messages between two parts via unreliable channels. To make sure that all the messages were received, the techniques employed consist in re-emitting the lost messages and/or awaiting a lapse of time determined before deciding of the failure from the transmission. Moreover, the systems are often modelled according to parameters. We worked on a mathematical model allowing the verification of specifications (awaited behaviors of the systems) for protocols handling at the same time counters, queues or clocks, as well as parameters. The goal of the analysis is to calculate the set of the behaviors possible for the system then to check that none them violates an awaited specification. The problem here is that this set is infinite. Indeed, a behavior is a function of the values taken by the variables of the system during the execution and some are defined on an infinite field. It is then necessary to be able to represent these behaviors in a finished way and to also find methods to calculate in a finished time an infinite set. More formally, we placed ourselves within the framework of the automatic analysis of the systems (model-checking). The selected representation for the models with counters and clocks parameterized is an extension of the bounded matrices for which we have an exact method of acceleration (calculation in a finished time of sets of infinite behaviors). Practical side, we established these methods in a tool TReX which is, to our knowledge, only being able to handle in an exact way of the counters, the clocks and the queues. We could check consequent examples such as the bounded retransmission protocol.
Document type :
Complete list of metadatas
Contributor : Thèses Imag <>
Submitted on : Tuesday, January 27, 2004 - 9:35:56 AM
Last modification on : Thursday, November 19, 2020 - 3:58:01 PM
Long-term archiving on: : Friday, April 2, 2010 - 8:04:57 PM


  • HAL Id : tel-00004334, version 1




Aurore Annichini Collomb. Vérification d'automates étendus : algorithmes d'analyse symbolique et mise en oeuvre. Autre [cs.OH]. Université Joseph-Fourier - Grenoble I, 2001. Français. ⟨tel-00004334⟩



Record views


Files downloads