Abstract
This paper presents formal definitions for UML Sequences Diagrams based on branching time semantics and partial orders in a denotational style. The obtained graphs are close to lattices and specify faithfully the intended behaviors rather than trace based semantics. We also define few generalized algebraic operations on graphs so that it makes it easy to provide formal definitions in a compositional manner to interaction operators. Next we extend our formalism with logical clocks and time formulas over values of these clocks to express timing constraints of complex systems. We present also some algorithms to extract time annotations that adorn sequence diagrams and transform them into timing constraints in our timed graphs. Obviously, this approach alleviates more the hard task of consistency checking between UML diagrams, specifically interaction diagrams with regards to state diagrams. Timeliness and performance analysis of timed graphs related to sequence diagrams could take advantages of works on model checking of timed automata.
Chapter PDF
Similar content being viewed by others
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.
References
Alur, R., Dill, D.: A theory of timed automata. Theorical Computer Science 126, 183–235 (1994)
Cardoso, J., Sibertin-Blanc, C.: An operational semantics for UML interaction: sequencing of actions and local control. European Journal of Automatised Systems. APII-JESA 36, 1015-1028 (ISBN 2-7462-0573-4), Hermés-Lavoisier (2002)
Grosu, R., Smolka, S.A.: Safety-Liveness Semantics for UML 2.0 sequence diagrams. In: Proc. of ACSD 2005, the 5th International Conference on Application of Concurrency to System Design, Saint-Malo, France (June 2005)
Haugen, Æ., Husa, K.E., Runde, R.K., StÆlen, K.: STAIRES towards formal design with sequence diagrams. Software & System Modeling, online first: 1-13, 2005
ITU-T. Z.120. Message sequence charts (MSC) (November 1999)
Latronico, E., Koopman, P.: Representing Embedded System Sequence Diagrams as a Formal Language. In: Gogolla, M., Kobryn, C. (eds.) UML 2001. LNCS, vol. 2185, p. 302. Springer, Heidelberg (2001)
Mitchell, B.: Inherent Causal Orderings of Partial Order Scenarios. In: Liu, Z., Araki, K. (eds.) ICTAC 2004. LNCS, vol. 3407, pp. 113–127. Springer, Heidelberg (2005)
OMG. Unified Modeling Language: Superstructure version 2.0, Final Adopted Specification. Object Management Group (2004), Available from: http://www.omg.org
Sibertin-Blanc, C., Tahir, O., Cardoso, J.: Interpretation of UML sequence diagrams as causality flows. In: Ramos, F.F., Larios Rosillo, V., Unger, H. (eds.) ISSADS 2005. LNCS, vol. 3563, pp. 126–140. Springer, Heidelberg (2005)
Störrle, H.: Trace semantics of interactions in UML 2.0. Technical Report TR 0403, University of Munich, Germany 09/2004
Li, X., Liu, Z., Jifeng, H.: A formal semantics of UML sequence Diagram. In: Proc. of Australian Software Engineering Conference 2004, Australia (April 2004)
Ziadi, T., Hélouët, L., Jézéquel, J.-M.: Revisiting statechart synthesis with an Algebraic Approach. In: Proc. of International conference on Software Engineering (ICSE 2004) (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 IFIP International Federation for Information Processing
About this paper
Cite this paper
Hammal, Y. (2006). Branching Time Semantics for UML 2.0 Sequence Diagrams. In: Najm, E., Pradat-Peyre, JF., Donzeau-Gouge, V.V. (eds) Formal Techniques for Networked and Distributed Systems - FORTE 2006. FORTE 2006. Lecture Notes in Computer Science, vol 4229. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11888116_20
Download citation
DOI: https://doi.org/10.1007/11888116_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46219-4
Online ISBN: 978-3-540-46220-0
eBook Packages: Computer ScienceComputer Science (R0)