Message sequence graphs and decision problems on Mazurkiewicz traces

A. Muscholl, D. Peled

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


Message sequence charts (MSC) are a graphical specification language widely used for designing communication protocols. Our starting point are two decision problems concerning the correctness and the consistency of a design based by MSC graphs. Both problems are shown to be undecidable, in general. Using a natural connectivity assumption from Mazurkiewicz trace theory we show both problems to be EXPSPACE-complete for locally synchronized graphs. The results are based on new complexity results for star-connected rational trace languages.
Original languageAmerican English
Title of host publicationInternational Symposium on Mathematical Foundations of Computer Science
EditorsMirosław Kutyłowsk, Leszek Pacholski, Tomasz Wierzbicki
PublisherSpringer Berlin Heidelberg
StatePublished - 1999

Bibliographical note

Place of conference:Szklarska Poręba, Poland


Dive into the research topics of 'Message sequence graphs and decision problems on Mazurkiewicz traces'. Together they form a unique fingerprint.

Cite this