Triggered message sequence charts

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Triggered message sequence charts

Full text

Pdf (926 KB)

Source

ACM SIGSOFT Software Engineering Notes archive
Volume 27 , Issue 6 (November 2002) table of contents

SESSION: Session 10: dynamic response systems table of contents

Pages: 167 - 176

Year of Publication: 2002

ISSN:0163-5948

Authors

Bikram Sengupta	SUNY at Stony Brook, Stony Brook, NY
Rance Cleaveland	SUNY at Stony Brook, Stony Brook, NY

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 16, Citation Count: 1

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/605466.605492 What is a DOI?

ABSTRACT

We propose an extension to Message Sequence Charts called Triggered Message Sequence Charts (TMSCs) that are intended to capture system specifications involving nondeterminism in the form of conditional scenarios. The visual syntax of TMSCs closely resembles that of MSCs; the semantics allows us to translate a TMSC specification into a framework that supports a notion of refinement based on Denicola's and Hennessy's must preorder. A simple but non-trivial example illustrates the utility of our extension to MSCs.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	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	Thomas A. Alspaugh , Annie I. Anton, Scenario Networks for Software Specification and Scenario Management, North Carolina State University at Raleigh, Raleigh, NC, 2001
	4	Rajeev Alur , Mihalis Yannakakis, Model Checking of Message Sequence Charts, Proceedings of the 10th International Conference on Concurrency Theory, p.114-129, August 24-27, 1999
	5	K. Mani Chandy , Leslie Lamport, Distributed snapshots: determining global states of distributed systems, ACM Transactions on Computer Systems (TOCS), v.3 n.1, p.63-75, Feb. 1985 [doi>10.1145/214451.214456]
	6	Rance Cleaveland , Joachim Parrow , Bernhard Steffen, The concurrency workbench: a semantics-based tool for the verification of concurrent systems, ACM Transactions on Programming Languages and Systems (TOPLAS), v.15 n.1, p.36-72, Jan. 1993 [doi>10.1145/151646.151648]
	7	Werner Damm , David Harel, LSCs: Breathing Life into Message Sequence Charts, Formal Methods in System Design, v.19 n.1, p.45-80, July 2001 [doi>10.1023/A:1011227529550]
	8	Matthew Hennessy, Algebraic theory of processes, MIT Press, Cambridge, MA, 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 Eigth 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.