Tutorial on message sequence charts
Computer Networks and ISDN Systems - Special issue on SDL and MSC
The Unified Modeling Language user guide
The Unified Modeling Language user guide
From Finite State Communication Protocols to High-Level Message Sequence Charts
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
An Unfolding Algorithm for Synchronous Products of Transition Systems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
| Hi-index | 0.00 |
This paper considers 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. Our technique is based on a partial order semantics of synchronous parallel automata and the construction of a finite complete prefix of an event-structure coding all the behaviors. We present the models and algorithms. The examples presented in the paper have been processed by a small software prototype we have implemented.