A theory of regular MSC languages

Information and Computation

Volumn 202, Issue 1, 2005, Pages 1-38

  Henriksen, Jesper G ^a,e   Mukund, Madhavan ^b   Kumar, K Narayan ^b   Sohoni, Milind ^c   Thiagarajan, P S ^d  

^a AARHUS UNIVERSITY   (Denmark)

^b CHENNAI MATHEMATICAL INSTITUTE   (India)

^c INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

^d NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^e DSE A/S   (Denmark)

Author keywords

Message sequence charts; Message passing systems; Monadic second order logic; Realizability; Regularity; Synthesis

Indexed keywords

AUTOMATA THEORY; COMPUTER SOFTWARE; TELECOMMUNICATION;

MESSAGE SEQUENCE CHARTS (MSC); MESSAGE-PASSING SYSTEMS; MONADIC SECOND-ORDER LOGIC; REGULARITY;

INFORMATION THEORY;

EID: 24944567728     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2004.08.004     Document Type: Article

References (38)

1. R. Alur, G.J. Holzmann, and D. Peled An analyzer for message sequence charts Software Concepts Tools 17 2 1996 70 77
2. R. Alur, and M. Yannakakis Model checking of message sequence charts Proceedings of the 10th International Conference on Concurrency Theory (CONCUR'99) Lecture Notes in Computer Science 1664 1999 Springer-Verlag 114 129
3. R. Alur, K. Etessami, and M. Yannakakis Inference of message sequence graphs Proceedings of the 22nd International Conference on on Software Engineering (ICSE 2000) Association for Computing Machinery 2000 304 313
4. R. Alur, K. Etessami, and M. Yannakakis Realizability and verification of MSC graphs Proceedings Automata, Languages and Programming, 28th International Colloquium (ICALP 2001) Lecture Notes in Computer Science 2076 2001 Springer-Verlag 797 808
5. H. Ben-Abdallah, and S. Leue Syntactic detection of process divergence and non-local choice in message sequence charts Proceedings of the 3rd Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'97) Lecture Notes in Computer Science 1217 1997 Springer-Verlag 259 274
6. B. Bollig, M. Leucker, and T. Noll Generalised regular MSC languages Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures (FOSSACS'02) Lecture Notes in Computer Science 2303 2002 Springer-Verlag 52 66
7. G. Booch, I. Jacobson, and J. Rumbaugh Unified Modeling Language User Guide 1997 Addison-Wesley Reading, MA
8. J.R. Büchi Weak second-order arithmetic and finite automata Z. Math. Logik Grundl. Math. 6 1960 66 92
9. M. Clerbout, and M. Latteux Semi-commutations Informat. Comput. 73 1 1987 59 74
10. W. Damm, and D. Harel LSCs: breathing life into message sequence charts Formal Methods Syst. Des. 19 1 2001 45 80
11. V. Diekert G. Rozenberg The Book of Traces 1995 World Scientific
12. W. Ebinger, and A. Muscholl Logical definability on infinite traces Theor. Comput. Sci. 154 1 1996 67 84
13. B. Genest, A. Muscholl, H. Seidl, and M. Zeitoun Infinite-state high-level MSCs: model-checking and realizability Proceedings of the 29th International Colloquium on Automata, Languages and Programming (ICALP'02) Lecture Notes in Computer Science 2380 2002 Springer-Verlag 657 668
14. D. Harel, and E. Gery Executable object modeling with statecharts IEEE Comput. 1997 1997 31 42
15. D. Harel, R. Marelly, Specifying and executing behavioral requirements: the play in/play-out approach, Software Syst. Model.
16. D. Harel, H. Kugler, R. Marelly, and A. Pnueli Smart play-out of behavioral requirements Proceedings Formal Methods in Computer-Aided Design, 4th International Conference (FMCAD 2002) Lecture Notes in Computer Science 2517 2002 Springer-Verlag 378 398
17. J.G. Henriksen, M. Mukund, K. Narayan Kumar, and P.S. Thiagarajan On message sequence graphs and finitely generated regular MSC languages Proceedings of the International Colloquium on Automata, Languages and Programming 2000 (ICALP'00) Lecture Notes in Computer Science 1854 2000 Springer-Verlag 675 686
18. J.G. Henriksen, M. Mukund, K. Narayan Kumar, and P.S. Thiagarajan Regular collections of message sequence charts Proceedings of the Conference on the Mathematical Foundations of Computer Science 2000 (MFCS'00) Lecture Notes in Computer Science 1893 2000 Springer-Verlag 405 414
19. ITU-TS Recommendation Z.120: Message Sequence Chart (MSC), ITU-TS, Geneva (1997).
20. D. Kuske A further step towards a theory of regular MSC languages Proceedings of the Symposium on the Theoretical Aspects of Computer Science Lecture Notes in Computer Science 2285 2002 Springer-Verlag 489 500
21. P.B. Ladkin, and S. Leue Interpreting message flow graphs Formal Aspects Comput. 7 5 1995 473 509
22. V. Levin, and D. Peled Verification of message sequence charts via template matching Proceedings of the 7th International Conference on Theory and Practice of Software Development (TAPSOFT'97) Lecture Notes in Computer Science 1214 1997 Springer-Verlag 652 666
23. P. Madhusudan Reasoning about sequential and branching behaviours of message sequence graphs Proceedings of the 27th International Colloquium on Automata, Languages and Programming (ICALP'00) Lecture Notes in Computer Science 2076 2001 Springer-Verlag 396 407
24. P. Madhusudan, and B. Meenakshi Beyond message sequence graphs Proceedings of the 21st Conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS'01) Lecture Notes in Computer Science 2245 2001 Springer-Verlag 256 267
25. S. Mauw, and M.A. Reniers High-level message sequence charts Proceedings of the 8th SDL Forum, SDL'97: Time for Testing-SDL, MSC and Trends 1997 Elsevier 291 306
26. M. Mukund, K. Narayan Kumar, and M. Sohoni Synthesizing distributed finite-state systems from MSCs Proceedings of the 11th International Conference on Concurrency Theory (CONCUR 2000) Lecture Notes in Computer Science 1877 2000 Springer-Verlag 521 535
27. M. Mukund, K. Narayan Kumar, and M. Sohoni Bounded time-stamping in message-passing systems Theor. Comput. Sci. 290 1 2003 221 239
28. A. Muscholl Matching specifications for message sequence charts Proceedings of the 2nd International Conference on Foundations of Software Science and Computation Structures (FOSSACS'99) Lecture Notes in Computer Science 1578 1999 Springer-Verlag 273 287
29. A. Muscholl, and D. Peled Message sequence graphs and decision problems on Mazurkiewicz traces Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science (MFCS'99) Lecture Notes in Computer Science 1672 1999 Springer-Verlag 81 91
30. A. Muscholl, D. Peled, and Z. Su Deciding properties for message sequence charts Proceedings of the 1st International Conference on Foundations of Software Science and Computation Structures (FOSSACS'98) Lecture Notes in Computer Science 1378 1998 Springer-Verlag 226 242
31. E. Rudolph, P. Graubmann, J. Grabowski, Tutorial on message sequence charts, in: Computer Networks and ISDN Systems-SDL and MSC, vol. 28, 1996.
32. J. Sakarovitch The "last" decision problem for rational trace languages Proceedings of the 1st Latin American Symposium on Theoretical Informatics (LATIN'92) Lecture Notes in Computer Science 583 1992 Springer-Verlag 460 473
33. P.S. Thiagarajan A trace consistent subset of PTL Proceedings of the Sixth International Conference on Concurrency Theory (CONCUR'95) Lecture Notes in Computer Science 962 1995 Springer-Verlag 438 452
34. P.S. Thiagarajan, and I. Walukiewicz An expressively complete linear time temporal logic for Mazurkiewicz traces Informat. Comput. 179 2 2002 230 249
35. W. Thomas Automata on infinite objects J. van Leeuwen Handbook of Theoretical Computer Science, vol. B: Formal Models and Semantics 1990 Elsevier Science Publishers 133 191
36. W. Thomas Languages, automata, and logic G. Rozenberg A. Salomaa Handbook of Formal Language Theory vol. III 1997 Springer-Verlag 389 455
37. M.Y. Vardi, and P. Wolper An automata-theoretic approach to automatic program verification Proceedings of the 1st Annual IEEE Symposium on Logic in Computer Science (LICS'86) 1986 IEEE Computer Society Press 332 345
38. W. Zielonka Notes on finite asynchronous automata R.A.I.R.O. Informat. Théor. Appl. 21 1987 99 135