Realizability and verification of MSC graphs

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

Volumn 2076 LNCS, Issue , 2001, Pages 797-808

  Alur, Rajeev ^a,b   Etessami, Kousha ^b   Yannakakis, Mihalis ^b  

^a Dept of Computer and Info Science ^*  (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; DISTRIBUTED COMPUTER SYSTEMS; FLOWCHARTING; GRAPH THEORY; GRAPHIC METHODS; POLYNOMIAL APPROXIMATION; SPECIFICATIONS; TEMPORAL LOGIC; COMPUTATIONAL LINGUISTICS; POLYNOMIALS;

BOOLEAN COMBINATIONS; DISTRIBUTED IMPLEMENTATION; LTL MODEL-CHECKING; MESSAGE SEQUENCE CHARTS; POLYNOMIAL-TIME; SCENARIO-BASED SPECIFICATIONS; TEMPORAL LOGIC SPECIFICATIONS; VERIFICATION PROBLEMS;

MODEL CHECKING;

EID: 84879514151     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48224-5_65     Document Type: Conference Paper

References (12)

1. R. Alur, K. Etessami, and M. Yannakakis. Inference of message sequence charts. In Proc. of 22nd Int. Conf. on Software Engineering, 2000.
2. R. Alur, G. J. Holzmann, and D. Peled. An analyzer for message sequence charts. Software Concepts and Tools, 17(2):70-77, 1996.
3. R. Alur and M. Yannakakis. Model checking of message sequence charts. In Concurrency Theory, Tenth Intl. Conference, LNCS 1664, pages 114-129, 1999.
4. H. Ben-Abdallah and S. Leue. MESA: Support for scenario-based design of concurrent systems. In Proc. 4th TACAS, LNCS 1384, pages 118-135, 1998.
5. G. Booch, I. Jacobson, and J. Rumbaugh. Unified Modeling Language User Guide. Addison Wesley, 1997.
6. H. Ben-Abdallah and S. Leue. Syntactic detection of process divergence and non-local choice in message sequence charts. In Proc. 2nd TACAS, 1997.
7. J. Henriksen, M. Mukund, K. Narayan Kumar, and P. S. Thiagarajan. On message sequence graphs and finitely generated regular MSC languages. In Proc. 27th ICALP, LNCS 1853, pp. 675-686, 2000.
8. 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.
9. A. Muscholl, D. Peled, and Z. Su. Deciding properties of message sequence charts. In Foundations of Software Science and Computation Structures, 1998.
10. D. Peled. Specification and verification of message sequence charts. In Proc. IFIP FORTE/PSTV, 2000.
11. T. J. Schaefer. The complexity of satisfiability problems. In Proc. 10th ACM Symp. on Theory of Computing, pages 216-226, 1978.
12. ITU-T recommendation Z. 120. Message Sequence Charts (MSC'96), 1996.