## Finite Automata and Clocks

Intuitively is the above example directly 'understandable', but how can one fit all these expressions and operations into the framework of a finite automaton?

Let us have a look to the finite automaton with output, which we have introduced above (see also figure 3.6):

 (5.23) (5.24) (5.25)

with the meaning that, if we have in state the input , then we will generate the output and enter the successor state .

In the case of automata with properties one can see how it is possible to extend the definition of an automaton by additional components which do not change the behavior of the automaton as such; the properties are only 'hooked up' to the structure of an automaton by providing some data 'viewable from a meta-level' only:

 (5.26) (5.27) (5.28)

An analogous case could be to extend the basic FA-definiton with elements like time-points , clocks as well as enabling conditions like

 (5.29) (5.30) (5.31) (5.32) (5.33) (5.34) (5.35)

The is usually called the transition relation of an automaton; another naming is machine table or program. We will stick here with machine table and we will name one element a command line of . The interpretation of a command line runs as while in state q an input-string 'in' will be received with the condition 'c,g,t' the output 'out' can be realized and the successor state is q' if the condition 'c,g,t' is satisfied. Otherwise this command line will not be executed.

If we call the two elements of a command line the head of the command line than one can state that every head of the command lines of a state is unique. The uniqueness holds also for the tail of a command line which is represented by the elements . The three elements of a command line will be called the clock condition.

One state can be realized by more than one command line, therefore it holds that

 (5.36)

Gerd Doeben-Henisch 2010-03-03