Unifying the Semantics of UML 2 State, Activity and Interaction Diagrams

Kohlmeyer, Jens; Guttmann, Walter

doi:10.1007/978-3-642-11486-1_18

Cited by 8 publications

(5 citation statements)

References 9 publications

(5 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To obtain a finite automaton, possible traces that contain the same set of events are identified. An SD has also been translated to a Petri net (e.g., [Cardoso and Sibertin-Blanc 2001;Eichner et al 2005;Fernandes et al 2007]) and abstract state machines (e.g., [Cavarra and Küster-Filipe 2004;Kohlmeyer and Guttmann 2010;Xiang and Shao 2009]). Refinement is not considered [Cardoso and Sibertin-Blanc 2001;Cavarra and Küster-Filipe 2004;Eichner et al 2005;Fernandes et al 2007;Hammal 2006;Kohlmeyer and Guttmann 2010;Whittle and Schumann 2000;Ziadi et al 2004;Xiang and Shao 2009].…”

Section: Translation To Automata and Process Calculimentioning

confidence: 99%

Required behavior of sequence diagrams

Kim

2014

ACM Trans. Softw. Eng. Methodol.

View full text Add to dashboard Buy / Rent full text

Many reusable software artifacts such as design patterns and design aspects make use of UML sequence diagrams to describe interaction behaviors. When a pattern or an aspect is reused in an application, it is important to ensure that the sequence diagrams for the application conform to the corresponding sequence diagrams for the pattern or aspect. Reasoning about conformance relationship between sequence diagrams has not been addressed adequately in literature. In this article, we focus on required behaviors specified by a UML sequence diagram and provide a semantic-based formalization of conformance relationships between sequence diagrams. A novel trace semantics is first given that captures precisely required behaviors. A refinement relation between sequence diagrams is then defined based on the semantics. The refinement relation allows a sequence diagram to be refined by changing its structure so long as its required behaviors are preserved. A conformance relation between sequence diagrams is finally given that includes the refinement relation as a special case. It allows one to introduce and rename lifelines, messages, and system variables when reusing sequence diagrams. Properties of the semantics, refinement, and conformance relations are studied. Two case studies are provided to illustrate the efficacy of semantic-based conformance reasoning. ACM Reference Format:Lunjin Lu and Dae-Kyoo Kim. 2014. Required behavior of sequence diagrams: Semantics and conformance.

show abstract

Section: Translation To Automata and Process Calculimentioning

confidence: 99%

Required behavior of sequence diagrams

Kim

2014

ACM Trans. Softw. Eng. Methodol.

View full text Add to dashboard Buy / Rent full text

show abstract

“…In [3], [8] and [9], a sequence diagram is translated into a Petri net, with the lifelines translated into processes, actions to transitions, and messages to communication places. In [4], [14] and [24], a sequence diagram is translated into an abstract state machine (ASM). Refinement is not considered in [3], [8], [9], [4], [14], or [24].…”

Section: Related Workmentioning

confidence: 99%

“…In [4], [14] and [24], a sequence diagram is translated into an abstract state machine (ASM). Refinement is not considered in [3], [8], [9], [4], [14], or [24]. In [11], safety and liveness semantics for sequence diagrams is given in terms of Büchi automata, and refinement is defined as set containment.…”

Section: Related Workmentioning

confidence: 99%

Towards Mechanized Semantics of UML Sequence Diagrams and Refinement Relation

Dou

Yang

et al. 2013

Modelling and Simulation / 804: Signal and Image Processing

View full text Add to dashboard Buy / Rent full text

Sequence diagrams are widely used to describe the behavior of software during the design phase. Sequence diagrams have significant practical value. However, a systematic way of understanding and specifying the formal semantics of sequence diagrams does not exist. Analyzing the design properties may reveal software faults before software implementation, thereby improving the software quality and reducing development costs. We propose to use the theorem proof assistant Coq to mechanize the semantics of sequence diagrams and the refinement relations on models. In this framework, the syntax of a sequence diagram is represented as inductive types, and the semantic function is represented as inductive predicates. Based on mechanized trace semantics, the desired properties of both semantics and the refinement relation can be stated as lemmas. The proof of each lemma ensures that the semantics and the refinement relation satisfy the specified properties. Our work demonstrates the viability of using Coq to mechanize the semantics of software design models and provide increased reliability guarantee in model-based development.

show abstract

“…To obtain a finite automaton, possible traces that contain the same set of events are identified. An SD has also been translated to a Petri net (e.g., [8], [17], [20]) with lifelines translated to processes, actions to transitions and messages to communication places and to abstract state machines (e.g., [9], [41], [70]). Refinement is not considered in [8], [9], [17], [20], [29], [41], [69], [70], [71].…”

Section: Translation To Automata and Process Calculimentioning

confidence: 99%

Required Behavior of Sequence Diagrams: Semantics and Refinement

Kim

2011

2011 16th IEEE International Conference on Engineering of Complex Computer Systems

View full text Add to dashboard Buy / Rent full text

✦ Abstract-Sequence diagrams are a widely used design notation for describing software behaviors. Many reusable software artifacts such as design patterns and design aspects make use of sequence diagrams to describe interaction behaviors. When a pattern or an aspect is reused in an application, it is important to ensure that the sequence diagrams for the application conform to the corresponding sequence diagrams for the pattern or aspect. Reasoning about conformance relationship between sequence diagrams has not been addressed adequately in literature. In this paper, we focus on required behavior specified by a UML sequence diagram. A novel trace semantics is given that captures precisely required behavior specified by a sequence diagram and a conformance relation between sequence diagrams is formalized based on the semantics. Properties of the trace semantics and the conformance relation are studied.

show abstract

Unifying the Semantics of UML 2 State, Activity and Interaction Diagrams

Cited by 8 publications

References 9 publications

Required behavior of sequence diagrams

Required behavior of sequence diagrams

Towards Mechanized Semantics of UML Sequence Diagrams and Refinement Relation

Required Behavior of Sequence Diagrams: Semantics and Refinement

Contact Info

Product

Resources

About