Reasoning about layered message passing systems

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

Volumn 2575, Issue , 2003, Pages 268-282

  Meenakshi, B ^a   Ramanujam, R ^a  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATION THEORY; FORMAL LOGIC; MODEL CHECKING; SPECIFICATIONS; TEMPORAL LOGIC;

COMMUNICATION PATTERN; LINEAR TIME TEMPORAL LOGIC; MESSAGE PASSING SYSTEMS; SEQUENTIAL COMPOSITIONS; SYSTEM SPECIFICATION; TEMPORAL FORMULAE; TEMPORAL MODALITIES; UNIFORMLY BOUNDED;

MESSAGE PASSING;

EID: 35248870556     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36384-x_22     Document Type: Article

References (18)

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., Peled, D. and Penczek, W., "Model checking of causality properties", Proc. LICS, 1995, 90-100.
3. Alur, R. and Yannakakis, M., "Model checking of message sequence charts", Proc. CONCUR 1999, Springer-Verlag LNCS 1664, 1999, 114-129.
4. Bollig, B. and Leucker, M., "Modelling, specifying and verifying message passing systems", Proc. TIME 2001, 2001, 240-247.
5. Elrad, T. and Francez, N., "Decomposition of distributed programs into communication closed layers", Science of Computer Programming, 2, 1982, 155-173.
6. Gunter, E., Muscholl, A. and Peled, D., "Compositional message sequence charts", Proc. TACAS 2001, Springer-Verlag LNCS 2031, 2001, 496-511.
7. Henriksen, J.G., Mukund, M., Narayan Kumar and Thiagarajan, P.S., "Regular collections of message sequence charts", Proc. MFCS 2000, Springer-Verlag LNCS 1893, 2000, 405-414.
8. Lamport, L., "Time, clocks and ordering of events in a distributed system", Communications of ACM 21(7), 1978, 558-565.
9. Madhusudan, P., "Reasoning about sequential and branching behaviours of message sequence graphs", Proc. ICALP 2001, Springer-Verlag LNCS 2076, 2001, 396-407.
10. Madhusudan, P. and Meenakshi, B., "Beyond message sequence graphs", Proc. FST & TCS 2001, Springer-Verlag LNCS 2245, 2001, 256-267.
11. Meenakshi, B. and Ramanujam, R., "Reasoning about message passing in finite state environments", Proc. ICALP 2000, LNCS 1853, 2000, 487-198.
12. Meenakshi, B. and Ramanujam, R., "Reasoning about layered message passing systems", full version, http://www.imsc.res.in/∼bmeena.
13. Peled, D., "Specification and verification of message sequence charts", In Proc. IFIP FORTE/PSTV, 2000, 139-154.
14. Poel, M. and Zwiers, J., "Layering techniques for development of parallel systems", Proc. CAV, 1992, 16-29.
15. Ramanujam, R., "Locally linear time temporal logic", Proc. LICS, 1996, 118-127.
16. Rudolph, E., Graubmann, P. and Grabowski, J., "Tutorial on message sequence charts", Computer Networks and ISDN Systems - SDL and MSC, Vol. 28, 1996, 1629-1641.
17. Thiagarajan, P.S., "A trace based extension of propositional linear time temporal logic", Proc. LICS, 1994, 438-447.
18. ITU-TS Recommendation Z.120 - Message sequence chart, ITU-TS, 1997.