Model checking of message sequence charts

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

Volumn 1664 LNCS, Issue , 1999, Pages 114-129

  Alur, Rajeev ^a   Yannakakis, Mihalis ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FLOWCHARTING; GRAPHIC METHODS; SEMANTICS; SPECIFICATIONS;

ASYNCHRONOUS MODELS; DISTRIBUTED SOFTWARE SYSTEM; MESSAGE EXCHANGE; MESSAGE SEQUENCE CHARTS; MODEL CHECKING PROBLEM; SCENARIO-BASED SPECIFICATIONS; STRUCTURED SPECIFICATION; SYNCHRONOUS MODELS;

MODEL CHECKING;

EID: 84888232448     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48320-9_10     Document Type: Conference Paper

References (22)

1. R. Alur, G.J. Holzmann, and D. Peled. An analyzer for message sequence charts. Software Concepts and Tools, 17(2):70-77, 1996.
2. R. Alur and M. Yannakakis. Model checking of hierarchical state machines. In Proc. Sixth ACM FSE, 175-188, 1998.
3. G. Booch, I. Jacobson, and J. Rumbaugh. Unified Modeling Language User Guide. Addison Wesley, 1997.
4. H. Ben-Abdallah and S. Leue. Syntactic detection of process divergence and nonlocal choice in message sequence charts. In Proc. of TACAS. 1997.
5. E.M. Clarke and E.A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proc. Workshop on Logic of Programs, LNCS 131, pages 52-71, 1981.
6. E.M. Clarke and R.P. Kurshan. Computer-aided verification. IEEE Spectrum, 33(6):61-67, 1996.
7. J. Feigenbaum, J. A. Kahn, and C. Lund. Complexity results for pomset languages. In Proc. CAV, 1991.
8. D. Harel. Statecharts: A visual formalism for complex systems. Science of Computer Programming, 8:231-274, 1987.
9. G.J. Holzmann. Early fault detection tools. Software Concepts and Tools, 17(2):63-69, 1996.
10. G.J. Holzmann. The model checker spin. IEEE Trans. on Software Engineering, 23(5):279-295, 1997.
11. G.J. Holzmann, D.A. Peled, and M.H. Redberg. Design tools for for requirements engineering. Lucent Bell Labs Technical Journal, 2(1):86-95, 1997.
12. R.P. Kurshan. Computer-aided Verification of Coordinating Processes: the automata-theoretic approach. Princeton University Press, 1994.
13. P. Ladkin and S. Leue. Interpreting message flow graphs. Formal Aspects of Computing, 3, 1994.
14. V. Levin, and D. Peled. Verification of message sequence charts via template matching. In Proc. TAPSOFT, 1997.
15. A. Muscholl, D. Peled, and Z. Su. Deciding properties of message sequence charts. In Found. of Software Science and Computation Structures, 1998.
16. S. Mauw and M.A. Reniers. An algebraic semantics of basic message sequence charts. Computer Journal, 37, 1994.
17. V.R. Pratt. Modeling concurrency with partial orders. International Journal of Parallel Programming, 15(1), 1986.
18. E. Rudolph, P. Graubmann, and J. Gabowski. Tutorial on message sequence charts. In Computer Networks and ISDN Systems, volume 28. 1996.
19. B. Selic, G. Gullekson, and P.T. Ward. Real-time object oriented modeling and design. J. Wiley, 1994.
20. M.Y. Vardi and P.Wolper. An automata-theoretic approach to automatic program verification. In Proc. First LICS, pages 332-344, 1986.
21. CCITT Specification and Description Language (SDL). ITU-T, 1994
22. Message Sequence Charts (MSC'96). ITU-T, 1996.