Safe realizability of high-level message sequence charts

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

Volumn 2421 LNCS, Issue , 2002, Pages 177-192

  Lohrey, Markus ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

HIGH LEVEL MESSAGE SEQUENCE CHARTS; REALIZABILITY;

FLOWCHARTING;

EID: 84874702138     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45694-5_13     Document Type: Conference Paper

References (20)

1. R. Alur, K. Etessami, and M. Yannakakis. Inference of message sequence charts. In Proceedings of the 22nd International Conference on on Software Engineering (ICSE 2000), Limerick (Ireland), pages 304-313. ACM Press, 2000.
2. R. Alur, K. Etessami, and M. Yannakakis. Realizability and verification of MSC graphs. In Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP 2001), Crete (Greece), number 2076 in Lecture Notes in Computer Science, pages 797-808. Springer, 2001.
3. R. Alur and M. Yannakakis. Model checking of message sequence charts. In Proceedings of the 9th International Conference on Concurrency Theory (CONCUR 99), Eindhoven (The Netherlands), number 1664 in Lecture Notes in Computer Science, pages 114-129. Springer, 1999.
4. H. Ben-Abdallah and S. Leue. Syntactic detection of process divergence and nonlocal choice in message sequence charts. In Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems (TACAS '97), Enschede (The Netherlands), number 1217 in Lecture Notes in Computer Science, pages 259-274, 1997.
5. D. Brandand P. Zafiropulo. On communicating finite-state machines. Journal of the Association for Computing Machinery, 30(2):323-342, 1983.
6. B. Caillaud, P. Darondeau, L. Héloüet, and G. Lesventes. HMSCs as partial specifications⋯ with Petri nets as completion. In Modelling and Verification of Parallel Processes (MOVEP), Nantes (France), number 2067 in Lecture Notes in Computer Science, pages 125-152, 2000.
7. V. Diekert and G. Rozenberg, editors. The Book of Traces. WorldScientific, Singapore, 1995.
8. B. Genest, A. Muscholl, H. Seidl, and M. Zeitoun. Infinite-state high-level MSCs: Model-checking and realizability. to appear in Proceedings of the 29th International Colloquium on Automata, Languages and Programming (ICALP 2002), Malaga (Spain), 2002.
9. E. Gunter, A. Muscholl, and D. Peled. Compositional message sequence charts. In T. Margaria and W. Yi, editors, Tools and Algorithms for the Construction and Analysis of Systems, 7th International Conference (TACAS), Genova (Italy), volume 2031 of Lecture Notes in Computer Science, pages 496-511. Springer, 2001.
10. L. Héloüet and C. Jard. Conditions for synthesis of communicating automata from HMSCs. In 5th International Workshop on Formal Methods for Industrial Critical Systems (FMICS), Berlin (Germany), 2000.
11. L. Héloüet and P. Le Maigat. Decomposition of message sequence charts. In 2nd Workshop on SDL and MSC (SAM 2000), Grenoble (France), pages 46-60, 2000.
12. J. G. Henriksen, M. Mukund, K. N. Kumar, and P. Thiagarajan. Regular collections of message sequence charts. In U. Montanari, J. D. P. Rolim, and E. Welzl, editors, Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science (MFCS'2000), Bratislava, (Slovakia), number 1893 in Lecture Notes in Computer Science, pages 675-686. Springer, 2000.
13. ITU. Recommendation Z.100. Specification and Description Language (SDL). 1994.
14. ITU. Recommendation Z.120. Message Sequence Charts. 1996.
15. R. Morin. Recognizable sets of message sequence charts. In H. Alt and A. Ferreira, editors, Proceedings of the19th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2002), Juan les Pins (France), number 2285 in Lecture Notes in Computer Science, pages 523-534. Springer, 2002.
16. A. Muscholl and D. Peled. Message sequence graphs and decision problems on Mazurkiewicz trace. In M. Kutylowski, L. Pacholski, and T. Wierzbicki, editors, Proceedings of the 24th Mathematical Foundations of Computer Science (MFCS'99), Szklarska Poreba (Poland), number 1672 in Lecture Notes in Computer Science, pages 81-91. Springer, 1999.
17. C. H. Papadimitriou. Computational Complexity. Addison Wesley, 1994.
18. G. von Bochmann. Finite state description of communication protocols. Computer Networks, 2:361-372, 1978.
19. I. Walukiewicz. Difficult configurations - on the complexity of LTrL. In Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP 98), Aalborg (Denmark), number 1443 in Lecture Notes in Computer Science, pages 140-151. Springer, 1998.
20. W. Zielonka. Notes on finite asynchronous automata. R. A. I. R. O. - Informatique Théorique et Applications, 27:99-135, 1985.