Netcharts: Bridging the gap between HMSCs and executable specifications

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

Volumn 2761, Issue , 2003, Pages 296-310

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

^a CHENNAI MATHEMATICAL INSTITUTE   (India)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; LOGIC CIRCUITS;

COMMUNICATING FINITE STATE MACHINES; EXECUTABLE SPECIFICATIONS; HIGH LEVEL MESSAGE SEQUENCE CHARTS; MESSAGE SEQUENCE CHARTS; REALIZATION PROBLEMS; UPPER BOUND;

FLOWCHARTING;

EID: 35248857781     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45187-7_20     Document Type: Article

References (16)

1. Alur, R., Etessami, K. and Yannakakis, M.: Realizability and verification of MSC graphs. Proc. ICALP'01, LNCS 2076, Springer-Verlag (2001) 797-808.
2. Alur, R. and Yannakakis, M.: Model checking of message sequence charts. Proc. CONCUR'99, LNCS 1664, Springer-Verlag (1999) 114-129.
3. Booch, G., Jacobson, I. and Rumbaugh, J.: Unified Modeling Language User Guide. Addison-Wesley (1997).
4. Caillaud, B., Darondeau, P., Helouet, L., and Lesventes, G.: HMSCs as partial specifications ... with PNs as completions. Modeling and Verification of Parallel Processes 4th Summer School, MOVEP 2000, LNCS 2067, Springer-Verlag (2001) 125-152.
5. J. Desel and J. Esparza: Free Choice Petri Nets. Cambridge Tracts in Theoretical Computer Science 40, Cambridge University Press (1995).
6. Gunter, E., Muscholl, A. and Peled, D.: Compositional message sequence charts. Proc. TACAS'01, LNCS 2031, Springer-Verlag (2001) 496-511.
7. Harel, D. and Gery, E.: Executable object modelling 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. Proc. ICALP'00, LNCS 1854, Springer-Verlag (2000) 675-686.
9. Henriksen, J.G., Mukund, M., Narayan Kumar K., and Thiagarajan, P.S.: Regular Collections of Message Sequence Charts. Proc. MFCS'00, LNCS 1893, Springer-Verlag (2000) 405-414.
10. ITU-TS Recommendation Z.120: Message Sequence Chart (MSC). ITU-TS, Geneva (1997).
11. Mauw, S. and Reniers, M. A.: High-level message sequence charts, Proc. 8th SDL Forum, SDL'97: Time for Testing - SDL, MSC and Trends, Elsevier (1997) 291-306.
12. Mukund, M., Narayan Kumar, K. and Sohoni, M.: Synthesizing distributed finite-state systems from MSCs. Proc CONCUR 2000, LNCS 1877, Springer-Verlag (2000) 521-535.
13. Muscholl, A. and Peled, D.: Message sequence graphs and decision problems on Mazurkiewicz traces. Proc. MFCS'99, LNCS 1672, Springer-Verlag (1999) 81-91.
14. Roychoudhury, A. and Thiagarajan, P. S.: Communicating transaction processes. Proc. ACSD'03, IEEE Press, 2003 (to appear).
15. Rudolph, E., Graubmann, P. and Grabowski, J.: Tutorial on message sequence charts. Computer Networks and ISDN Systems - SDL and MSC 28 (1996).
16. Sgroi, M., Kondratyev, A., Watanabe, Y. and Sangiovanni-Vincentelli, A. : Synthesis of Petri nets from MSC-based specifications. Unpublished manuscript.