Abstract
Scenario-driven requirement specifications are widely used to capture and represent functional requirement. More recently, the Use Case Maps language (UCM), being standardized by ITU-T as part of the User Requirements Notation (URN) has gained on popularity within the software requirements community. UCM models focus on the description of functional and behavioral requirements as well as high-level designs at the early stages of system development processes. However, timing issues are often overlooked during the initial system design and treated as non-related behavioral issues and described therefore in separate models. We believe that timing aspects must be integrated into the system model during early development stages. In this paper, we present a novel approach to describe timing constraints in UCM specifications. We describe a formal operational semantics of Timed UCM in terms of Timed Automata (TA) that can be analyzed and verified with the UPPAAL model checker tool. Our approach is illustrated using a case study of the IP Multicast Routing Protocol.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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
ITU-T: New draft Recommendation Z.152: URN - Use Case Map Notation (UCM). Temporary Document 3201, 27 April, ITU-T Study Group 17 (2006)
Hassine, J., Rilling, J., Dssouli, R.: Abstract Operational Semantics for Use Case Maps. In: Wang, F. (ed.) FORTE 2005. LNCS, vol. 3731, Springer, Heidelberg (2005)
Amyot, D.: Formalization of timethreads using LOTOS. Master’s thesis, University of Ottawa, Ottawa, Ontario, Canada (1994)
Amyot, D., Logrippo, L., Buhr, R.J.A., Gray, T.: Use case maps for the capture and validation of distributed systems requirements. In: RE 1999. Fourth IEEE International Symposium on Requirements Engineering, pp. 44–53. IEEE Computer Society Press, Los Alamitos (1999)
Clarke, J.E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (1999)
Alur, R., Dill, D.L.: A theory of Timed Automata. Theor. Comput. Sci. 126(2), 183–235 (1994)
Larsen, K.G., Pettersson, P., Yi, W.: UPPAAL in a nutshell. International Journal on Software Tools for Technology Transfer 1(1-2), 134–152 (1997)
Hassine, J., Rilling, J., Dssouli, R.: Timed Use Case Maps. In: Gotzhein, R., Reed, R. (eds.) SAM 2006. LNCS, vol. 4320, pp. 99–114. Springer, Heidelberg (2006)
Manna, Z., Pnueli, A.: Clocked transition systems. Technical report, Stanford University, Stanford, CA, USA (1996)
Meng-Siew, N.: Reasoning with timing constraints in message sequence charts. Master’s thesis, University of Stirling, Scotland, U.K (August 1993)
OMG: Response to the OMG RFP for Schedulability, Performance and Time, v. 2.0. OMG document ad/2002-03-04 (March 2002)
Graf, S., Ober, I., Ober, I.: A real-time profile for UML. Int. J. Softw. Tools Technol. Transf. 8(2), 113–127 (2006)
OMG: Unified Modeling Language: Superstructure version 2.1.1, formal/2007-02-05 (February 2007)
Alfonso, A., Braberman, V., Kicillof, N., Olivero, A.: Visual timed event scenarios. In: ICSE 2004. Proceedings of the 26th International Conference on Software Engineering, pp. 168–177. IEEE Computer Society Press, Washington, DC (2004)
Moser, L.E., Ramakrishna, Y.S., Kutty, G., Melliar-Smith, P.M., Dillon, L.K.: A graphical environment for the design of concurrent real-time systems. ACM Transactions on Software Engineering and Methodology 6(1), 31–79 (1997)
Eshuis, H.: Semantics and Verification of UML Activity Diagrams for Workflow Modelling. PhD thesis, University of Twente, Enschede, The Netherlands (2002)
David, A., Moller, M.O., Yi, W.: Formal verification of UML statecharts with real-time extensions. In: Kutsche, R.-D., Weber, H. (eds.) ETAPS 2002 and FASE 2002. LNCS, vol. 2306, pp. 218–232. Springer, London (2002)
Firley, T., Huhn, M., Diethers, K., Gehrke, T., Goltz, U.: Timed sequence diagrams and tool-based analysis A case study. In: France, R.B., Rumpe, B. (eds.) UML 1999 - The Unified Modeling Language. Beyond the Standard. LNCS, vol. 1723, pp. 645–660. Springer, Heidelberg (1999)
ITU-T: Recommendation Z.120. Message Sequence Charts (2004)
Fenner, W.: Internet Group Management Protocol, IGMP version 2 (1997)
Bowman, H., Gomez, R.: Concurrency Theory - Calculi and Automata for Modelling Untimed and Timed Concurrent Systems. Springer, Heidelberg (2006)
Bornot, S., Sifakis, J., Tripakis, S.: Modeling Urgency in Timed Systems. In: de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.) COMPOS 1997. LNCS, vol. 1536, pp. 103–129. Springer, Heidelberg (1998)
Bengtsson, J., Yi, W.: Timed automata: Semantics, algorithms and tools. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets. LNCS, vol. 3098, pp. 87–124. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hassine, J., Rilling, J., Dssouli, R. (2007). Formal Verification of Use Case Maps with Real Time Extensions. In: Gaudin, E., Najm, E., Reed, R. (eds) SDL 2007: Design for Dependable Systems. SDL 2007. Lecture Notes in Computer Science, vol 4745. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74984-4_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-74984-4_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74983-7
Online ISBN: 978-3-540-74984-4
eBook Packages: Computer ScienceComputer Science (R0)