Exercise 2: Automata and Their Behavior

1. Construct a simple requirements domain model with a user, an environemnt, an intended systems, and at least one task to be solved.
2. Define minimal interfaces $U^{0}I, S^{0}I$ or $E^{0}I$ by using a language of properties $L_{PROP}$. Distinguish different states of the interface by different sets of properties.
3. Identify the events/actions which cause the transitions between the different states.
4. Describe the model as a transition diagram with property-states as vertices and changes as edges (transitions) connecting the different states.
5. Construct the automaton underlying the graph. Give a specification of the used properties $\Pi$, the necessary states Q, the input strings $\Sigma^{*}$, the set of all transitions $\Delta$ and examples of executions.
6. Translate the automaton into an execution diagram.
7. Show in a formal derivation how a typical sequence of events can be recognized by your system.