Deciding properties for message sequence charts

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1378, Issue , 1998, Pages 226-242

  Muscholl, Anca ^a   Peled, Doron ^b,c   Su, Zhendong ^d  

^a UNIVERSITY OF STUTTGART   (Germany)

^b LUCENT TECHNOLOGIES   (United States)

^c Carnegie Mellon University   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; FLOWCHARTING;

AUTOMATIC VALIDATION; DECIDING PROPERTIES; DECISION PROBLEMS; DESIGN ERRORS; MAZURKIEWICZ TRACES; MESSAGE SEQUENCE CHARTS; NATURAL LANGUAGES; VALIDATION PROBLEM;

GRAPHIC METHODS;

EID: 84947908141     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0053553     Document Type: Conference Paper

References (11)

1. R. Alur, G. Holzmann, and D. Peled. An analyzer for message sequence charts. Software Concepts and Tools, 17(2):70-77, 1996.
2. H. Ben-Abdallah and S. Leue. Syntactic detection of process divergence and nonlocal choice in message sequence charts. In E. Brinksma, editor, Proceedings of theTools and Algorithms for the Construction and Analysis of Systems, Third International Workshop, TACAS’97, number 1217 in Lecture Notes in Computer Science, pages 259-274, Enschede, The Netherlands, 1997. Springer.
3. J. Berstel. Transductions and context-free languages. Teubner Studienbücher, Stuttgart, 1979.
4. M. Clerbout and M. Latteux. Partial commutations and faithful rational transductions. Theoretical Computer Science, 34:241-254, 1984.
5. V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, Singapore, 1995.
6. J. Feigenbaum, J. Kahn, and C. Lund. Complexity results for pomset languages. SIAM Journal Disc. Math., 6(3):432-442, 1993.
7. ITU-T Recommendation Z.120, Message Sequence Chart (MSC), March 1993.
8. V. Levin and D. Peled. Verification of message sequence charts via template matching. In TAPSOFT (FASE)’97, Theory and Practice of Software Development, volume 1214 of Lecture Notes in Computer Science, pages 652-666, Lille, France, 1997. Springer.
9. M. Nielsen, G. Plotkin, and G. Winskel. Petri nets, event structures and domains, part 1. Theoretical Computer Science, 13:85-108, 1981.
10. J.-E. Pin. Syntactic semigroups. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 1, pages 679-738. Springer, Berlin-Heidelberg-New York, 1997.
11. V. R. Pratt. Modelling concurrency with partial orders. International Journal of Parallel Programming, 15(1):33-71, 1986.