Triggered message sequence charts

Proceedings of the ACM SIGSOFT Symposium on the Foundations of Software Engineering

Volumn , Issue , 2002, Pages 167-176

  Sengupta, Bikram ^a   Cleaveland, Rance ^a  

^a Stony Brook University   (United States)

Author keywords

Message sequence charts; Refinement orderings; Scenario based requirements

Indexed keywords

COMPUTER HARDWARE DESCRIPTION LANGUAGES; FORMAL LANGUAGES; REQUIREMENTS ENGINEERING; SEMANTICS;

REFINEMENT ORDERINGS; TRIGGERED MESSAGE SEQUENCE CHARTS;

SOFTWARE ENGINEERING;

EID: 0038349050     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/587051.587077     Document Type: Conference Paper

References (13)

1. Message sequence charts (MSC). ITU-TS Recommendation Z.120, 1996.
2. T. Alspaugh and A. Antón. Scenario networks: A case study of the enhanced messaging system. Seventh International Workshop on Requirements Engineering: Foundation for Software Quality (REFSQ'01), 2001.
3. T. Alspaugh and A. Antón. Scenario networks for software specification and scenario management. Technical Report TR-2001-15. North Carolina State University, 2001.
4. R. Alur and M. Yannakakis. Model checking of message sequence charts. Proceedings of the Tenth International Conference on Concurrency Theory, LNCS 1664, Springer: 82-97, 1999.
5. K. M. Chandi and L. Lamport, Distributed snapshots: Determining global states of a distributed system. ACM Transactions of Computer Systems, 3(1):63-75, February 1985.
6. R. Cleaveland, J. Parrow, and B. Steffen. The Concurrency Workbench: A semantics based tool for the verification of concurrent systems. ACM Transactions on Programming Languages and Systems, 15(1):36-72, 1993.
7. W. Damm and D. Harel, LSCs: Breathing life into message sequence charts. Formal Methods in System Design, 19(1), 2001.
8. M. Hennessy. Algebraic theory of processes. The MIT Press, 1988.
9. I. Kruger. Distributed system design with message sequence charts. PhD Thesis, Technical University of Munich, 2000.
10. P. B. Ladkin and S. Leue. Interpreting message flow graphs. Formal Aspects of Computing, 7(5):473-509, 1995.
11. S. Mauw and M. A. Reniers. An algebraic semantics of basic message sequence charts. The Computer Journal, 37(4), pages 269-277, 1994.
12. S. Mauw and M. A. Reniers. Operational semantics for MSC'96. Tutorials of the Eight SDL Forum SDL'97: Time for Testing - SDL, MSC and Trends, pages 135-152, 1997.
13. M. A. Reniers. Message sequence chart: Syntax and semantics. PhD Thesis, Eindhoven University of Technology, 1998.