On the use of unfoldings to abstract communicating automata into sets of scenarios
Résumé
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.