The research group Formal Methods - Luon：研究小组的形式化方法——成长.ppt

Models of Computation: Automata and Processes Jos Baeten Models of computation Automata theory and formal languages Turing machine Computability Algorithm Complexity Models of computation Automaton is model of computer input/output function stand alone batch process Add notion of interaction - concurrency theory, process theory Thesis Process theory is just as important to every computer science student as automata theory Can be taught together in every undergraduate curriculum Analogies help, standardization can ensue A Cook’s tour of automata and processes Some answers, some questions From automata theory: A regular language: deterministic finite automaton non-deterministic finite automaton right-linear grammar left-linear grammar regular expression From process theory: A regular process: deterministic finite automaton non-deterministic finite automaton right-linear grammar left-linear grammar regular expression A regular process A finite transition system modulo bisimulation edge-labeled, initial state, set of final states A finite guarded linear recursive specification: action prefix + recursion 0 1 A regular expression Not all regular processes can be described by a regular expression (w.r.t. bisimulation) Example X = a Y + 1 Y = b X + 1 X = aY + 1 = a(bX + 1) + 1 = abX + a + 1 X = (ab)*(a + 1) Y = b(ab)*(a + 1) + 1 = left distributivity of ? over + holds in language equivalence Milner 1984 Not for bisimulation equivalence. Question: which finite behaviours are bisimulation equivalent to a regular expression? Answer: well-behaved ones B, Corradini, Grabmayer. JACM 2007. Consequence Iteration not basic programming construct for parallel programming. Regular expressions + choice ? sequential composition 0 inaction, d 1 skip, e a action * iteration Reg. exp. to finite automata Algebra for regular expressions Recursive specifications (grammars) X = a Y + 1 Y = b X + 1 RSP*: x = y?x + z ? x = y*z guarded, i.e. y