Realizability of high-level message sequence charts: Closing the gaps

Theoretical Computer Science

Volumn 309, Issue 1-3, 2003, Pages 529-554

  Lohrey, Markus ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

Author keywords

Complexity; Message sequence charts; Verification

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; COMPUTER HARDWARE DESCRIPTION LANGUAGES; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

MESSAGE SEQUENCE CHARTS (MSC);

COMPUTER SCIENCE;

EID: 0242440296     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2003.08.002     Document Type: Article

References (24)

1. Alur R., Yannakakis M. Model checking of message sequence charts. Baeten J.C.M., Mauw S. Proc. 9th Internat. Conf. on Concurrency Theory (CONCUR 99), Eindhoven (The Netherlands). Lecture Notes in Computer Science. Vol. 1664:1999;114-129 Springer, Berlin.
2. R. Alur, K. Etessami, M. Yannakakis, Inference of message sequence charts. Proc. 22nd Internat. Conf. on Software Engineering (ICSE 2000), ACM Press, Limerick (Ireland), 2000, pp. 304-313.
3. Alur R., Etessami K., Yannakakis M. Realizability and verification of MSC graphs. Orejas F., Spirakis P.G., van Leeuwen J. Proc. 28th Internat. Colloq. on Automata, Languages and Programming (ICALP 2001), Crete (Greece). Lecture Notes in Computer Science. Vol. 2076:2001;797-808 Springer, Berlin.
4. Alur R., Etessami K., Yannakakis M. Inference of message sequence charts. IEEE Trans. Software Eng. 29(7):2003;623-633.
5. H. Ben-Abdallah, S. Leue, Syntactic detection of process divergence and non-local choice in message sequence charts, in: E. Brinksma (Ed.), Proc. 3rd Internat. Workshop on Tools and Algorithms for Construction and Analysis of Systems (TACAS '97), Enschede (The Netherlands), Lecture Notes in Computer Science, Vol. 1217, Springer, Berlin, 1997, pp. 259-274.
6. Brand D., Zafiropulo P. On communicating finite-state machines. J. Assoc. Comput. Mach. 30(2):1983;323-342.
7. B. Caillaud, P. Darondeau, L. Hélouët, G. Lesventes, HMSCs as partial specifications ... with Petri nets as completion, in: F. Cassez, C. Jard, B. Rozoy, M.D. Ryan, (Eds.), 4th Summer School on Modelling and Verification of Parallel Processes (MOVEP 2000), Nantes (France), Lecture Notes in Computer Science, Vol. 2067, Springer, Berlin, 2000, pp. 125-152.
8. V. Diekert, G. Rozenberg (Eds.), The Book of Traces, World Scientific, Singapore, 1995.
9. Genest B., Muscholl A., Seidl H., Zeitoun M. Infinite-state high-level MSCs: model-checking and realizability. Widmayer P., Ruiz F.T., Morales R., Hennessy M., Eidenbenz S., Conejo R. Proc. 29th Internat. Colloq. on Automata, Languages and Programming (ICALP 2002), Malaga (Spain). Lecture Notes in Computer Science. Vol. 2380:2002;657-668 Springer, Berlin.
10. Gunter E., Muscholl A., Peled D. Compositional message sequence charts. Margaria T., Yi W. 7th Internat. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2001), Genova, Italy. Lecture Notes in Computer Science. Vol. 2031:2001;496-511 Springer, Berlin.
11. L. Hélouët, C. Jard, Conditions for synthesis of communicating automata from HMSCs, 5th Internat. Workshop on Formal Methods for Industrial Critical Systems (FMICS 2000), Berlin, Germany, 2000.
12. L. Hélouët, P. Le Maigat, Decomposition of message sequence charts, 2nd Workshop on SDL and MSC (SAM 2000), Grenoble, France, 2000, pp. 46-60.
13. Henriksen J.G., Mukund M., Kumar K.N., Thiagarajan P. On message sequence graphs and finitely generated regular MSC languages. Nielsen M., Rovan B. Proc. 27th Internat. Colloq. on Automata, Languages and Programming (ICALP 2000), Geneva, Switzerland. Lecture Notes in Computer Science. Vol. 1853:2000;675-686 Springer, Berlin.
14. Henriksen J.G., Mukund M., Kumar K.N., Thiagarajan P. Regular collections of message sequence charts. Montanari U., Rolim J.D.P., Welzl E. Proc. 25th Internat. Symp. on Mathematical Foundations of Computer Science (MFCS'2000), Bratislava (Slovakia). Lecture Notes in Computer Science. Vol. 1893:2000;675-686 Springer, Berlin.
15. ITU, Recommendation Z.100. Specification and Description Language (SDL), 1994.
16. ITU, Recommendation Z.120. Message Sequence Charts, 1996.
17. Kuske D. A further step towards a theory of regular msc languages. Alt H., Ferreira A. Proc. 19th Annu. Symp. on Theoretical Aspects of Computer Science (STACS 2002), Juan les Pins (France). Lecture Notes in Computer Science. Vol. 2285:2002;489-500 Springer, Berlin.
18. M. Lohrey, Safe realizability of high-level message sequence charts, in: Proc. 13th Internat. Conf. on Concurrency Theory (CONCUR 2002), Brno (Czech Republic), Lecture Notes in Computer Science, Vol. 2421, Springer, Berlin, 2002, pp. 177-192.
19. Morin R. Recognizable sets of message sequence charts. Alt H., Ferreira A. Proc. 19th Annu. Symp. on Theoretical Aspects of Computer Science (STACS 2002), Juan les Pins (France). Lecture Notes in Computer Science. Vol. 2285:2002;523-534 Springer, Berlin.
20. Mukund M., Kumar K.N., Sohoni M.A. Synthesizing distributed finite-state systems from MSCs. Palamidessi C. Proc. 11th Internat. Conf. on Concurrency Theory (CONCUR 2000), University Park, PA, USA. Lecture Notes in Computer Science. Vol. 1877:2000;521-535 Springer, Berlin.
21. Muscholl A., Peled D. Message sequence graphs and decision problems on Mazurkiewicz traces. Kutylowski M., Pacholski L., Wierzbicki T. Proc. 24th Internat. Symp. on Mathematical Foundations of Computer Science (MFCS'99), Szklarska Poreba, Poland. Lecture Notes in Computer Science. Vol. 1672:1999;81-91 Springer, Berlin.
22. Papadimitriou C.H. Computational Complexity. 1994;Addison Wesley, Reading, MA.
23. Walukiewicz I. Difficult configurations - on the complexity of LTrL. Larsen K.G., Skyum S., Winskel G. Proc. 25th Internat. Colloq. on Automata, Languages and Programming (ICALP 98), Aalborg, Denmark. Lecture Notes in Computer Science. Vol. 1443:1998;140-151 Springer, Berlin.
24. Zielonka W. Notes on finite asynchronous automata. R.A.I.R.O. - Inform. Théor. Appl. 27:1985;99-135.