Abstract
We are interested in implementing a fully automated software development process starting from sequence charts, which have proven their naturalness and usefulness in industry. We show in this paper that even for the simplest variants of sequence charts, there are strong impediments to the implementability of this dream. In the case of a manual development, we have to check the final implementation (the model). We show that centralized model-checking is co-NP-complete. Unfortunately, this problem is of little interest to industry. The real problem is distributed model-checking, that we show PSPACE complete, as well as several simple but interesting verification problems. The dream itself relies on program synthesis, formally called realizability. We show that the industrially relevant problem, distributed realizability, is undecidable. The less interesting problems of centralized and constrained realizability are exponential and doubly-exponential complete, respectively.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
International Telecommunication Union (ITU) Geneva: MSC-2000: ITU-T Recommendation Z.120: Message Sequence Chart, MSC (2000), http://www.itu.int/
Object Management Group (UML Revision Task Force): OMG UML Specification (2.0) (2003), http://www.omg.org/uml
Damm, W., Harel, D.: LSCs: Breathing life into message sequence charts. Formal Methods in System Design 19, 45–80 (2001)
Weidenhaupt, K., Pohl, K., Jarke, M., Haumer, P.: Scenario Usage in System Development: A Report on Current practice. IEEE Software 15, 34–45 (1998)
Amyot, D., Eberlein, A.: An evaluation of scenarion notations for telecommunication systems development. Telecommunications Systems Journal 24, 61–94 (2003)
Muscholl, A., Peled, D., Su, Z.: Deciding Properties of Message Sequence Charts. Foundations of Software Science and Computer Structures (1998)
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 2004), Edinburgh, IEE, pp. 27–34 (2004)
Harel, D.: From play-in scenarios to code: An achievable dream. IEEE Computer 34, 53–60 (2001); a previous version appeared in Proc. of FASE 2000. LNCS, vol. 1783. Springer, Heidelberg (2001)
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 2003), Portland, OR, USA. IEEE, Los Alamitos (2003)
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 (IDPT 2002), Society for Design and Process Science (2002)
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, p. 48 (2002)
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, pp. 151–173. Springer, Heidelberg (2004)
Bontemps, Y., Schobbens, P.Y., Löding, C.: Synthesis of open reactive systems from scenario-based specifications. Fundamenta Informaticae 62, 139–169 (2004)
Lynch, N.A., Tuttle, M.R.: An introduction to input/output automata. CWI Quarterly 2, 219–246 (1989)
Harel, D., Vardi, M.Y., Kupferman, O.: On the complexity of verifying concurrent transition systems. Information and Computation 173 (2002)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)
Harel, D., Marelly, R.: Come, let’s play! Scenario-based programming using LSCs and the Play-engine. Springer, Heidelberg (2003) ISBN 3-540-00787-3
Harel, D., Kugler, H., Marelly, R., Pnueli, A.: Smart Play-Out of Behavioral Requirements. In: Aagaard, M.D., O’Leary, J.W. (eds.) FMCAD 2002. LNCS, vol. 2517. Springer, Heidelberg (2002)
Abadi, M., Lamport, L., Wolper, P.: Realizable and unrealizable specifications of reactive systems. In: Ronchi Della Rocca, S., Ausiello, G., Dezani-Ciancaglini, M. (eds.) ICALP 1989. LNCS, vol. 372. Springer, Heidelberg (1989)
Pnueli, A., Rosner, R.: On the Synthesis of a Reactive Module. In: Proceedings of the sixteenth annual ACM symposium on Principles of programming languages, pp. 179–190 (1989)
Maidl, M.: The common fragment of CTL and LTL. In: Proc. 41st Annual Symposium on Foundations of Computer Science, pp. 643–652 (2000)
Pnueli, A., Rosner, R.: On the synthesis of an asynchronous reactive module. In: Ronchi Della Rocca, S., Ausiello, G., Dezani-Ciancaglini, M. (eds.) ICALP 1989. LNCS, vol. 372, pp. 652–671. Springer, Heidelberg (1989)
Tripakis, J.: Undecidable problems of decentralized observation and control on regular languages. Information Processing Letters 90 (2004)
Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. Journal of the ACM 28, 114–133 (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bontemps, Y., Schobbens, PY. (2005). The Complexity of Live Sequence Charts. In: Sassone, V. (eds) Foundations of Software Science and Computational Structures. FoSSaCS 2005. Lecture Notes in Computer Science, vol 3441. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31982-5_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-31982-5_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25388-4
Online ISBN: 978-3-540-31982-5
eBook Packages: Computer ScienceComputer Science (R0)