Applied Automata Theory
» This course is given in English.
Lecture in summer term 2002
|V4||Mo 15:00 - 16:30 AH I
Wed 10:00 - 10:45 AH II
|Ü2||Tue 14:00 - 15:30 AH V||23.04.2002||Thomas, Wöhrle|
ContentsIn this advanced course of theoretical computer science (to be given in English), fundamental automaton models as used in the practice of computer science are introduced and analyzed:
Finite automata and their behaviour (accepted languages, bisimulation) Nondeterministic and alternating automata (realization in statecharts) Connections to logical system specification (e.g. temporal logic) and the paradigm of model-checking Products of automata, communicating finite-state machines Asynchronous automata, Petri nets, Message Sequence Charts Hierarchical finite-state machines (with outlook to statecharts and SDL).
We present basic results on the following questions: How to minimize an automaton? How to transform one form of automaton into another? How to switch from logical spezifications to state-based specifications? Which problems (e.g., reachability of given states, existence of successful runs, equivalence of automata) are decidable or even efficiently decidable?