Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

PSWT > VII. System Analysis (3) > Flashcards

VII. System Analysis (3) Flashcards

1
Q

A finite state machine is characterized by … (6)

A

6-12, 14

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

A state diagram is a graphical representation of a finite state machine where … (2)

A

6-12

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q
  • composite states are refined using …

- composite state icon

A

6-17

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

nhìn hình slide 6-16 và học cách đọc

A

-

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

UML State Diagram: start, decision, junction, entry, exit, final, fork, join, shallow History, deep History

A

6-20

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

Composite State: what is it? While in a composite state, how many of the associated sub states is active ?

A

6-21

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

UML State Diagram: what does Region show? The relationship between Regions

draw

A

6-27

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

UML State Diagram:

  • what happen when “orthogonal composite state” is active?
  • what do the entry and exit of state show?
A

6-27

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

UML State Diagram:

  • is a finite state class always necessary? when is it worth the effort? (3)
  • how many state diagram does each class have?
A

6-29, 30

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

what does the state diagram of a class specify? (4)

A

6-30

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

how is the connection between state diagrams of different classes represented?

A

6-30

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q
  • what does a State describe?

- do all changes of an attribute value indicate a switch of the object state? Example

A

6-32

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q
  • what is an objects state?

- in most cases how can the object state be described with?

A

6-33

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q
  • what is trigger? Typical trigger (4)

- when is a trigger ignored?

A

6-34

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q
  • which class that corresponds to a finite machine needs Operations? (2)
  • will all attributes take part in the predicates? Where may predicates be evaluated?
A

6-35

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q
  • what is Petri Nets? (2)
  • what does it focus on?
  • what is it capable of?
A

6-39

17
Q

which kind of graph is Petri Nets? Notation (2)

A

6-41

18
Q

(Petri Nets) Edges, Input place, Output place, Marks (tokens)

A

6-42

19
Q

(Petri Nets)

  • firing rules –> when can a transition fire?
  • does “can fire” mean “has to fire”?
  • what happens when a transition fires?
  • commonly used flavors (3)
A

6-43, 44

20
Q

(Petri Nets) Condition Event Nets:

  • goal
  • firing rule
  • interpretation: places, transitions
  • Note about output places
  • when is a transition called enabled?
  • when are events called concurring? –> how to solve concurrency situation between enabled transitions (clashes)?
A

6-45, 49

21
Q

(Petri Nets) Place Transition Nets –> draw

  • edges
  • places
  • when is a transition enabled? –> draw 2 examples: enabled & disabled
  • what happens when an enabled transition fires? –> Example (slide 6-51)
A

6-50

22
Q

(Petri Nets) Predicate Transition Nets –> draw

  • goals
  • activation rule (2)
  • firing results
  • firing rule (3)
A

6-53

23
Q

examples of alive and not alive Petri Nets. When will the net die?

A

6-60, 61

24
Q

(Petri Nets) Pros (6) + Cons (3)

A

6-64

25
Q

(Activity Diagrams) elements:

  • diagram (2)
  • nodes (3)
  • edges (2)
A

6-73

26
Q

(Activity Diagrams) what is activity? Concrete Syntax (5)

A

6-74

27
Q

(Activity Diagrams) what is action? Concrete Syntax

A

6-75

28
Q

(Activity Diagrams) call an Action - what does it enable? How to note?

A

6-76

29
Q

(Activity Diagrams)

  • what is token used to?
  • are tokens part of UML concrete syntax?
A

6-77

30
Q

(Activity Diagrams) concrete syntax:

  • initial node
  • final node: terminate the whole activity, terminate just a single action
  • Fork and Join nodes
  • Parallelization and Synchronization nodes
  • action
  • Object, object flow
A

6-78, 81

31
Q

(Activity Diagrams) Activities – Control Flow using tokens:

  • sequential hand-over (2)
  • Fork and Join (2)
  • Parallelization- and Synchronization (2)
A

6-79

32
Q

(Activity Diagrams) Timing concept:

  • where can token rest?
  • hand-over along edges is with or without delay?
  • control nodes consume time?
A

6-80

33
Q

(Activity Diagrams) Lifespan of tokens: creation & destruction of a token –> represent?

A

6-80

34
Q

(Activity Diagrams) what does an object node represent?

A

6-81

35
Q

(Activity Diagrams) are Multiple object flows originating from the same action node valid? When may an action start?

A

6-83

36
Q

(Activity Diagrams) What is Action? How to node?

A

6-84

37
Q
  • what is deterministic state machine?

- what is non-deterministic?

A

6-14

38
Q

(Finite State Machine) Mealy and Moore state machines (3)

A

6-14

PSWT (12 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions