Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Hélouët, L., Jard, C.: Conditions for Synthesis of Communicating Automata from HMSCs. In: Schieferdecker, I. (ed.) 5th International Workshop on Formal Methods for Industrial Critical Systems (FMICS), ARE. Stefania-Gnesi, GMD FOKUS (April 2000)
Esparza, J., Römer, S.: An unfolding algorithm for synchronous products of transition systems. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, pp. 2–20. Springer, Heidelberg (1999)
Muscholl, A., Peled, D.A.: From finite state communication protocols to high-level message sequence charts. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 720–731. Springer, Heidelberg (2001)
MacMillan, K.: A Technique of State Space Search Based on Unfolding. Journal of Formal Methods and System Design 9, 1–22 (1992)
Abdallah, M., Khendec, F., Butler, G.: New Results on Deriving SDL Specifications from MSCs. In: Proc. of 9th SDL Forum, Montreal, pp. 51–66
Mukund, M., Narayan Kumar, K., Thiagarajan, P.S.: Netcharts: Bridging the gap between hMSCs and executable specifications. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 296–310. Springer, Heidelberg (2003)
Rudolph, E., Graubmann, O., Grabowski, J.: Tutorial on Message Sequence Charts. Computer Networks and ISDN Systems - SDL and MSC 28 (1996)
Booch, G., Jacobson, I., Rumbaugh, J.: Unified Modeling Language User Guide. Addison-Wesley, Reading (1997)
ITU, Message Sequence Charts, standard Z.120 (2000)
Jard, C., Hélouët, L., Chatain, T.: From Automata Networks to HMSCs: a Reverse Model Engineering Perspective, INRIA/IRISA Research Report, 22 pages (August 2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 IFIP International Federation for Information Processing
About this paper
Cite this paper
Chatain, T., Hélouët, L., Jard, C. (2005). From Automata Networks to HMSCs: A Reverse Model Engineering Perspective. In: Wang, F. (eds) Formal Techniques for Networked and Distributed Systems - FORTE 2005. FORTE 2005. Lecture Notes in Computer Science, vol 3731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11562436_35
Download citation
DOI: https://doi.org/10.1007/11562436_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29189-3
Online ISBN: 978-3-540-32084-5
eBook Packages: Computer ScienceComputer Science (R0)