Theoretical Computer Science
Representing Embedded System Sequence Diagrams as a Formal Language
«UML» '01 Proceedings of the 4th International Conference on The Unified Modeling Language, Modeling Languages, Concepts, and Tools
A Formal Semantics of UML Sequence Diagram
ASWEC '04 Proceedings of the 2004 Australian Software Engineering Conference
Revisiting Statechart Synthesis with an Algebraic Approach
Proceedings of the 26th International Conference on Software Engineering
Safety-Liveness Semantics for UML 2.0 Sequence Diagrams
ACSD '05 Proceedings of the Fifth International Conference on Application of Concurrency to System Design
Inherent causal orderings of partial order scenarios
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
A radix-8 multiplier design and its extension for efficient implementation of imaging algorithms
SAMOS'05 Proceedings of the 5th international conference on Embedded Computer Systems: architectures, Modeling, and Simulation
A component-based approach for consistency checking of UML dynamic diagrams
SEA '07 Proceedings of the 11th IASTED International Conference on Software Engineering and Applications
The many meanings of UML 2 Sequence Diagrams: a survey
Software and Systems Modeling (SoSyM)
An interleaving semantics for UML 2 interactions using Petri nets
Information Sciences: an International Journal
Required behavior of sequence diagrams: Semantics and conformance
ACM Transactions on Software Engineering and Methodology (TOSEM)
| Hi-index | 0.00 |
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.