Deciding properties for message sequence charts

Anca Muscholl; Doron Peled; Zhendong Su

doi:10.1007/bfb0053553

Deciding properties for message sequence charts

Anca Muscholl, Doron Peled, Zhendong Su

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

80 Scopus citations

Abstract

Message sequence charts (MSC) are commonly used in designing communication systems. They allow describing the communication skeleton of a system and can be used for finding design errors. First, a specification formalism that is based on MSC graphs, combining finite message sequence charts, is presented. We present then an automatic validation algorithm for systems described using the message sequence charts notation. The validation problem is tightly related to a natural language-theoretic problem over semi-traces (a generalization of Mazurkiewicz traces, which represent partially ordered executions). We show that a similar and natural decision problem is undecidable.

Original language	English
Title of host publication	Foundations of Software Science and Computation Structures - 1st International Conference, FoSSaCS 1998 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 1998, Proceedings
Editors	Maurice Nivat
Publisher	Springer Verlag
Pages	226-242
Number of pages	17
ISBN (Print)	3540643001, 9783540643005
DOIs	https://doi.org/10.1007/bfb0053553
State	Published - 1998
Externally published	Yes
Event	1st International Conference on Foundations of Software Science and Computation Structures, FoSSaCS 1998 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 1998 - Lisbon, Portugal Duration: 28 Mar 1998 → 4 Apr 1998

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1378
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	1st International Conference on Foundations of Software Science and Computation Structures, FoSSaCS 1998 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 1998
Country/Territory	Portugal
City	Lisbon
Period	28/03/98 → 4/04/98

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1998.

Access to Document

10.1007/bfb0053553

Cite this

Muscholl, A., Peled, D., & Su, Z. (1998). Deciding properties for message sequence charts. In M. Nivat (Ed.), Foundations of Software Science and Computation Structures - 1st International Conference, FoSSaCS 1998 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 1998, Proceedings (pp. 226-242). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1378). Springer Verlag. https://doi.org/10.1007/bfb0053553

Muscholl, Anca ; Peled, Doron ; Su, Zhendong. / Deciding properties for message sequence charts. Foundations of Software Science and Computation Structures - 1st International Conference, FoSSaCS 1998 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 1998, Proceedings. editor / Maurice Nivat. Springer Verlag, 1998. pp. 226-242 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{85642c3e94aa41fab6e9af3326325fb4,

title = "Deciding properties for message sequence charts",

abstract = "Message sequence charts (MSC) are commonly used in designing communication systems. They allow describing the communication skeleton of a system and can be used for finding design errors. First, a specification formalism that is based on MSC graphs, combining finite message sequence charts, is presented. We present then an automatic validation algorithm for systems described using the message sequence charts notation. The validation problem is tightly related to a natural language-theoretic problem over semi-traces (a generalization of Mazurkiewicz traces, which represent partially ordered executions). We show that a similar and natural decision problem is undecidable.",

author = "Anca Muscholl and Doron Peled and Zhendong Su",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1998.; 1st International Conference on Foundations of Software Science and Computation Structures, FoSSaCS 1998 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 1998 ; Conference date: 28-03-1998 Through 04-04-1998",

year = "1998",

doi = "10.1007/bfb0053553",

language = "אנגלית",

isbn = "3540643001",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "226--242",

editor = "Maurice Nivat",

booktitle = "Foundations of Software Science and Computation Structures - 1st International Conference, FoSSaCS 1998 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 1998, Proceedings",

address = "גרמניה",

}

Muscholl, A, Peled, D & Su, Z 1998, Deciding properties for message sequence charts. in M Nivat (ed.), Foundations of Software Science and Computation Structures - 1st International Conference, FoSSaCS 1998 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 1998, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1378, Springer Verlag, pp. 226-242, 1st International Conference on Foundations of Software Science and Computation Structures, FoSSaCS 1998 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 1998, Lisbon, Portugal, 28/03/98. https://doi.org/10.1007/bfb0053553

Deciding properties for message sequence charts. / Muscholl, Anca; Peled, Doron; Su, Zhendong.
Foundations of Software Science and Computation Structures - 1st International Conference, FoSSaCS 1998 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 1998, Proceedings. ed. / Maurice Nivat. Springer Verlag, 1998. p. 226-242 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1378).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Deciding properties for message sequence charts

AU - Muscholl, Anca

AU - Peled, Doron

AU - Su, Zhendong

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1998.

PY - 1998

Y1 - 1998

N2 - Message sequence charts (MSC) are commonly used in designing communication systems. They allow describing the communication skeleton of a system and can be used for finding design errors. First, a specification formalism that is based on MSC graphs, combining finite message sequence charts, is presented. We present then an automatic validation algorithm for systems described using the message sequence charts notation. The validation problem is tightly related to a natural language-theoretic problem over semi-traces (a generalization of Mazurkiewicz traces, which represent partially ordered executions). We show that a similar and natural decision problem is undecidable.

AB - Message sequence charts (MSC) are commonly used in designing communication systems. They allow describing the communication skeleton of a system and can be used for finding design errors. First, a specification formalism that is based on MSC graphs, combining finite message sequence charts, is presented. We present then an automatic validation algorithm for systems described using the message sequence charts notation. The validation problem is tightly related to a natural language-theoretic problem over semi-traces (a generalization of Mazurkiewicz traces, which represent partially ordered executions). We show that a similar and natural decision problem is undecidable.

UR - http://www.scopus.com/inward/record.url?scp=84947908141&partnerID=8YFLogxK

U2 - 10.1007/bfb0053553

DO - 10.1007/bfb0053553

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84947908141

SN - 3540643001

SN - 9783540643005

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 226

EP - 242

BT - Foundations of Software Science and Computation Structures - 1st International Conference, FoSSaCS 1998 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 1998, Proceedings

A2 - Nivat, Maurice

PB - Springer Verlag

T2 - 1st International Conference on Foundations of Software Science and Computation Structures, FoSSaCS 1998 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 1998

Y2 - 28 March 1998 through 4 April 1998

ER -

Muscholl A, Peled D, Su Z. Deciding properties for message sequence charts. In Nivat M, editor, Foundations of Software Science and Computation Structures - 1st International Conference, FoSSaCS 1998 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 1998, Proceedings. Springer Verlag. 1998. p. 226-242. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/bfb0053553

Deciding properties for message sequence charts

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this