2013年4月9日
摘要: 1.There is a set of unmarked states in G that forms a strongly connected component,but with no transition going out of the set ,If the system enters this set of states, then we get what is called a livelock.2.An automaton G could reach a state x where Γ(x)=∅ but x/∈Xm ,this is called a deadlock beca 阅读全文
posted @ 2013-04-09 21:36 肉松蜗牛 阅读(179) 评论(0) 推荐(0)
摘要: 1.A Deterministic Automaton,defined by G,isa six-tuple G=(X,E,f,Γ,x0,Xm)where: X is the set of states E the finite set of events associated with G f:X×E→X is the transition function:f(x,e)=y means that there is a transition labeled by event e from state x to state y;in general,f is a partial fu 阅读全文
posted @ 2013-04-09 10:17 肉松蜗牛 阅读(239) 评论(0) 推荐(0)