State diagram: Difference between revisions
Jump to navigation
Jump to search
imported>Eric Evers mNo edit summary |
imported>Bruce M. Tindall mNo edit summary |
||
| Line 1: | Line 1: | ||
{{subpages}} | |||
A state diagram is an fundamental concept in computer science. States are nodes that have arrows that leave them for other notes. There is typically a unique starting state. Transitions are caused in general by some event. Often events are represented by particular messages. In the example, the messages a,b and c causes transitions between states in our set of states: {Start, State_1, State_2, Stop}. Our message alphabet is the set: {a,b,c}. | A state diagram is an fundamental concept in computer science. States are nodes that have arrows that leave them for other notes. There is typically a unique starting state. Transitions are caused in general by some event. Often events are represented by particular messages. In the example, the messages a,b and c causes transitions between states in our set of states: {Start, State_1, State_2, Stop}. Our message alphabet is the set: {a,b,c}. | ||
| Line 8: | Line 9: | ||
==Also see== | ==Also see== | ||
[[ | [[Finite state machine]] | ||
[[ | [[Automaton]] | ||
Revision as of 12:29, 7 February 2009
A state diagram is an fundamental concept in computer science. States are nodes that have arrows that leave them for other notes. There is typically a unique starting state. Transitions are caused in general by some event. Often events are represented by particular messages. In the example, the messages a,b and c causes transitions between states in our set of states: {Start, State_1, State_2, Stop}. Our message alphabet is the set: {a,b,c}.
In Standard Unified_Modeling_Language, the start state is a solid circle. The end state is a solid circle with a circle around it. States are rounded rectangles.
/--------\ /--------\
● -----> | State_1 | -----> | State_2 | -----> ◉
a \--------/ b \--------/ c
Also see
Finite state machine Automaton