Sequence Diagrams Flashcards

(23 cards)

1
Q

Synchronous message

A

Sender waits until it has received a response message before continuing (close arrowhead)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Asynchronous message

A

Sender continues without waiting for a response message (open arrowhead)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Response message

A

May be omitted if content and location are obvious

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

alt

A

alternative interaction, similar to switch statement in java, conditional branches with guards

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

opt

A

optional interaction, similar to if statement without else branch

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

loop

A

repeated interaction

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

break

A

exception interaction, simple form of exception handling

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

seq

A

weak order, interactions occur in strict sequence order

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

strict

A

strict order, interactions occur in more restrictive order without parallelism or out-of-order execution, messages must follow vertical order

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

par

A

concurrent interaction, allows parallel interactions, messages can interleave

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

critical

A

atomic interaction, ensures interaction complete without interruption, messages can’t interleave

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

ignore

A

irrelevant interaction, specifies messages that should be ignored and not shown in the diagram

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

consider

A

relevant interaction, specifies which should be considered while ignoring others

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

assert

A

asserted interaction, specifies an assertion that must always be true for sequence to proceed

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

neg

A

invalid interaction

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Sequence diagram purpose

A

Shows interactions between objects in chronological order

17
Q

Message syntax

A

messageName(arguments): returnValue
e.g. y(123): void (method y with argument 123, no return)

18
Q

Loop fragment notation

A

loop(min, max) or loop(min..max)
loop(*) = indefinite loop

19
Q

Time constraints notation

A

{0..2s} = time interval
at(12:00) = absolute time

20
Q

Practice Q1: write possible traces for par fragment with messages a,b,c

A

a -> b -> c
c -> a -> b
a -> c -> b

21
Q

Practice Q2: write trace for loop(2,2) with a,b,c

A

a -> b -> a -> b -> c (2 iterations)

22
Q

Practice Q3: write possible traces for critical fragment with a,b,c

A

a -> b -> c
b -> a -> c

23
Q

Practice Q4: write valid and invalid traces for par with critical fragment a,b,c

A

Valid: a -> b -> c, c -> a -> b
Invalid: a -> c -> b