Matching specifications for message sequence charts

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

Volumn 1578, Issue , 1999, Pages 273-287

  Muscholl, Anca ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EARLY DESIGNS; MATCHING PROBLEMS; MESSAGE SEQUENCE CHARTS; PSPACE-COMPLETE; VERIFICATION TASK;

FLOWCHARTING;

EID: 22644449043     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49019-1_19     Document Type: Conference Paper

References (10)

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 the Tools 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. H. Ben-Abdallah and S. Leue. Mesa: Support for scenario-based design of concurrent systems. In B. Steffen, editor, Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 4th International Conference, TACAS'98, number 1384 in Lecture Notes in Computer Science, pages 118-135, Lisbon, Portugal, 1998. Springer.
4. V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, Singapore, 1995.
5. A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977.
6. S. Miyano and T. Hayashi. Alternating finite automata on ω-words. Theoretical Computer Science, 32:321-330, 1984.
7. A. Muscholl, D. Peled, and Z. Su. Deciding properties of message sequence charts. In M. Nivat, editor, Proceedings of the 1st International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'98), Lisbon, Portugal, 1998, number 1378 in Lecture Notes in Computer Science, pages 226-242, Berlin- Heidelberg-New York, 1998. Springer.
8. M. Nielsen, G. Plotkin, and G. Winskel. Petri nets, event structures and domains, part 1. Theoretical Computer Science, 13:85-108, 1981.
9. V. R. Pratt. Modelling concurrency with partial orders. International Journal of Parallel Programming, 15(1):33-71, 1986.
10. M. Y. Vardi. An automata-theoretic approach to linear-temporal logic. In F. Moller and G. Birtwistle, editors, Logics for concurrency, number 1043 in Lecture Notes in Computer Science, pages 238-266, Berlin-Heidelberg-New York, 1996. Springer.