Compositional message sequence charts

International Journal on Software Tools for Technology Transfer

Volumn 5, Issue 1, 2003, Pages 78-89

  Gunter, Elsa L ^a   Muscholl, Anca ^b   Peled, Doron ^c  

^a University Heights   (United States)

^b UNIVERSITÉ PARIS DIDEROT   (France)

^c The University of Texas at Austin   (United States)

Author keywords

Finite state communication protocols; Message sequence charts; Partial order methods

Indexed keywords

COMMUNICATING OBJECTS; COMPOSITIONAL MESSAGE SEQUENCE CHARTS; FINITE-STATE; GRAPH NOTATION; MESSAGE SEQUENCE CHARTS; PARTIAL-ORDER METHODS; STANDARD NOTATION; TEXTUAL REPRESENTATION;

INFORMATION SYSTEMS; SOFTWARE ENGINEERING;

FLOWCHARTING;

EID: 84896693456     PISSN: 14332779     EISSN: 14332787     Source Type: Journal    
DOI: 10.1007/s10009-002-0085-2     Document Type: Article

References (22)

1. Alur, R., Etessami, K., Yannakakis, M.: Inference of message sequence charts. In: 22nd International Conference on Software Engineering, Limerick, Ireland. ACM, pp. 304-313, 2000.
2. Alur, R., Holzmann, G., Peled, D.: An analyzer for message sequence charts. In: Software Concepts Tools 17(2): 70-77, 1996.
3. Alur, R., Peled, D., Penczek, W.: Model checking of causality properties. In: 10th Annual IEEE Symposium on Logic in Computer Science, LICS'95, San Diego, Calif., USA, pp. 90-100, 1995.
4. Alur, R., Yannakakis, Y.: Model checking of message sequence charts. In: Concurrency Theory, 10th International Conference, CONCUR'99, Eindhoven, The Netherlands, Lecture Notes in Computer Science, vol. 1664. Springer, Berlin Heidelberg New York, 1999, pp. 114-129.
5. Bolognesi, T., Brinksma, E.: Introduction to the ISO specification language LOTOS. Comput Networks 14: 25-59, 1987.
6. Esparza, E., Hansel, D, Rossmanith P, Schwoon S.: Efficient algorithms for model checking pushdown systems. In: Computer Aided Verification, 12th International Conference, CAV 2000, Chicago, Ill., USA, Lecture Notes in Computer Science, vol. 1855. Springer, Berlin Heidelberg New York, 2000, pp. 232-247.
7. Godefroid, P.: Partial-order methods for the verification of concurrent systems - an approach to the state-explosion problem. Lecture Notes in Computer Science, vol. 1035. Springer, Berlin Heidelberg New York, 1996.
8. Godefroid, P., Wolper, P.: A partial approach to model checking. In: Inf Comput 110(2): 305-326, 1994.
9. Gunter, E., Peled, D.: Path exploration tool. In: Tools and Algorithms for Construction and Analysis of Systems, 5th International Conference, TACAS '99, Amsterdam, The Netherlands, Lecture Notes in Computer Science, vol. 1579. Springer, Berlin Heidelberg New York, 1999, pp. 405-419.
10. Haugen, O.: Special issue of computer networks and ISDN systems on SDL and MSC, 1996.
11. Hélouët, L., Le Maigat, P.: Decomposition of message sequence charts. In: 2nd Workshop on SDL and MSC, SAM 2000, Grenoble, France, pp. 46-60, 2000.
12. Henriksen, J., Mukund, M., Narayan Kumar, K., Thiaga-rajan, P.: On message sequence graphs and finitely generated regular MSC languages. In: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, Lecture Notes in Computer Science, vol. 1853. Springer, Berlin Heidelberg New York, 2000, pp. 675-686.
13. ITU-T Recommendation Z. 120.: Message sequence chart (MSC), Geneva, 1996.
14. Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Comm ACM 21: 558-565, 1978.
15. Madhusudan, P.: Reasoning about sequential and branching behaviours of message sequence graphs. In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, Lecture Notes in Computer Science, vol. 2076. Springer, Berlin Heidelberg New York, 2001, pp. 809-820.
16. Mauw, S., Reniers, M.: High-level message sequence charts. In: SDL'97: Time for Testing - SDL, MSC and Trends. Proc. SDL Forum'97, 291-306, 1997.
17. Muscholl, A., Peled, D.: Message sequence graphs and decision problems on Mazurkiewicz traces. In: Mathematical Foundations of Computer Science 1999, 24th International Symposium, MFCS'99, Szklarska Poreba, Poland, Lecture Notes in Computer Science, vol. 1999. Springer, Berlin Heidelberg New York, 1999, pp. 81-91.
18. Muscholl, A., Peled, D., Su, Z.: Deciding properties of message sequence charts. In: Foundations of Software Science and Computation Structure, 1st International Conference, FoSSaCS'98, Lisbon, Portugal, Lecture Notes in Computer Science, vol. 1378. Springer, Berlin Heidelberg New York, 1998, pp. 226-242.
19. Muscholl, A., Peled, D.: High-level message sequence charts and finite-state communication protocols. In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, Lecture Notes in Computer Science, vol. 2076. Springer, Berlin Heidelberg New York, 2001, pp. 720-731.
20. Peled, D.: All from one, one for all: on model checking using representatives. In: Computer-Aided Verification, 5th International Conference, CAV '93, Elounda, Greece, Lecture Notes in Computer Science, vol. 697. Springer, Berlin Heidelberg New York, 1993, pp. 409-423.
21. Peled, D.: Specification and verification of message sequence charts. In: Formal Techniques for Distributed System Development, FORTE/PSTV 2000, Pisa, Italy. Kluwer, Boston, Mass., USA, pp. 139-154, 2000.
22. Tanenbaum, A.: Computer Networks. Prentice-Hall, Englewood Cliffs, N. J., USA, 1998.