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.
| Original language | American English |
|---|---|
| Title of host publication | International Symposium on Mathematical Foundations of Computer Science |
| Editors | Mirosław Kutyłowsk, Leszek Pacholski, Tomasz Wierzbicki |
| Publisher | Springer Berlin Heidelberg |
| State | Published - 1999 |