An analyzer for message sequence charts

Software-Concepts and Tools

Volumn 17, Issue 2, 1996, Pages 70-77

  Alur, Rajeev ^a   Holzmann, Gerard J ^a   Peled, Doron ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Design analysis; Message sequence chart; Requirements specification; Software design; Tool

Indexed keywords

EID: 0002185697     PISSN: 09458115     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (11)

1. Alur R, et al. (1995) Timing Verification by Successive Approximation. Information and Computation 118(1), 142-157
2. Cormen TH, Leiserson CE, Rivest RL (1990) Introduction to Algorithms. MIT press
3. Dill DL (1989) Timing Assumptions and Verification of Finite-State Concurrent Systems. In Automatic Verification Methods for Finite-State Systems, LNCS 407, 197-212
4. Floyd RW (1962) Algorithm 97 (Shortest Path). Communications of the ACM 5, 365
5. Holzmann GJ (1991) Design and Validation of Computer Protocols. Prentice Hall Software Series
6. ITU-T Recommendation Z.120, Message Sequence Chart (MSC), (March 1993) (Includes [7] as Annex B.)
7. Ladkin PB, Leue S (1995) What do Message Sequence Charts Mean? In Formal Description Techniques, (FORTE'95), Elsevier, 301-315
8. Mauw S, Reniers MA (1994) An Algebraic Semantics of Basic Message Sequence Charts. The Computer Journal, 37(4)
9. Ousterhout J (1994) Tcl and the Tk Toolkit. Addison-Wesley
10. Papadimitriou CH, Steiglitz K (1982) Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall
11. Warshall S (1962) A Theorem on Boolean Matrices. Journal of the ACM, 9 (1962), 11-12