Inference of message sequence charts

Proceedings - International Conference on Software Engineering

Volumn , Issue , 2000, Pages 304-313

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

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENT AUTOMATON FRAMEWORK; CONCURRENT STATE MACHINES; DEADLOCK FREEDOM; MESSAGE SEQUENCE CHARTS; POLYNOMIAL TIME ALGORITHMS; REALIZABILITY;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; INFERENCE ENGINES; MATHEMATICAL MODELS; POLYNOMIALS;

SOFTWARE ENGINEERING;

EID: 0033682244     PISSN: 02705257     EISSN: None     Source Type: Journal    
DOI: 10.1109/ICSE.2000.870421     Document Type: Article

References (20)

1. R. Alur, G. 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 message sequence charts. In CONCUR'99: Concurrency Theory, Tenth International Conference, LNCS 1664, pages 114-129, 1999.
3. D. Angluin and C. H. Smith. Inductive inference: theory and methods. ACM Computing Surveys, 15:237-269, 1983.
4. H. Ben-Abdallah and S. Leue. Syntactic detection of process divergence and non-local choice in message sequence charts. In Proc. 2nd Int. Workshop on Tools and Algorithms for the Construction and Analysis of Systems, 1997.
5. H. Ben-Abdallah and S. Leue. MESA: Support for scenario-based design of concurrent systems. In Proc. 4th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, LNCS 1384, pages 118-135, 1998.
6. A. W. Biermann and J. A. Feldman. On the synthesis of finite state machines from samples of their behavior. IEEE Trans. Computers, pages 592-597, 1972.
7. W. Damm and D. Harel. LSCs: Breathing Conf into message sequence charts. In Proc. 3rd IFIP Conf. on Formal Methods for Open Object-Based Distributed Systems (FMOODS'99), pages 293-312, 1999.
8. V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific Publishing, 1995.
9. D. Harel and H. Kugler. Synthesizing object systems from LSC specifications. Unpublished draft, 1999.
10. G. Holzmann. Early fault detection tools. LNCS, 1055:1-13, 1996.
11. G. Holzmann, D. Peled, and M. Redberg. Design tools for requirements engineering. Bell Labs Technical Journal, 2(1):86-95, 1997.
12. K. Koskimies and E. Makinen. Automatic synthesis of state machines from trace diagrams. Software-Practice and Experience, 24(7):643-658,1994.
13. K. Koskimies, T. Männistö, T. Systä, and J. Tuomi. Automated support for OO software. IEEE Software, 15(1):87-94, Jan./Feb. 1998.
14. I. Kruger, R. Grosu, P. Scholz, and M. Broy. From MSCs to Statecharts. Distributed and Parallel Embedded Systems, 1999.
15. S. Leue, L. Mehrmann, and M. Rezai. Synthesizing ROOM models from message sequence chart specifications. In Proc. 13th IEEE Conf. on Automated Software Engineering, 1998.
16. ITU-T recommendation Z.120. Message Sequence Charts (MSC'96), May 1996. ITU Telecommunication Standardization Sector.
17. A. Muscholl, D. Peled, and Z. Su. Deciding properties of message sequence charts. In Foundations of Software Sci. and Comp. Structures, 1998.
18. C. Papadimitriou. The Theory of Database Concurrency Control. Computer Science Press, 1986.
19. E. Rudolph, P. Graubmann, and J. Gabowski. Tutorial on message sequence charts. In Computer Networks and ISDN Systems - SDL and MSC, volume 28. 1996.
20. J. Rumbaugh, I. Jacobson, and G. Booch. The Unified Modeling Language Reference Manual. Addison Wesley, 1999.