High-Level Message Sequence Charts and Projections

  • Blaise Genest
  • Loïc Hélouët
  • Anca Muscholl
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2761)


Abstraction is a key issue in automatic verification, and it is often performed by a projection on a subsystem that is relevant for the property to check. This paper defines projections for the scenario language of High-level Message Sequence Charts (HMSC). We first show that the projection of an HMSC is not representable as an HMSC, in general. However, we show how that projections of HMSCs can be represented by a larger class of scenario languages, namely by (realizable) compositional HMSCs (cHMSCs). Moreover, we propose an algorithm that checks whether the projection of an HMSC can be represented by an HMSC, constructing the HMSC representation, when possible. This can be used in model-checking the projection of an HMSC specification.


Partial Order Model Check Sequential Composition Parallel Composition Hasse Diagram 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alur, R., Holzmann, G., Peled, D.: An Analyser for Message Sequence Charts. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol. 1055, pp. 35–48. Springer, Heidelberg (1996)Google Scholar
  2. 2.
    Alur, R., Yannakakis, M.: Model Checking of Message Sequence Charts. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, pp. 114–129. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  3. 3.
    Clarke, E., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 154–169. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  4. 4.
    Genest, B., Muscholl, A., Seidl, H., Zeitoun, M.: Infinite-state HMSCs: Modelchecking and realizability. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 657–668. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  5. 5.
    Govindaraju, S., Dill, D.: Counterexample-guided choice of projections in approximate symbolic model checking. In: Proceedings of ICCAD 2000 (2000)Google Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    Harel, D., Damm, W.: LSCs: breathing life into Message Sequence Charts. Technical Report CS98-09, Weizmann Institute (Avril 1998)Google Scholar
  8. 8.
    Henriksen, J., Mukund, M., Kumar, K., Thiagarajan, P.: On Message Sequence Graphs and finitely generated regular MSC languages. In: ICALP 1999. LNCS, vol. 1644 (1999)Google Scholar
  9. 9.
    Hélouët, L., Le Maigat, P.: Decomposition of Message Sequence Charts. In: Proceedings of SAM2000(2nd conference on SDL and MSCs), Grenoble, Juin (2000)Google Scholar
  10. 10.
    ITU-TS. ITU-TS Recommendation Z.120: Message Sequence Chart (MSC). ITUTS, Geneva (September 1993)Google Scholar
  11. 11.
    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, p. 809. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  12. 12.
    Muscholl, A.: Matching specifications for Message Sequence Charts. In: Thomas, W. (ed.) FOSSACS 1999. LNCS, vol. 1578, pp. 273–287. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  13. 13.
    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. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  14. 14.
    Muscholl, A., Peled, D., Su, Z.: Deciding properties for Message Sequence Charts. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol. 1378, p. 226. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  15. 15.
    Peled, D.: Specification and verification of Message Sequence Charts. In: Proceedings of FORTE 2000. IFIP 183, pp. 139–154 (2000)Google Scholar
  16. 16.
    Pnueli, A.: Abstraction, composition, symmetry, and a little deduction: The remedies to state explosion. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855. Springer, Heidelberg (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Blaise Genest
    • 1
  • Loïc Hélouët
    • 2
  • Anca Muscholl
    • 1
  1. 1.LIAFAUniversité Paris VIIParisFrance
  2. 2.IRISACampus de BeaulieuRennesFrance

Personalised recommendations