VII. System Analysis (3) Flashcards
A finite state machine is characterized by … (6)
6-12, 14
A state diagram is a graphical representation of a finite state machine where … (2)
6-12
- composite states are refined using …
- composite state icon
6-17
nhìn hình slide 6-16 và học cách đọc
-
UML State Diagram: start, decision, junction, entry, exit, final, fork, join, shallow History, deep History
6-20
Composite State: what is it? While in a composite state, how many of the associated sub states is active ?
6-21
UML State Diagram: what does Region show? The relationship between Regions
draw
6-27
UML State Diagram:
- what happen when “orthogonal composite state” is active?
- what do the entry and exit of state show?
6-27
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?
6-29, 30
what does the state diagram of a class specify? (4)
6-30
how is the connection between state diagrams of different classes represented?
6-30
- what does a State describe?
- do all changes of an attribute value indicate a switch of the object state? Example
6-32
- what is an objects state?
- in most cases how can the object state be described with?
6-33
- what is trigger? Typical trigger (4)
- when is a trigger ignored?
6-34
- which class that corresponds to a finite machine needs Operations? (2)
- will all attributes take part in the predicates? Where may predicates be evaluated?
6-35
- what is Petri Nets? (2)
- what does it focus on?
- what is it capable of?
6-39
which kind of graph is Petri Nets? Notation (2)
6-41
(Petri Nets) Edges, Input place, Output place, Marks (tokens)
6-42
(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)
6-43, 44
(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)?
6-45, 49
(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)
6-50
(Petri Nets) Predicate Transition Nets –> draw
- goals
- activation rule (2)
- firing results
- firing rule (3)
6-53
examples of alive and not alive Petri Nets. When will the net die?
6-60, 61
(Petri Nets) Pros (6) + Cons (3)
6-64
