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.
Type de document :
[Research Report] PI 1839, 2007, pp.36
Liste complète des métadonnées

Littérature citée [46 références]  Voir  Masquer  Télécharger
Contributeur : Anne Jaigu <>
Soumis le : mardi 10 avril 2007 - 13:35:12
Dernière modification le : vendredi 12 octobre 2018 - 01:18:02
Document(s) archivé(s) le : mardi 6 avril 2010 - 22:51:31


Fichiers produits par l'(les) auteur(s)


  • HAL Id : inria-00140831, version 1



Tristan Le Gall, Bertrand Jeannet. Analysis of Communicating Infinite State Machines using Lattice Automata. [Research Report] PI 1839, 2007, pp.36. 〈inria-00140831〉



Consultations de la notice


Téléchargements de fichiers