Abstract
This work considers implementation of requirements expressed as High-level Message Sequence Charts (HMSCs). All HMSCs are not implementable, but a particular subclass called local HMSCs can be implemented using a simple projection operation. This paper proposes a new technique to transform an arbitrary HMSC specification into a local HMSC, hence allowing implementation. We show that this transformation can be automated as a constraint optimization problem. The impact of modifications brought to the original specification can be minimized w.r.t. a cost function. The approach was evaluated on a large number of randomly generated HMSCs. The results show an average runtime of a few seconds, which demonstrates applicability of the technique.
Work supported by the ANR IMPRO(ANR-2010-BLAN-0317) of the French National Agency for Research.
Chapter PDF
References
Abdallah, R., Jard, C., Hélouët, L.: Distributed implementation of message sequence charts. Software and Systems Modeling (to appear, 2013)
Alur, R., Etessami, K., Yannakakis, M.: Realizability and Verification of MSC Graphs. In: Yu, Y., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 797–808. Springer, Heidelberg (2001)
Baudru, N., Morin, R.: Synthesis of Safe Message-Passing Systems. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol. 4855, pp. 277–289. Springer, Heidelberg (2007)
Ben-Abdallah, H., Leue, S.: Syntactic Detection of Process divergence and Non-Local Choice in Message Sequence Charts. In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol. 1217, pp. 259–274. Springer, Heidelberg (1997)
Brand, D., Zafiropoulo, P.: On communicating finite state machines. Technical Report 1053, IBM Zurich Research Lab. (1981)
Carlsson, M., Ottosson, G., Carlson, B.: An Open-Ended Finite Domain Constraint Solver. In: Hartel, P.H., Kuchen, H. (eds.) PLILP 1997. LNCS, vol. 1292, pp. 191–206. Springer, Heidelberg (1997)
Genest, B., Muscholl, A., Seidl, H., Zeitoun, M.: Infinite-state high-level MSCs: Model-checking and realizability. Journal on Comp. and System Sciences 72(4), 617–647 (2006)
Hélouët, L., Jard, C.: Conditions for synthesis of communicating automata from HMSCs. In: Proc. of FMICS 2000 (2000)
ITU-T. Message sequence charts (msc). In ITU standard Z.120 (1999)
Liang, H., Dingel, J., Diskin, Z.: A comparative survey of scenario-based to state-based model synthesis approaches. In: Proc. of SCESM 2006: the 2006 International Workshop on Scenarios and State Machines: Models, Algorithms, and Tools, pp. 5–12 (2006)
Lohrey, M.: Realizability of high-level message sequence charts: closing the gaps. Theoretical Computer Science 309(1-3), 529–554 (2003)
Marriott, K., Stuckey, P.J.: Programming with Constraints: An Introduction. MIT Press (1998)
Reniers, M., Mauw, S.: High-level Message Sequence Charts. In: SDL 1997: Time for Testing - SDL, MSC and Trends, Proc. of the 8th SDL Forum, pp. 291–306 (1997)
Roychoudhury, A., Thiagarajan, P.S.: Communicating transaction processes. In: ACSD 2003, pp. 157–166. IEEE Computer Society (2003)
Van Hentenryck, P., Saraswat, V.A., Deville, Y.: Design, implementation, and evaluation of the constraint language cc(fd). J. Log. Program. 37(1-3), 139–164 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abdallah, R., Gotlieb, A., Hélouët, L., Jard, C. (2013). Scenario Realizability with Constraint Optimization. In: Cortellessa, V., Varró, D. (eds) Fundamental Approaches to Software Engineering. FASE 2013. Lecture Notes in Computer Science, vol 7793. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37057-1_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-37057-1_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37056-4
Online ISBN: 978-3-642-37057-1
eBook Packages: Computer ScienceComputer Science (R0)