Realizability and verification of MSC graphs

Theoretical Computer Science

Volumn 331, Issue 1, 2005, Pages 97-114

  Alur, Rajeev ^a   Etessami, Kousha ^b   Yannakakis, Mihalis ^c  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b School of Informatics   (United Kingdom)

^c Columbia University ^*  (United States)

Author keywords

Formal verification; Message sequence charts; Software specification

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; SOFTWARE ENGINEERING; THEOREM PROVING;

COMMUNICATING-STATE MACHINES; FORMAL VERIFICATION; MESSAGE SEQUENCE CHARTS (MSC); SOFTWARE SPECIFICATION;

GRAPH THEORY;

EID: 15744383238     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.09.034     Document Type: Conference Paper

References (16)

1. R. Alur, K. Etessami, M. Yannakakis, Inference of message sequence charts, in: Proc. 22nd Internat. Conf. on Software Engineering (ICSE), 2000, pp. 304-313.
2. R. Alur, G.J. Holzmann, and D.A. Peled An analyzer for message sequence charts Software Concepts Tools 17 2 1996 70 77
3. R. Alur, M. Yannakakis, Model checking of message sequence charts, in: Proc. Tenth Internat. Conf. on Concurrency Theory (CONCUR), Lecture Notes in Computer Science, Vol. 1664, 1999, pp. 114-129.
4. H. Ben-Abdallah, S. Leue, Syntactic detection of process divergence and non-local choice in message sequence charts, in: Proc. Third Internat. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Lecture Notes in Computer Science, Vol. 1217, 1997, pp. 259-276.
5. H. Ben-Abdallah, S. Leue, MESA: support for scenario-based design of concurrent systems, in: Proc. Fourth Internat. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Lecture Notes in Computer Science, Vol. 1384, 1998, pp. 118-135.
6. A. Bertoni, G. Mauri, and N. Sabadini Membership problems for regular and context-free trace languages Inform. Comput. 82 2 1989 135 150
7. G. Booch, I. Jacobson, and J. Rumbaugh Unified Modeling Language User Guide 1997 Addison-Wesley Reading
8. J. Henriksen, M. Mukund, K. Narayan Kumar, P.S. Thiagarajan, On message sequence graphs and finitely generated regular MSC languages, in: Proc. 27th Internat. Coll. on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science, Vol. 1853, 2000, pp. 675-686.
9. G.J. Holzmann, D.A. Peled, and M.H. Redberg Design tools for requirements engineering Lucent Bell Labs Tech. J. 2 1 1997 86 95
10. ITU-T recommendation Z.120. Message Sequence Charts (MSC'96), 1996.
11. M. Lohrey, Safe realizability of high-level message charts, in: Proc. 13th Internat. Conf. on Concurrency Theory (CONCUR), 2002.
12. R. Morin, Recognizable sets of message sequence charts, in: Proc. 19th Annual Symp. on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science, Vol. 2285, 2002, pp. 523-534.
13. A. Muscholl, D.A. Peled, Message sequence graphs and decision problems on Mazurkiewicz traces, in: Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science (MFCS), 2000, pp. 81-89.
14. A. Muscholl, D.A. Peled, Z. Su, Deciding properties of message sequence charts, in: Proc. First Internat. Conf. on Foundations of Software Science and Computation Structures, 1998, pp. 226-242.
15. D.A. Peled, Specification and verification of message sequence charts, in: Proc. IFIP Internat. Conf. on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XIII), 2000, pp. 139-154.
16. T.J. Schaefer, The complexity of satisfiability problems, in: Proc. Tenth ACM Symp. on Theory of Computing (STOC), 1978, pp. 216-226.