Beyond message sequence graphs

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

Volumn 2245, Issue , 2001, Pages 256-267

  Madhusudan, P ^a   Meenakshi, B ^b  

^a CHENNAI MATHEMATICAL INSTITUTE   (India)

^b INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

FLOWCHARTING; GRAPHIC METHODS;

MESSAGE SEQUENCE CHARTS; MESSAGE SEQUENCE GRAPHS; MODEL CHECKING PROBLEM; SECOND ORDERS; TWO WAYS;

MODEL CHECKING;

EID: 84944038064     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45294-x_22     Document Type: Conference Paper

References (15)

1. R. Alur, K. Etessami, and M. Yannakakis. Inference of message sequence charts. In Proc. 22nd Intl. Conf. on Software Engg., pages 304–313, 2000.
2. R. Alur and M. Yannakakis. Model checking of message sequence charts. In Proc. CONCUR ’99, vol. 1664 of LNCS. Springer-Verlag, 1999.
3. E. Gunter, A. Muscholl, and D. Peled. Compositional message sequence charts. In Proc. TACAS’01, vol. 2031 of LNCS, pages 496–511. Springer-Verlag, 2001.
4. J.G. Henriksen, M. Mukund, Narayan Kumar, and P.S. Thiagarajan. Towards a theory of regular MSC languages. BRICS Report RS-99-52, Department of Computer Science, Aarhus University, Denmark, 1999.
5. J.G. Henriksen, M. Mukund, Narayan Kumar, and P.S. Thiagarajan. On message sequence graphs and finitely generated regular MSC languages. In Proc. ICALP ’00, vol. 1853 of LNCS. Springer-Verlag, 2000.
6. J.G. Henriksen, M. Mukund, Narayan Kumar, and P.S. Thiagarajan. Regular collections of Message Sequence Charts. In Proc. MFCS ’00, vol. 1893 of LNCS. Springer-Verlag, 2000.
7. ITU-TS Recommendation Z.120. Message sequence chart (MSC). ITUTS, 1997
8. P. Madhusudan. Reasoning about sequential and branching behaviours of message sequence graphs. In Proc. ICALP ’01, vol. 2076 of LNCS. Springer-Verlag, 2001.
9. P. Madhusudan, B. Meenakshi. Beyond Message Sequence Graphs. Institute of Mathematical Sciences Technical Report, IMSc./2001/09/51. Available at http://www.imsc.ernet.in/∼madhuor/∼bmeena.
10. B. Meenakshi and R. Ramanujam. Reasoning about message passing in finite state environments. In Proc. ICALP ’00, vol. 1853 of LNCS. Springer-Verlag, 2000.
11. D. Peled. Specification and verification of message sequence charts. In Proc. IFIP FORTE/PSTV, 2000.
12. E. Rudolph, P. Graubmann, and J. Grabowski. Tutorial on message sequence charts. In Computer Networks and ISDN Systems—SDL and MSC, Vol. 28, 1996.
13. W. Thomas. Automata on infinite objects. Handbook of Theoretical Computer Science, pages 165–191, 1990.
14. W. Thomas. Languages, automata, and logic. Handbook of Formal Language Theory, III:389–455, 1997.
15. P.S. Thiagarajan and I. Walukiewicz. An expressively complete linear time temporal logic for Mazurkiewicz traces. In Proc. 12th IEEE Conf. on Logic in Computer Science. IEEE Computer Society, 1997.