Abstract
Message sequence charts are becoming a popular low-level design tool for communication systems. When applied to systems of nontrivial size, organizing and manipulating them become a challenge. We present a methodology for specifying and verifying message sequence charts. Specification is given using templates, namely charts with only partial information about the participating events and their interrelated order. "Verification is done by a search whose aim is to match templates against charts. The result of such a search either reports that no matching chart exists, or returns examples of charts that satisfy the constraints that appear in such a template. We describe the algoritilm and an implementation.
| Original language | English |
|---|---|
| Title of host publication | TAPSOFT 1997 |
| Subtitle of host publication | Theory and Practice of Software Development - 7th International Joint Conference CAAP/FASE, Proceedings |
| Editors | Michel Bidoit, Michel Bidoit, Max Dauchet, Max Dauchet |
| Publisher | Springer Verlag |
| Pages | 652-666 |
| Number of pages | 15 |
| ISBN (Print) | 9783540627814, 9783540627814 |
| DOIs | |
| State | Published - 1997 |
| Externally published | Yes |
| Event | 7th International Joint Conference on Theory and Practice of Software Development, TAPSOFT 1997 - Lille, France Duration: 14 Apr 1997 → 18 Apr 1997 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 1214 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 7th International Joint Conference on Theory and Practice of Software Development, TAPSOFT 1997 |
|---|---|
| Country/Territory | France |
| City | Lille |
| Period | 14/04/97 → 18/04/97 |
Bibliographical note
Publisher Copyright:© Springer-Verlag Berlin Heidelberg 1997.