Skip to Main content Skip to Navigation

On the use of unfoldings to abstract communicating automata into sets of scenarios

Thomas Chatain 1 Loïc Hélouët 1 Claude Jard 1
1 DISTRIBCOM - Distributed and Iterative Algorithms for the Management of Telecommunications Systems
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : We consider the problem of automatic abstraction, from a low-level model given in term of network of interacting automata to a high-level message sequence chart. This allows the designer to play in a coherent way with the local and global views of a system, and opens new perspectives in reverse model engineering of concurrent systems. Our technique is based on a partial order semantics of synchronous parallel automata and the construction of a complete finite prefix of an event-structure coding all the behaviors. We present the models and algorithms. The examples presented in the report have been processed by a small software prototype we have implemented.
Document type :
Complete list of metadata
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Friday, May 19, 2006 - 7:38:49 PM
Last modification on : Friday, February 4, 2022 - 3:22:15 AM
Long-term archiving on: : Sunday, April 4, 2010 - 8:43:13 PM


  • HAL Id : inria-00070243, version 1


Thomas Chatain, Loïc Hélouët, Claude Jard. On the use of unfoldings to abstract communicating automata into sets of scenarios. [Research Report] RR-5778, INRIA. 2005, pp.23. ⟨inria-00070243⟩



Record views


Files downloads