Abstract
Message sequence charts (MSCs) and high-level message sequence charts (HMSCs) are popular formalisms for the specification of communication protocols between asynchronous processes. An important concept in this context is the size of the communication buffers used between processes. Since real systems impose limitations on the capacity (or speed) of communication links, we ask whether a given HMSC can be implemented with respect to a given buffer size imposed by the environment. We introduce four different measures for buffer sizes and investigate for each of these measures the complexity of deciding whether a given MSC (or HMSC, or hierarchical MSC) satisfies a given bound on the buffer size. The complexity of these problems varies between the classes P, NP, and coNP.
Research supported by the INRIA cooperative research action FISC.
Current address: IRISA, Campus de Beaulieu, F-35042 Rennes Cedex, France.
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
B. Genest, and A. Muscholl. Pattern Matchingand Membership for Hierarchical Message Sequence Charts. To appear in Proc. of LATIN 2002.
J. G. Henriksen, M. Mukund, K. N. Kumar, and P. Thiagarajan. On message sequence graphs and finitely generated regular MSC languages. In Proc. of ICALP’00, LNCS 1853, pp. 675–686, 2000.
J. G. Henriksen, M. Mukund, K. N. Kumar, and P. Thiagarajan. Regular collections of message sequence charts. In Proc. of MFCS’00, LNCS 1893, pp. 675–686, 2000.
E. L. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, 1976.
R. Morin. On regular message sequence chart languages and relationships to Mazurkiewicz trace theory. In Proc. of FoSSaCS’01, LNCS 2030, pp. 332–346, 2001.
M. Mukund, K. N. Kumar, and M. A. Sohoni. Synthesizingdistributed finite-state systems from MSCs. In Proc. of CONCUR’00, LNCS 1877, pp. 521–535, 2000.
A. Muscholl, D. Peled, and Z. Su. Decidingprop erties for message sequence charts. In Proc. of FoSSaCS’98, LNCS 1378, pp. 226–242, 1998.
C. H. Papadimitriou. Computational Complexity. Addison Wesley, 1994.
R. Sethi. Complete register allocation problems. SIAM Journal on Computing, 4(3):226–248, 1975.
K. Simon. On minimum flow and transitive reduction. In Proc. of ICALP’88, LNCS 317, pp. 535–546, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lohrey, M., Muscholl, A. (2002). Bounded MSC Communication. In: Nielsen, M., Engberg, U. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2002. Lecture Notes in Computer Science, vol 2303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45931-6_21
Download citation
DOI: https://doi.org/10.1007/3-540-45931-6_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43366-8
Online ISBN: 978-3-540-45931-6
eBook Packages: Springer Book Archive