HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

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.
Document type :
Complete list of metadata

Cited literature [46 references]  Display  Hide  Download

Contributor : Anne Jaigu Connect in order to contact the contributor
Submitted on : Tuesday, April 10, 2007 - 1:35:12 PM
Last modification on : Friday, February 4, 2022 - 3:24:20 AM
Long-term archiving on: : Tuesday, April 6, 2010 - 10:51:31 PM


Files produced by the author(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⟩



Record views


Files downloads