Introduction
We study the problem of using monadic second order (MSO) logic to reason about certain distributed infinite state systems that communicate by exchanging messages. The success of MONA [6] and similar tools shows that a nonelementary worst-case complexity of MSO logic is not relevant in the practice of model checking. Indeed, MSO logic enjoys a satisfactory expressive power for many applications since it subsumes many temporal and program logics. Towards obtaining decidable MSO theory, we consider systems that are not explicitly product-based but, still have an underlying component-based structure.
This is a preview of subscription content, log in via an institution to check access.
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
Courcelle, B.: Monadic second–order definable graph transductions: a survey. Theoretical Comput. Sci. 126, 53–75 (1994)
Courcelle, B., Engelfriet, J.: Graph structure and Monadic Second-Order Logic, a Language Theoretic Approach. Cambridge University Press (2012)
Courcelle, B., Walukiewicz, I.: Monadic second–order logic, graph coverings and unfoldings of transition systems. Annals of Pure and Applied Logic 92, 35–62 (1998)
Genest, B., Kuske, D., Muscholl, A.: On communicating automata with bounded channels. Fundam. Inform. 80(1-3), 147–167 (2007)
Gunter, E.L., Muscholl, A., Peled, D.A.: Compositional Message Sequence Charts. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 496–511. Springer, Heidelberg (2001)
Klarlund, N., Møller, A., Schwartzbach, M.I.: MONA implementation secrets. Int. J. Found. Comput. Sci. 13(4), 571–586 (2002)
Kumar, K.N.: The theory of MSC languages. In: D’Souza, D., Shankar, P. (eds.) Modern Applications of Automata Theory. IISc Research Monograph Series, vol. 2, World Scientific (2012)
Kuske, D.: Regular sets of infinite message sequence charts. Inf. Comput. 187(1), 80–109 (2003)
Madhusudan, P.: Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs. In: Yu, Y., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 809–820. Springer, Heidelberg (2001)
Madhusudan, P., Meenakshi, B.: Beyond Message Sequence Graphs. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol. 2245, pp. 256–267. Springer, Heidelberg (2001)
Rudolph, E., Graubmann, P., Grabowski, J.: Tutorial on message sequence charts. Computer Networks and ISDN Systems 28(12), 1629–1641 (1996)
Thomas, W.: Languages, automata and logic. In: Rozenberg, G., Salomaa, A. (eds.) Beyond Words. Handbook of Formal Languages, vol. 3, pp. 389–455. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
D’Souza, M., Knapik, T. (2013). Verification of Message Sequence Structures. In: Hota, C., Srimani, P.K. (eds) Distributed Computing and Internet Technology. ICDCIT 2013. Lecture Notes in Computer Science, vol 7753. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36071-8_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-36071-8_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36070-1
Online ISBN: 978-3-642-36071-8
eBook Packages: Computer ScienceComputer Science (R0)