Abstract
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.
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.
References
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)
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)
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)
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)
Govindaraju, S., Dill, D.: Counterexample-guided choice of projections in approximate symbolic model checking. In: Proceedings of ICCAD 2000 (2000)
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)
Harel, D., Damm, W.: LSCs: breathing life into Message Sequence Charts. Technical Report CS98-09, Weizmann Institute (Avril 1998)
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)
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)
ITU-TS. ITU-TS Recommendation Z.120: Message Sequence Chart (MSC). ITUTS, Geneva (September 1993)
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)
Muscholl, A.: Matching specifications for Message Sequence Charts. In: Thomas, W. (ed.) FOSSACS 1999. LNCS, vol. 1578, pp. 273–287. Springer, Heidelberg (1999)
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)
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)
Peled, D.: Specification and verification of Message Sequence Charts. In: Proceedings of FORTE 2000. IFIP 183, pp. 139–154 (2000)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Genest, B., Hélouët, L., Muscholl, A. (2003). High-Level Message Sequence Charts and Projections. In: Amadio, R., Lugiez, D. (eds) CONCUR 2003 - Concurrency Theory. CONCUR 2003. Lecture Notes in Computer Science, vol 2761. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45187-7_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-45187-7_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40753-9
Online ISBN: 978-3-540-45187-7
eBook Packages: Springer Book Archive