Abstract
Scenario-based specifications such as message sequence charts (MSC) offer an intuitive and visual way of describing design requirements. MSC-graphs allow convenient expression of multiple scenarios, and can be viewed as an early model of the system that can be subjected to a variety of analyses. Problems such as LTL model checking are known to be decidable for the class of bounded MSC-graphs.
Our first set of results concerns checking realizability of bounded MSC- graphs. An MSC-graph is realizable if there is a distributed implementation that generates precisely the behaviors in the graph. There are two notions of realizability, weak and safe, depending on whether or not we require the implementation to be deadlock-free. It is known that for a set of MSCs, weak realizability is coNP-complete while safe realizability has a polynomial-time solution. We establish that for bounded MSC-graphs, weak realizability is, surprisingly, undecidable, while safe is in E upxpspace. Our second set of results concerns verification of MSC-graphs. While checking properties of a graph G, besides verifying all the scenarios in the set L(G) of MSCs specified by G, it is desirable to verify all the scenarios in the set L w(G)—the closure of G, that contains the implied scenarios that any distributed implementation of G must include. For checking whether a given MSC M is a possible behavior, checking M ∈ L(G) is NP-complete, but checking M ∈ L w(G) has a quadratic solution. For temporal logic specifications, considering the closure makes the verification problem harder: while checking LTL properties of L(G) is P upspace-complete and checking local properties has polynomial-time solutions, even for boolean combinations of local properties of L w(G), verifying acyclic graphs is coNP-complete and verifying bounded graphs is undecidable. .
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Alur, K. Etessami, and M. Yannakakis. Inference of message sequence charts. In Proc. of 22nd Int. Conf. on Software Engineering, 2000.
R. Alur, G.J. Holzmann, and D. Peled. An analyzer for message sequence charts. Software Concepts and Tools, 17(2):70–77, 1996.
R. Alur and M. Yannakakis. Model checking of message sequence charts. In Concurrency Theory, Tenth Intl. Conference, LNCS 1664, pages 114–129, 1999.
H. Ben-Abdallah and S. Leue. MESA: Support for scenario-based design of concurrent systems. In Proc. 4th TACAS, LNCS 1384, pages 118–135, 1998.
G. Booch, I. Jacobson, and J. Rumbaugh. Unified Modeling Language User Guide. Addison Wesley, 1997.
H. Ben-Abdallah and S. Leue. Syntactic detection of process divergence and non-local choice in message sequence charts. In Proc. 2nd TACAS, 1997.
J. Henriksen, M. Mukund, K. Narayan Kumar, and P.S. Thiagarajan. On message sequence graphs and finitely generated regular MSC languages. In Proc. 27th ICALP, LNCS 1853, pp. 675–686, 2000.
G.J. Holzmann, D.A. Peled, and M.H. Redberg. Design tools for for requirements engineering. Lucent Bell Labs Technical Journal, 2(1):86–95, 1997.
A. Muscholl, D. Peled, and Z. Su. Deciding properties of message sequence charts. In Foundations of Software Science and Computation Structures, 1998.
D. Peled. Specification and verification of message sequence charts. In Proc. IFIP FORTE/PSTV, 2000.
T.J. Schaefer. The complexity of satisfiability problems. In Proc. 10th ACM Symp. on Theory of Computing, pages 216–226, 1978.
[12]ITU-T recommendation Z.120. Message Sequence Charts (MSC’96), 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Velag Berlin Heidelberg
About this paper
Cite this paper
Alur, R., Etessami, K., Yannakakis, M. (2001). Realizability and Verification of MSC Graphs. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 2001. Lecture Notes in Computer Science, vol 2076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48224-5_65
Download citation
DOI: https://doi.org/10.1007/3-540-48224-5_65
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42287-7
Online ISBN: 978-3-540-48224-6
eBook Packages: Springer Book Archive