Synthesizing distributed finite-state systems from MSCs

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

Volumn 1877 LNCS, Issue , 2000, Pages 521-535

  Mukund, Madhavan ^a   Kumar, K Narayan ^a   Sohoni, Milind ^b  

^a CHENNAI MATHEMATICAL INSTITUTE   (India)

^b INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; FLOWCHARTING;

DISTRIBUTED DEVICES; DISTRIBUTED PROTOCOLS; FINITE STATE SYSTEMS; MAZURKIEWICZ TRACES; MESSAGE PASSING SYSTEMS; MESSAGE SEQUENCE CHARTS; MESSAGE-PASSING AUTOMATA; SYNTHESIS PROBLEMS;

MESSAGE PASSING;

EID: 84885210304     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44618-4_37     Document Type: Conference Paper

References (19)

1. Alur, R., and 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. Damm, W., and Harel, D.: LCS's: Breathing life into message sequence charts. Proc. FMOODS'99, Kluwer Academic Publishers (1999) 293-312.
6. Diekert, V., and Rozenberg, G. (Eds.): The book of traces. World Scientific (1995).
7. Harel, D., and Gery, E.: Executable object modeling with statecharts. IEEE Computer, July 1997 (1997) 31-42.
8. Henriksen, J. G., Mukund, M., Narayan Kumar K., and Thiagarajan, P. S.: On message sequence graphs and finitely generated regular MSC languages, to appear in Proc. ICALP2000, LNCS, Springer-Verlag (2000).
9. Henriksen, J. G., Mukund, M., Narayan Kumar K., and Thiagarajan, P. S.: Regular collections of message sequence charts, to appear in Proc. MFCS 2000, LNCS, Springer-Verlag (2000).
10. Ladkin, P. B., and Leue, S.: Interpreting message flow graphs. Formal Aspects of Computing 7(5) (1975) 473-509.
11. Levin, V., and Peled, D.: Verification of message sequence charts via template matching. Proc. TAPSOFT'97, LNCS 1214, Springer-Verlag (1997) 652-666.
12. Mauw, S., and Reniers, M. A.: High-level message sequence charts, Proc. SDL'97, Elsevier (1997) 291-306.
13. 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.
14. Muscholl, A.: Matching Specifications for Message Sequence Charts. Proc. FOS-SACS'99, LNCS 1578, Springer-Verlag (1999) 273-287.
15. Muscholl, A., Peled, D., and Su, Z.: Deciding properties for message sequence charts. Proc. FOSSACS'98, LNCS 1378, Springer-Verlag (1998) 226-242.
16. Rudolph, E., Graubmann, P., and Grabowski, J.: Tutorial on message sequence charts. In Computer Networks and ISDN Systems - SDL and MSC, Volume 28 (1996).
17. Thomas, W.: Automata on infinite objects. In van Leeuwen, J. (Ed.), Handbook of Theoretical Computer Science, Volume B, North-Holland, Amsterdam (1990) 133-191.
18. Thomas, W.: Languages, Automata, and Logic. In Rozenberg, G., and Salomaa, A. (Eds.), Handbook of Formal Language Theory, Vol. III, Springer-Verlag, New York (1997) 389-455.
19. Zielonka, W.: Notes on finite asynchronous automata. R. A. I. R. O. - Inf. Théor. et Appl., 21 (1987) 99-135.