Abstract
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.
Author supplied keywords
Cite
CITATION STYLE
Muscholl, A., & Peled, D. (1999). Message sequence graphs and decision problems on mazurkiewicz traces. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1672, pp. 81–91). Springer Verlag. https://doi.org/10.1007/3-540-48340-3_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
