Abstract
UML Profile for MARTE is an extension of UML in the domain of real-time and embedded systems. In this paper, we present a method to evaluate throughput and response time of systems described in MARTE models. A MARTE model we consider includes a use case diagram, a deployment diagram and a set of activity diagrams. We transform a MARTE model into a network of timed automata in UPPAAL and use UPPAAL to find the possible best throughput and response time of a system, and the best solution in the worst cases for both of them. The two case studies demonstrate our support of decision makings for designers in analyzing models with different parameters, such as the number of concurrent activities and the number of resources. In the first case study, we analyze the throughput of a system deploying on multiprocessor platforms. The second analyzes the response time of an order processing system.
This work is partially supported by National Key Basic Research Program of China (973 program) (No. 2014CB340701), the Open Project of Shanghai Key Laboratory of Trustworthy Computing (No. 07dz22304201302), and the National Natural Science Foundation of China (No. 61361136002 and No. 61100074).
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
OMG. UML Profile for MARTE, Beta 2, http://www.omg.org/cgi-bin/doc?ptc/2008-06-08
Bernardi, S., Donatelli, S., Merseguer, J.: From UML sequence diagrams and statecharts to analysable petri net models. In: WOSP 2002, pp. 35–45 (2002)
Holzmann, G.J.: The model checker SPIN. J. TSE 23(5), 279–295 (1997)
Guelfi, N., Mammar, A.: A formal semantics of timed activity diagrams and its PROMELA translation. In: APSEC 2005, pp. 283–290 (2005)
Piel, E., Atitallah, R.B., Marquet, P., et al.: Gaspard2: from MARTE to SystemC simulation. In: DATE 2008, pp. 23–28 (2008)
Merseguer, J., Bernardi, S.: Dependability analysis of DES based on MARTE and UML state machines models. J. DEDS 22(2), 163–178 (2012)
Alur, R., Dill, D.L.: A theory of timed automata. J. TCS 126(2), 183–235 (1994)
Suryadevara, J., Seceleanu, C., Mallet, F., Pettersson, P.: Verifying MARTE/CCSL mode behaviors using UPPAAL. In: Hierons, R.M., Merayo, M.G., Bravetti, M. (eds.) SEFM 2013. LNCS, vol. 8137, pp. 1–15. Springer, Heidelberg (2013)
Bengtsson, J., Larsen, K., Larsson, F., et al.: UPPAAL-a tool suite for automatic verification of real-time systems. J. Hybrid Systems III. 1066, 232–243 (1996)
Ravn, A.P., Srba, J., Vighio, S.: A formal analysis of the web services atomic transaction protocol with UPPAAL. In: Margaria, T., Steffen, B. (eds.) ISoLA 2010, Part I. LNCS, vol. 6415, pp. 579–593. Springer, Heidelberg (2010)
Ravn, A.P., Srba, J., Vighio, S.: Modelling and verification of web services business activity protocol. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol. 6605, pp. 357–371. Springer, Heidelberg (2011)
Larsen, K.G., Pettersson, P., Wang, Y.: UPPAAL in a nutshell. J. STTT 1(1), 134–152 (1997)
Papyrus, http://www.papyrusuml.org
Jouault, F., Allilaire, F., Bzivin, J., et al.: ATL: A model transformation tool. J. SCP 72(1), 31–39 (2008)
Xuandong, L., Meng, C., Yu, P., Jianhua, Z., Guoliang, Z.: Timing analysis of UML activity diagrams. In: Gogolla, M., Kobryn, C. (eds.) UML 2001. LNCS, vol. 2185, p. 62. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Yan, G., Zhu, XY., Yan, R., Li, G. (2014). Formal Throughput and Response Time Analysis of MARTE Models. In: Merz, S., Pang, J. (eds) Formal Methods and Software Engineering. ICFEM 2014. Lecture Notes in Computer Science, vol 8829. Springer, Cham. https://doi.org/10.1007/978-3-319-11737-9_28
Download citation
DOI: https://doi.org/10.1007/978-3-319-11737-9_28
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11736-2
Online ISBN: 978-3-319-11737-9
eBook Packages: Computer ScienceComputer Science (R0)