Abstract
The ITU standard for MSCs provides a useful framework for visualizing communication protocols. HMSCs can describe a collection of MSC scenarios in early stages of system design. They extend finite state systems by partial order semantics and asynchronous, unbounded message exchange.
Usually we ask whether an HMSC can be implemented, for instance by a finite state protocol. This question has been shown to be undecidable [5]. Motivated by the paradigm of reverse engineering we study in this paper the converse translation, specifically the question whether a finite state communication protocol can be transformed into an equivalent HMSC. This kind of translation is needed when e.g. different forms of specification (HMSC, finite automata, temporal logic) must be integrated into a single one, for instance into an HMSC.
We show in this paper that translating finite state automata into HMSCs is feasible under certain natural assumptions. Specifically, we show that we can test in polynomial time whether a finite state protocol given by a Büchi automaton is equivalent to an HMSC, provided that the automaton satisfies the diamond property (the precise bound is NLOGSPACE-complete). The diamond property is a natural property induced by concurrency. Under the weaker assumption of bounded Büchi automata we show that the test is co-NP-complete. Finally, without any buffer restriction the problem is shown to be undecidable.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Alur, R. K. Brayton, T. A. Henzinger, S. Qadeer, and S. K. Rajamani. Partial order reduction in symbolic state space exploration. In Proc. of CAV’97, LNCS 1254, pp. 340–351, 1997.
R. Alur and M. Yannakakis. Model checking of message sequence charts. In Proc. of CONCUR’99, LNCS 1664, 1999.
E. Gunter, A. Muscholl, and D. Peled. Compositional message sequence charts. In Proc. of TACAS’2001, LNCS 2031, pp. 496–511, 2001.
L. Hélouёt and P. Le Maigat. Decomposition of Message Sequence Charts. In Proc. of the 2nd Workshop on SDL and MSC (SAM’2000), pages 46–60, 2000.
J. G. Henriksen, M. Mukund, K. Narayan Kumar, and P. Thiagarajan. On message sequence graphs and finitely generated regular MSC languages. In Proc. of ICALP’2000, LNCS 1853, pages 675–686, 2000.
A. Muscholl. Über die Erkennbarkeit unendlicher Spuren. Teubner, 1996.
A. Muscholl and D. Peled. Message sequence graphs and decision problems on Mazurkiewicz traces. In Proc. of MFCS’99, LNCS 1672, pp. 81–91, 1999.
D. A. Peled, T. Wilke, and P. Wolper. An algorithmic approach for checking closure properties of temporal logic specifications and omega-regular languages. Theoretical Computer Science, 195(2):183–203, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Muscholl, A., Peled, D. (2001). From Finite State Communication Protocols to High-Level Message Sequence Charts. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 2001. Lecture Notes in Computer Science, vol 2076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48224-5_59
Download citation
DOI: https://doi.org/10.1007/3-540-48224-5_59
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42287-7
Online ISBN: 978-3-540-48224-6
eBook Packages: Springer Book Archive