Analysis of Communicating Infinite State Machines using Lattice Automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2007

Analysis of Communicating Infinite State Machines using Lattice Automata

Abstract

Communication protocols can be formally described by the Communicating Finite-State Machines~(CFSM) model. This model is expressive, but not expressive enough to deal with complex protocols that involve structured messages encapsulating integers or lists of integers. This is the reason why we propose an extension of this model : the Symbolic Communicating Machines (SCM). We also propose an approximate reachability analysis method, based on lattice automata. Lattice automata are finite automata, the transitions of which are labeled with elements of an atomic lattice. We tackle the problem of the determinization as well as the definition of a widening operator for these automata. We also show that lattice automata are useful for the interprocedural analysis.
Fichier principal
Vignette du fichier
PI-1839.pdf (372.29 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00140831 , version 1 (10-04-2007)

Identifiers

  • HAL Id : inria-00140831 , version 1

Cite

Tristan Le Gall, Bertrand Jeannet. Analysis of Communicating Infinite State Machines using Lattice Automata. [Research Report] PI 1839, 2007, pp.36. ⟨inria-00140831⟩
197 View
224 Download

Share

Gmail Facebook Twitter LinkedIn More