CS2002 - Week 7 - Activity Diagrams Flashcards
(15 cards)
Primary focus of an activity diagram
Modelling procedural processing
Node
basic element of activity diagrams, specifys user-defined behaviour (actions, objects, control nodes)
Edges
connects activites and nodes (actions)
Token in activity diagrams
A virtual mechanism that:
- grants execution permission to actions (control token)
- transports data (object token)
Key control nodes
Initial node: Starts activity
Activity final node: Ends all flows
Decision node: Splits paths with guards
Merge node: Combines alternative paths
Concurrent paths modeling (Parallelisation vs Synchronisation)
Parallelisation node: Splits into concurrent flows
Synchronisation node: Waits for all flows to complete
Object node
Represents data/objects exchanged between actions
Central Buffers vs Data Stores
Central Buffer: Transient (deletes tokens after reading)
Data Store: Permanent (copies tokens)
Types of event-based actions
Send signal: Triggers an event
Accept event: Waits for an event/time
Partition
Groups nodes by responsibility/roles
Types of exception handling
Exception handler: Replaces a failed action
Interruptible region: Terminates a group of actions on an event
Symbol for call behaviour action
Fork icon
Token reaches an activity final node
All flows terminate immediately (even concurrent ones)
Guards in activity diagrams
Ensure flows continue only if specific conditions are met
Must be mutually exclusive for decision nodes. (In square brackets: [grade >= 5])
Connectors usage
To simplify diagrams when actions are far apart (avoid crossing lines)