The complexity of live sequence charts

Lecture Notes in Computer Science

Volumn 3441, Issue , 2005, Pages 364-378

  Bontemps, Yves ^a   Schobbens, Pierre Yves ^a  

^a UNIVERSITY OF NAMUR   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; FLOWCHARTING; MATHEMATICAL MODELS; PROBLEM SOLVING; SOFTWARE ENGINEERING;

MODEL-CHECKING; SEQUENCE CHARTS; VERIFICATION PROBLEMS;

COMPUTATIONAL COMPLEXITY;

EID: 24644449798     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31982-5_23     Document Type: Conference Paper

References (25)

1. International Telecommunication Union (ITU) Geneva: MSC-2000: ITU-T Recommendation Z.120: Message Sequence Chart (MSC). (2000) http://www.itu.int/.
2. Object Management Group (UML Revision Task Force): OMG UML Specification (2.0). (2003) http://www.omg.org/uml.
3. Damm, W., Harel, D.: LSCs: Breathing life into message sequence charts. Formal Methods in System Design 19 (2001) 45-80
4. Weidenhaupt, K., Pohl, K., Jarke, M., Haumer, P.: Scenario Usage in System Development: A Report on Current practice. IEEE Software 15 (1998) 34-45
5. Amyot, D., Eberlein, A.: An evaluation of scenarion notations for telecommunication systems development. Telecommunications Systems Journal 24 (2003) 61-94
6. Muscholl, A., Peled, D., Su, Z.: Deciding Properties of Message Sequence Charts. Foundations of Software Science and Computer Structures (1998)
7. Bontemps, Y., Heymans, P.: As fast as sound (lightweight formal scenario synthesis and verification). In Giese, H., Krüger, I., eds.: Proc. of the 3rd Int. Workshop on "Scenarios and State Machines: Models, Algorithms and Tools" (SCESM'04), Edinburgh, IEE (2004) 27-34
8. Harel, D.: From play-in scenarios to code: An achievable dream. IEEE Computer 34 (2001) 53-60
9. a previous version appeared in Proc. of FASE'00, LNCS(1783), Springer-Verlag.
10. Bontemps, Y., Heymans, P., Kugler, H.: Applying LSCs to the specification of an air traffic control system. In Uchitel, S., Bordeleau, F., eds.: Proc. of the 2nd Int. Workshop on "Scenarios and State Machines: Models, Algorithms and Tools" (SCESM'03), Portland, OR, USA, IEEE (2003)
11. Bohn, J., Damm, W., Klose, J., Moik, A., Wittke, H.: Modeling and validating train system applications using statemate and live sequence charts. In Ehrig, H., Krämer, B.J., Ertas, A., eds.: Proceedings of the Conference on Integrated Design and Process Technology (IDPT2002), Society for Design and Process Science (2002)
12. Bunker, A., Gopalakrishnan, G.: Verifying a VCI Bus Interface Model Using an LSC-based Specification. In Ehrig, H., Krämer, B.J., Ertas, A., eds.: Proceedings of the Sixth Biennial World Conference on Integrated Design and Process Technology, Society of Design and Process Science (2002) 48
13. Kam, N., Harel, D., Kugler, H., Marelly, R., Pnueli, A., Hubbard, J.A., Stern, M.J.: Formal modelling of c. elegans development; a scenario-based approach. In Ciobanu, G., Rozenberg, G., eds.: Modelling in Molecular Biology. Natural Computing Series. Springer (2004) 151-173
14. Bontemps, Y., Schobbens, P.Y., Löding, C.: Synthesis of open reactive systems from scenario-based specifications. Fundamenta Informaticae 62 (2004) 139-169
15. Lynch, N.A., Tuttle, M.R.: An introduction to input/output automata. CWI Quarterly 2 (1989) 219-246
16. Harel, D., Vardi, M.Y., Kupferman, O.: On the complexity of verifying concurrent transition systems. Information and Computation 173 (2002)
17. Papadimitriou, C.H.: Computational Complexity. Addison-Wesley (1994)
18. Harel, D., Marelly, R.: Come, let's play! Scenario-based programming using LSCs and the Play-engine. Springer (2003) ISBN 3-540-00787-3.
19. th Intl. Conference on Formal Methods in Computer-Aided Design (FMCAD'02), Portland, Oregon. (2002)
20. Abadi, M., Lamport, L., Wolper, P.: Realizable and unrealizable specifications of reactive systems. In Ausiello, G., Dezani-Ciancaglini, M., Rocca, S.R.D., eds.: Automata, Languages and Programming, 16th International Colloquium, ICALP89, Stresa, Italy, July 11-15, 1989, Proceedings. Volume 372 of Lect. Notes in Comp. Sci., Springer (1989)
21. Pnueli, A., Rosner, R.: On the Synthesis of a Reactive Module. In: Proceedings of the sixteenth annual ACM symposium on Principles of programming languages. (1989) 179-190
22. Maidl, M.: The common fragment of CTL and LTL. In: Proc. 41st Annual Symposium on Foundations of Computer Science. (2000) 643-652
23. Pnueli, A., Rosner, R.: On the synthesis of an asynchronous reactive module. In Ausiello, G., Dezani-Ciancaglini, M., Rocca, S.R.D., eds.: Automata, Languages and Programming, 16th International Colloquium (ICALP). Volume 372 of Lect. Notes in Comp. Sci., Stresa, Italy, Springer-Verlag (1989) 652-671
24. Tripakis, J.: Undecidable problems of decentralized observation and control on regular languages. Information Processing Letters 90 (2004)
25. Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. Journal of the ACM 28 (1981) 114-133