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 | English |
|---|---|
| Title of host publication | Mathematical Foundations of Computer Science 1999 - 24th International Symposium, MFCS 1999, Proceedings |
| Editors | Mirosław kutyłowski, Leszek Pacholski, Tomasz Wierzbicki |
| Publisher | Springer Verlag |
| Pages | 81-91 |
| Number of pages | 11 |
| ISBN (Print) | 3540664084, 9783540664086 |
| DOIs | |
| State | Published - 1999 |
| Externally published | Yes |
| Event | 24th International Symposium on Mathematical Foundations of Computer Science, MFCS 1999 - Szklarska Poreba, Poland Duration: 6 Sep 1999 → 10 Sep 1999 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 1672 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 24th International Symposium on Mathematical Foundations of Computer Science, MFCS 1999 |
|---|---|
| Country/Territory | Poland |
| City | Szklarska Poreba |
| Period | 6/09/99 → 10/09/99 |
Bibliographical note
Publisher Copyright:© Springer-Verlag Berlin Heidelberg 1999.
Keywords
- Automata theory
- Mazurkiewicz semi-traces
- Message sequence graphs
- Universality problem