skip to main content
10.1145/1287624.1287663acmconferencesArticle/Chapter ViewAbstractPublication PagesfseConference Proceedingsconference-collections
Article

Symbolic message sequence charts

Published:07 September 2007Publication History

ABSTRACT

Message Sequence Charts (MSCs) are a widely used visual formalism for scenario-based specifications of distributed reactive systems. In its conventional usage, an MSC captures an interaction snippet between concrete objects in the system. This leads to voluminous specifications when the system contains several objectsthat are behaviorally similar. In this paper, we propose a lightweight syntactic and semantic extension of MSCs, called Symbolic MSCs or SMSCs, where an MSC lifeline can denote some/all objects from a collection. Our extensions give us substantially more modeling power. Moreover, we present a symbolic execution semantics for (structured collections of) our extended MSCs. This allows us to validate MSC-based system models capturing interactions between large, or even unbounded, number of objects. Since our extensions are only concerned with MSC lifelines, we believe that they can be integrated into existing standards such as UML 2.0.

References

  1. ITU-TS Recommendation Z.120, 1996. Message Sequence Charts (MSC).Google ScholarGoogle Scholar
  2. M. A. Reniers. Message Sequence Chart: Syntax and Semantics. PhD thesis, Technical University Eindhoven, 1999.Google ScholarGoogle Scholar
  3. H. Storrle. Semantics of interactions in UML 2.0. In Visual Languages and Formal Methods (VLFM), 2003.Google ScholarGoogle ScholarCross RefCross Ref
  4. Center-TRACON Automation System (CTAS) for air traffic control. http://ctas.arc.nasa.gov/.Google ScholarGoogle Scholar
  5. I. Kruger, W. Prenninger, and R. Sander. Broadcast MSCs. Formal Aspects of Computing, 16(3), 2004. Google ScholarGoogle ScholarCross RefCross Ref
  6. CTAS requirements document. http://scesm04.upb.de/case-study-2/requirements.pdf/.Google ScholarGoogle Scholar
  7. M. R. Mousavi, M. A. Reniers, and J. F. Groote. Congruence for SOS with data. In LICS, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. A. Pnueli, J. Xu, and L. Zuck. Liveness with (0,1,infinity)-counter abstraction. In CAV, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. XSB logic programming system. http://xsb.sourceforge.net/.Google ScholarGoogle Scholar
  10. A. Goel, S. Meng, A. Roychoudhury, and P. S. Thiagarajan. Interacting process classes. In ICSE, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. B. Genest, M. Minea, A. Muscholl, and D. Peled. Specifying and verifying partial order properties using template MSCs. In FOSSACS, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  12. B. Sengupta and R. Cleaveland. Triggered message sequence charts. In FSE, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. W. Damm and D. Harel. LSCs: Breathing life into message sequence charts. Formal Methods in System Design, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. S. Uchitel, J. Kramer, and J. Magee. Negative scenarios for implied scenario elicitation. In FSE, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. D. Harel and R. Marelly. Come, Let's Play: Scenario-Based Programming Using LSCs and the Play-Engine. Springer-Verlag, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Symbolic message sequence charts

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      ESEC-FSE '07: Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
      September 2007
      638 pages
      ISBN:9781595938114
      DOI:10.1145/1287624

      Copyright © 2007 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 7 September 2007

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      Overall Acceptance Rate112of543submissions,21%

      Upcoming Conference

      FSE '24

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader