In this lecture, we will introduce the simplest computation machinery, finite state automata. Expressions (regular expressions) and logics (WS1S) that are equivalent to finite state automata are also introduced. After languages of finite words, we introduce ω-automata, which are finite state automata on infinite words. The linear-time temporal logic is shown to be a strict subset of ω-automata. Finally, basic automata-theoretic model checking is introduced to verify if a system satisfies its specifications.

Last modified: 2017/09/01 10:26

Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International