This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
7.10 Bibliographic Notes
N. Baudru and R. Morin. The pros and cons of netcharts. In Proceedings of the 15th International Conference on Concurrency Theory (CONCUR 2004), London, UK, volume 3170 of Lecture Notes in Computer Science, pages 99–114. Springer, 2004.
H. Ben-Abdallah and S. Leue. Syntactic detection of process divergence and nonlocal choice in message sequence charts. In Proceedings of the 3rd International Workshop on Tools and Algorithms for Construction and Analysis of Systems (TACAS 1997), Enschede, The Netherlands, volume Lecture Notes in Computer Science 1217, pages 259–274. Springer, 1997.
B. Bollig and M. Leucker. Message-passing automata are expressively equivalent to EMSO logic. Theoretical Computer Science, to appear, 2006. A preliminary version appeared in Proceedings of CONCUR 2004, volume 3170 of Lecture Notes in Computer Science, pages 146–160. Springer, 2004.
E. M. Clarke, O. Grumberg, and D. Peled. Model Checking. The MIT Press, Cambridge, Massachusetts, 1999.
B. Genest, M. Minea, A. Muscholl, and D. Peled. Specifying and verifying partial order properties using template MSCs. In Proceedings of the 7th International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2004), Barcelona, Spain, pages 195–210. Lecture Notes in Computer Science, 2004.
B. Genest, A. Muscholl, H. Seidl, and M. Zeitoun. Infinite-state high-level MSCs: Model-checking and realizability. In Proceedings of the 29th International Colloquium on Automata, Languages and Programming (ICALP 2002), Malaga, Spain, volume 2380 of Lecture Notes in Computer Science, pages 657–668. Springer, 2002.
E. Gunter, A. Muscholl, and D. Peled. Compositional message sequence charts. International Journal on Software Tools and Technology Transfer (STTT), 5(1):78–89, 2003.
J. G. Henriksen, M. Mukund, K. Narayan Kumar, M. Sohoni, and P. S. Thiagarajan. A theory of regular MSC languages. Information and Computation, 202(1):1–38, 2005. The paper subsumes results from [46, 47, 74].
J.-P. Katoen and L. Lambert. Pomsets for message sequence charts. In H. König and P. Langendörfer, editors, Formale Beschreibungstechniken für Verteilte Systeme, pages 197–208, Cottbus, Germany, 1998. Shaker Verlag.
D. Kuske. Regular sets of infinite message sequence charts. Information and Computation, 187:80–109, 2003.
P. B. Ladkin and S. Leue. Interpreting message flow graphs. Formal Aspects of Computing, 7(5):473–509, 1995.
M. Leucker, P. Madhusudan, and S. Mukhopadhyay. Dynamic message sequence charts. In Proceedings of the 22nd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2002), Kanpur, India, volume 2556 of Lecture Notes in Computer Science, pages 253–264. Springer, 2002.
P. Madhusudan. Reasoning about sequential and branching behaviours of message sequence graphs. In Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP 2001), Crete, Greece, volume 2076 of Lecture Notes in Computer Science, pages 809–820. Springer, 2001.
P. Madhusudan and B. Meenakshi. Beyond message sequence graphs. In Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), Bangalore, India, volume 2245 of Lecture Notes in Computer Science, pages 256–267. Springer, 2001.
S. Mauw. The formalization of message sequence charts. Computer Networks and ISDN Systems, 28(12):1643–1657, 1996.
S. Mauw and M. A. Reniers. High-level message sequence charts. In Proceedings of the Eighth SDL Forum (SDL’97), pages 291–306, 1997.
B. Meenakshi and R. Ramanujam. Reasoning about message passing in finite state environments. In Proceedings of the 27th International Colloquium on Automata, Languages and Programming (ICALP 2000), Geneva, Switzerland, volume 1853 of Lecture Notes in Computer Science, pages 487–498. Springer, 2000.
B. Meenakshi and R. Ramanujam. Reasoning about layered message passing systems. Computer Languages, Systems, and Structures, 30(3–4):529–554, 2004.
R. Morin. Recognizable sets of message sequence charts. In Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2002), Antibes — Juan les Pins, France, volume 2285 of Lecture Notes in Computer Science, pages 523–534. Springer, 2002.
M. Mukund, K. Narayan Kumar, and P. S. Thiagarajan. Netcharts: Bridging the gap between HMSCs and executable specifications. In Proceedings of the 14th International Conference on Concurrency Theory (CONCUR 2003), Marseille, France, volume 2761 of Lecture Notes in Computer Science, pages 293–307. Springer, 2003.
A. Muscholl, D. Peled, and Z. Su. Deciding properties for message sequence charts. In Proceedings of the 1st International Conference on Foundations of Software Science and Computation Structures (FOSSACS 1998), Lisbon, Portugal, volume 1578 of Lecture Notes in Computer Science, pages 226–242. Springer, 1998.
B. Sengupta and R. Cleaveland. Triggered message sequence charts. In Proceedings of the 10th ACM SIGSOFT Symposium on Foundations of Software Engineering, pages 167–176. ACM Press, 2002.
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2006). Message Sequence Charts. In: Formal Models of Communicating Systems. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-32923-4_7
Download citation
DOI: https://doi.org/10.1007/3-540-32923-4_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32922-0
Online ISBN: 978-3-540-32923-7
eBook Packages: Computer ScienceComputer Science (R0)