Regular collections of message sequence charts

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1893, Issue , 2000, Pages 405-414

  Henriksen, Jesper G ^a   Mukund, Madhavan ^b   Kumar, K Narayan ^b   Thiagarajan, P S ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b CHENNAI MATHEMATICAL INSTITUTE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; FLOWCHARTING; FORMAL LOGIC;

HIERARCHICAL MESSAGE SEQUENCE CHARTS (HMSC); LOGICAL CHARACTERIZATION; MESSAGE SEQUENCE CHARTS; MESSAGE-PASSING AUTOMATA; MONADIC SECOND-ORDER LOGIC; SEQUENTIAL PROCESS; TELECOMMUNICATION SOFTWARE; VISUAL FORMALISM;

MESSAGE PASSING;

EID: 84959181355     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44612-5_36     Document Type: Conference Paper

References (23)

1. Alur, R., Holzmann, G. J., and Peled, D.: An analyzer for message sequence charts. Software Concepts and Tools, 17(2) (1996) 70-77.
2. Alur, R., and Yannakakis, M.: Model checking of message sequence charts. Proc. CONCUR'99, LNCS 1664, Springer-Verlag (1999) 114-129.
3. Ben-Abdallah, H., and Leue, S.: Syntactic detection of process divergence and nonlocal choice in message sequence charts. Proc. TACAS'97, LNCS 1217, Springer-Verlag (1997) 259-274.
4. Booch, G., Jacobson, I., and Rumbaugh, J.: Unified Modeling Language User Guide. Addison-Wesley (1997).
5. Buchi, J. R.: On a decision method in restricted second order arithmetic. Z. Math. Logik Grundlag. Math 6 (1960) 66-92.
6. Damm, W., and Harel, D.: LCSs: Breathing life into message sequence charts. Proc. FMOODS'99, Kluwer Academic Publishers (1999) 293-312.
7. Diekert, V., and Rozenberg, G. (Eds.): The book of traces. World Scientific (1995).
8. Ebinger, W., and Muscholl, A.: Logical definability on infinite traces. Theoretical Computer Science 154(1) (1996) 67-84.
9. Harel, D., and Gery, E.: Executable object modeling with statecharts. IEEE Computer, July 1997 (1997) 31-42.
10. Henriksen, J. G., Mukund, M., Narayan Kumar, K., and Thiagarajan, P. S.: Towards a theory of regular MSC languages, Report RS-99-52, BRICS, Department of Computer Science, University of Aarhus, Denmark (1999).
11. Henriksen, J. G., Mukund, M., Narayan Kumar, K., and Thiagarajan, P. S.: On message sequence graphs and finitely generated regular MSC languages, Proc. ICALP'2000, LNCS 1853, Springer-Verlag (2000).
12. ITU-TS Recommendation Z.120: Message Sequence Chart (MSC). ITU-TS, Geneva (1997)
13. Ladkin, P. B., and Leue, S.: Interpreting message flow graphs. Formal Aspects of Computing 7(5) (1995) 473-509.
14. Levin, V., and Peled, D.: Verification of message sequence charts via template matching. Proc. TAPSOFT'97, LNCS 1214, Springer-Verlag (1997) 652-666.
15. Mauw, S., and Reniers, M. A.: High-level message sequence charts, Proc. SDL '97, Elsevier (1997) 291-306.
16. Mukund, M., Narayan Kumar, K. and Sohoni, M.: Keeping track of the latest gossip in message-passing systems. Proc. Structures in Concurrency Theory (STRICT), Workshops in Computing Series, Springer-Verlag (1995) 249-263.
17. Muscholl, A.: Matching Specifications for Message Sequence Charts. Proc. FOS-SACS 99, LNCS 1578, Springer-Verlag (1999) 273-287.
18. Muscholl, A., Peled, D., and Su, Z.: Deciding properties for message sequence charts. Proc. FOSSACS'98, LNCS 1378, Springer-Verlag (1998) 226-242.
19. Rudolph, E., Graubmann, P., and Grabowski, J.: Tutorial on message sequence charts. In Computer Networks and ISDN Systems—SDL and MSC, Volume 28 (1996).
20. Thiagarajan, P. S., and Walukiewicz, I: An expressively complete linear time temporal logic for Mazurkiewicz traces. Proc. IEEE LICS 97 (1997) 183-194.
21. Thomas, W.: Automata on infinite objects. In van Leeuwen, J. (Ed.), Handbook of Theoretical Computer Science, Volume B, North-Holland (1990) 133-191.
22. Vardi, M. Y., and Wolper, P.: An automata-theoretic approach to automatic program verification. In Proc. IEEE LICS'86 (1986) 332-344.
23. Zielonka, W.: Notes on finite asynchronous automata. R.A.I.R.O.—Inf. Theor. et Appl., 21 (1987) 99-135.