Causal closure for MSC languages

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

Volumn 3821 LNCS, Issue , 2005, Pages 335-347

  Adsul, Bharat ^a   Mukund, Madhavan ^a   Narayan Kumar, K ^a   Narayanan, Vasumathi ^a  

^a CHENNAI MATHEMATICAL INSTITUTE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATION THEORY; INFORMATION ANALYSIS; INTELLIGENT AGENTS; PROBLEM SOLVING; SET THEORY; TELECOMMUNICATION SYSTEMS;

INCONSISTENT DESCRIPTIONS; LOCAL PROJECTIONS; MESSAGE SEQUENCE CHARTS (MSC); REGULAR MSC LANGUAGES;

COMPUTER PROGRAMMING LANGUAGES;

EID: 33744938690     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11590156_27     Document Type: Conference Paper

References (15)

1. Alur, R., Yannakakis, M.: Model checking of message sequence charts. Proc. CONCUR 1999), Springer Lecture Notes in Computer Science 1664 (1999) 114-129.
2. Alur, R., Etessami, K., Yannakakis, M.: Inference of message sequence graphs. IEEE Trans. Software Engg 29(7) (2003) 623-633.
3. Alur, R., Etessami, K., Yannakakis, M.: Realizability and Verification of MSC Graphs. Theor. Comput. Sci. 331(1) (2005) 97-114.
4. Booch, G., Jacobson, I., Rumbaugh, J.: Unified Modeling Language User Guide. Addison-Wesley (1997).
5. Caillaud, B., Darondeau, P., Hélouët, L. and Lesventes, G.: HMSCS as partial specifications ⋯ with PNs as completions. In Modeling and Verification of Parallel Processes, 4th Summer School, MOVEP 2000, Nantes, France (2000).
6. Genest, B., Muscholl, A., and Kuske, D.: A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms. Proc DLT 8004, Springer Lecture Notes in Computer Science 3340 (2004) 30-48.
7. Genest, B., Muscholl, A., Seidl, H. and Zeitoun, M.: Infinite-State High-Level MSCs: Model-Checking and Realizability. Proc ICALP 8008, Springer Lecture Notes in Computer Science 2380 (2002) 657-668.
8. Harel, D., Gery, E.: Executable object modeling with statecharts. IEEE Computer, July 1997 (1997) 31-42.
9. Henriksen, J.G., Mukund, M., Narayan Kumar, K., Sohoni, M., and Thiagarajan, P.S.: A Theory of Regular MSC Languages. Inf. Comp., 202(1) (2005) 1-38.
10. ITU-TS Recommendation Z.120: Message Sequence Chart (MSC). ITU-TS, Geneva (1997).
11. Lohrey, M.: Safe Realizability of High-Level Message Sequence Charts. Proc CONCUR 8008, Springer Lecture Notes in Computer Science 2421 (2002) 177-192.
12. Mauw, S., Reniera, M. A.: High-level message sequence charts, Proc SDL'97, Elsevier (1997) 291-306.
13. Mukund, M., Narayan Kumar, K., Sohoni, M.: Bounded time-stamping in message-passing systems. Theor. Comput. Sci., 290(1) (2003) 221-239.
14. Muscholl, A., Peled, D.: Message sequence graphs and decision problems on Mazurkiewicz traces. Proc. MFCS 1999), Springer Lecture Notes in Computer Science 1672 (1999) 81-91.
15. Rudolph, E., Graubmann, P., Grabowski, J.: Tutorial on message sequence charts. In Computer Networks and ISDN Systems - SDL and MSC 28 (1996).