Skip to main content
Springer Nature Link
Log in

Some Results on the Expressive Power and Complexity of LSCs

  • Chapter
Pillars of Computer Science

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4800))

  • 997 Accesses

Abstract

We survey some of the main results regarding the complexity and expressive power of Live Sequence Charts (LSCs). We first describe the two main semantics given to LSCs: a trace-based semantics and an operational semantics. The expressive power of the language is then examined by describing translations into various temporal logics. Some limitations of the language are also discussed. Finally, we survey complexity results, mainly due to Bontemps and Schobbens, regarding the use of LSCs for model checking, execution, and synthesis.

The research was supported in part by The John von Neumann Minerva Center for the Development of Reactive Systems at the Weizmann Institute of Science and by a Grant from the G.I.F., the German-Israeli Foundation for Scientific Research and Development.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Bontemps, Y.: Relating Inter-Agent and Intra-Agent Specifications (The Case of Live Sequence Charts). PhD thesis, Facultés Universitaires Notre-Dame de la Paix, Institut d’Informatique (University of Namur, Computer Science Dept) (April 2005)

    Google Scholar 

  2. Bontemps, Y., Schobbens, P.-Y.: The Complexity of Live Sequence Charts. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 364–378. Springer, Heidelberg (2005)

    Google Scholar 

  3. Bontemps, Y., Schobbens, P.-Y.: The Computational Complexity of Scenario-Based Agent Verification and Design. J. Applied Logic 5(2), 252–276 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bontemps, Y., Schobbens, P.-Y., Löding, C.: Synthesis of Open Reactive Systems from Scenario-Based Specifications. Fundam. Inform. 62(2), 139–169 (2004)

    MATH  Google Scholar 

  5. Brill, M., et al.: Live Sequence Charts: An Introduction to Lines, Arrows, and Strange Boxes in the Context of Formal Verification. In: Ehrig, H., et al. (eds.) INT 2004. LNCS, vol. 3147, pp. 374–399. Springer, Heidelberg (2004)

    Google Scholar 

  6. Bunker, A., Gopalakrishnan, G., Slind, K.: Live Sequence Charts Applied to Hardware Requirements Specification and Verification: A VCI Bus Interface Model. Software Tools for Technology Transfer 7(4), 341–350 (2005)

    Article  Google Scholar 

  7. Clarke, E.M., Draghicescu, I.A.: Expressibility Results for Linear-Time and Branching-Time Logics. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. LNCS, vol. 354, pp. 428–437. Springer, Heidelberg (1989)

    Chapter  Google Scholar 

  8. Combes, P., Harel, D., Kugler, H.: Modeling and Verification of a Telecommunication Application Using Live Sequence Charts and the Play-Engine Tool. In: Peled, D.A., Tsay, Y.-K. (eds.) ATVA 2005. LNCS, vol. 3707, pp. 414–428. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  9. Damm, W., Harel, D.: LSCs: Breathing Life into Message Sequence Charts. J. on Formal Methods in System Design 19(1), 45–80 (2001); Preliminary version In: Ciancarini, P., Fantechi, A., Gorrieri, R. (eds.) Proc. 3rd IFIP Int. Conf. on Formal Methods for Open Object-Based Distributed Systems (FMOODS 1999), pp. 293–312. Kluwer Academic Publishers, Dordrecht (1999)

    Google Scholar 

  10. Damm, W., Toben, T., Westphal, B.: On the Expressive Power of Live Sequence Charts. In: Reps, T., Sagiv, M., Bauer, J. (eds.) Wilhelm Festschrift. LNCS, vol. 4444, pp. 225–246. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  11. Fisher, J., et al.: Combining State-Based and Scenario-Based Approaches in Modeling Biological Systems. In: Danos, V., Schachter, V. (eds.) CMSB 2004. LNCS (LNBI), vol. 3082, pp. 236–241. Springer, Heidelberg (2005)

    Google Scholar 

  12. Harel, D., Kleinbort, A., Maoz, S.: S2A: A Compiler for Multi-modal UML Sequence Diagrams. In: Dwyer, M.B., Lopes, A. (eds.) FASE 2007. LNCS, vol. 4422, pp. 121–124. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  13. Harel, D., Kugler, H.: Synthesizing State-Based Object Systems from LSC Specifications. Int. J. of Foundations of Computer Science 13(1), 5–51 (2002) Also: Harel, D., Kugler, H.: Synthesizing State-Based Object Systems from LSC Specifications. In: Yu, S., Păun, A. (eds.) CIAA 2000. LNCS, vol. 2088, pp. 1–33. Springer, Heidelberg (2001) Preliminary version appeared as technical report MCS99-20, Weizmann Institute of Science (1999)

    Google Scholar 

  14. Harel, D., et al.: Smart Play-out of Behavioral Requirements. In: Aagaard, M.D., O’Leary, J.W. (eds.) FMCAD 2002. LNCS, vol. 2517, pp. 378–398. Springer, Heidelberg (2002)

    Google Scholar 

  15. Harel, D., Kugler, H., Pnueli, A.: Synthesis Revisited: Generating Statechart Models from Scenario-Based Requirements. In: Kreowski, H.-J., et al. (eds.) Formal Methods in Software and Systems Modeling. LNCS, vol. 3393, pp. 309–324. Springer, Heidelberg (2005)

    Google Scholar 

  16. Harel, D., Maoz, S.: Assert and Negate Revisited: Modal Semantics for UML Sequence Diagrams. Software and Systems Modeling (SoSyM) (to appear, 2007)

    Google Scholar 

  17. Harel, D., Marelly, R.: Playing with Time: On the Specification and Execution of Time-Enriched LSCs. In: MASCOTS, pp. 193–202. IEEE Computer Society, Los Alamitos (2002)

    Google Scholar 

  18. Harel, D., Marelly, R.: Come, Let’s Play: Scenario-Based Programming Using LSCs and the Play-Engine. Springer, Heidelberg (2003)

    Google Scholar 

  19. Harel, D., Marelly, R.: Specifying and Executing Behavioral Requirements: The Play-In/Play-Out Approach. Software and Systems Modeling (SoSyM) 2(2), 82–107 (2003)

    Article  Google Scholar 

  20. Harel, D., Segall, I.: Planned and Traversable Play-Out: A Flexible Method for Executing Scenario-Based Programs. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 485–499. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  21. ITU. International Telecommunication Union Recommendation Z.120: Message Sequence Charts. Technical report (1996)

    Google Scholar 

  22. Klose, J., et al.: Check It Out: On the Efficient Formal Verification of Live Sequence Charts. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 219–233. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  23. Klose, J., Wittke, H.: An Automata Based Interpretation of Live Sequence Chart. In: Margaria, T., Yi, W. (eds.) ETAPS 2001 and TACAS 2001. LNCS, vol. 2031, pp. 512–527. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  24. Kugler, H., et al.: Temporal Logic for Scenario-Based Specifications. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 445–460. Springer, Heidelberg (2005)

    Google Scholar 

  25. Kugler, H., Stern, M.J., Hubbard, E.J.A.: Testing Scenario-Based Models. In: Dwyer, M.B., Lopes, A. (eds.) FASE 2007. LNCS, vol. 4422, pp. 306–320. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  26. Lettrari, M., Klose, J.: Scenario-Based Monitoring and Testing of Real-Time UML Models. In: Gogolla, M., Kobryn, C. (eds.) UML 2001. LNCS, vol. 2185, pp. 317–328. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  27. Lo, D., Maoz, S., Khoo, S.-C.: Mining Modal Scenario-Based Specification from Execution Traces of Reactive Systems. In: Proc. 22nd IEEE/ACM Int. Conf. on Automated Software Engineering (ASE 2007), pp. 465–468 (2007)

    Google Scholar 

  28. Maidl, M.: The Common Fragment of CTL and LTL. In: FOCS, pp. 643–652 (2000)

    Google Scholar 

  29. Maoz, S., Harel, D.: From Multi-Modal Scenarios to Code: Compiling LSCs into AspectJ. In: Proc. 14th Int. ACM/SIGSOFT Symp. Foundations of Software Engineering (FSE-14), Portland, Oregon, pp. 219–230 (November 2006)

    Google Scholar 

  30. Marelly, R., Harel, D., Kugler, H.: Multiple Instances and Symbolic Variables in Executable Sequence Charts. In: Proc. 17th ACM Conf. on Object-Oriented Prog., Systems, Lang. and App. (OOPSLA 2002), Seattle, WA, pp. 83–100 (2002)

    Google Scholar 

  31. Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)

    MATH  Google Scholar 

  32. Savitch, W.J.: Relationships Between Nondeterministic and Deterministic Tape Complexities. J. Comput. Syst. Sci. 4(2), 177–192 (1970)

    MATH  MathSciNet  Google Scholar 

  33. Schinz, I., et al.: The Rhapsody UML Verification Environment. In: Proc. of the 2nd Int. Conf. on Software Engineering and Formal Methods (SEFM 2004), pp. 174–183. IEEE Computer Society Press, Washington, DC, USA (2004)

    Chapter  Google Scholar 

  34. Sistla, A.P., Clarke, E.M.: The Complexity of Propositional Linear Temporal Logics. J. ACM 32(3), 733–749 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  35. UML. Unified Modeling Language Superstructure Specification, v2.0. OMG spec., OMG (August 2005), http://www.omg.org

Download references

Author information

Authors and Affiliations

  1. The Weizmann Institute of Science, Rehovot, Israel

    David Harel, Shahar Maoz & Itai Segall

Authors
  1. David Harel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shahar Maoz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Itai Segall
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Arnon Avron Nachum Dershowitz Alexander Rabinovich

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Harel, D., Maoz, S., Segall, I. (2008). Some Results on the Expressive Power and Complexity of LSCs. In: Avron, A., Dershowitz, N., Rabinovich, A. (eds) Pillars of Computer Science. Lecture Notes in Computer Science, vol 4800. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78127-1_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-78127-1_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-78126-4

  • Online ISBN: 978-3-540-78127-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics