Abstract
Message sequence charts (MSC) are a graphical language for the description of communication scenarios between asynchronous processes. Our starting point is to model systems using an assume-guarantee formalism, in the style of LSCs and Triggered MSCs. We enrich MSCs with the possibility of using gaps (template MSC), and show their expressivity. This formalism also allows to express logical formulas. We analyze the model-checking problem, whose complexity is linear in the size of the system, and ranges from PTIME to EXPSPACE in the size of the template formula.
Keywords
- Linear Temporal Logic
- Parallel Composition
- Polynomial Space
- Pattern Matching Algorithm
- Message Sequence Chart
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.
Work supported by the EU-TMR project GAMES.
Download to read the full chapter text
Chapter PDF
References
ITU-TS recommendation Z.120, Message Sequence Charts, Geneva (1999)
Alur, R., Etessami, K., Yannakakis, M.: Realizability and verification of MSC graphs. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 797–808. Springer, Heidelberg (2001)
Alur, R., McMillan, K., Peled, D.: Deciding global partial-order properties. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 41–52. Springer, Heidelberg (1998)
Damm, W., Harel, D.: LSCs: Breathing life into Message Sequence Charts. Formal Methods in System Design 19(1), 45–80 (2001)
Diekert, V., Gastin, P.: LTL is expressively complete for Mazurkiewicz traces. JCSS 64(2), 396–418 (2002)
Genest, B., Muscholl, A.: Pattern matching and membership for hierarchical message sequence charts. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, pp. 326–340. Springer, Heidelberg (2002)
Gunter, E., Muscholl, A., Peled, D.: Compositional message sequence charts. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 496–511. Springer, Heidelberg (2001)
Liu, H., Wrathall, C., Zeger, K.: Efficient Solution of Some Problems in Free Partially Commutative Monoids. Inf. and Comp. 89, 180–198 (1990)
Harel, D., Kugler, H.: Synthesizing State-Based Object Systems from LSC Specifications. International Journal of Foundations of Computer Science 13(1), 5–51 (2002)
Henriksen, J.G., Mukund, M., Narayan Kumar, K., Thiagarajan, P.: On message sequence graphs and finitely generated regular MSC languages. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 675–686. Springer, Heidelberg (2000)
Madhusudan, P.: Reasoning about sequential and branching behaviours of message sequence graphs. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 809–820. Springer, Heidelberg (2001)
Mukund, M., Narayan Kumar, K., Thiagarajan, P.S.: Netcharts: Bridging the gap between h MSCs and executable specifications. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 296–310. Springer, Heidelberg (2003)
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)
Muscholl, A., Peled, D.: Message sequence graphs and decision problems on Mazurkiewicz traces. In: Kutyłowski, M., Wierzbicki, T., Pacholski, L. (eds.) MFCS 1999. LNCS, vol. 1672, pp. 81–91. Springer, Heidelberg (1999)
Muscholl, A., Peled, D.A., Su, Z.: Deciding properties for message sequence charts. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol. 1378, pp. 226–242. Springer, Heidelberg (1998)
Sengupta, B., Cleaveland, R.: Triggered Message Sequence Charts. In: SIGSOFT 2002/FSE-10, ACM Press, New York (2002)
Thiagarajan, P.S., Walukiewicz, I.: An expressively complete linear time temporal logic. Information and Computation 179(2), 230–249 (2002)
Walukiewicz, I.: Difficult configurations – on the complexity of LTrL. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 140–151. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Genest, B., Minea, M., Muscholl, A., Peled, D. (2004). Specifying and Verifying Partial Order Properties Using Template MSCs. In: Walukiewicz, I. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2004. Lecture Notes in Computer Science, vol 2987. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24727-2_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-24727-2_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21298-0
Online ISBN: 978-3-540-24727-2
eBook Packages: Springer Book Archive