时间自动机课件.ppt
《时间自动机课件.ppt》由会员分享,可在线阅读,更多相关《时间自动机课件.ppt(29页珍藏版)》请在三一办公上搜索。
1、Outline,The theory of Timed automataA case study,First introduced by Rajeev Alur and David L.Dill in 1990,Rajeev Alur and David L.Dill.Automata for modeling real-time systems.In Proceedings,17th International Colloquium on Automata,Languages and Programming,1990.R.Alur and D.L.Dill.:A theory of time
2、d automata In Theoret.Comput.Sci.,Vol.126,No.2,1994,pp.183-235A finite-state Buchi automaton extended with a set of real value variablesTimed safety automata,Off,Light,Bright,Press,Press,Press,Press,WANT:if press is issued twice quickly then the light will get brighter;otherwise the light is turned
3、off.,Simple Light Control,Simple Light Control,Off,Light,Bright,Solution:Add a real-valued clock x,x:=0,x=3,x3,Press,Press,Press,Press,Adding continuous variables to state machines,Timed Automata,n,m,a,Clocks:x,y,x3,x:=0,Guard Boolean combination of comparisons withInteger/rational bounds,ResetActio
4、n performed on clocks,State(location,x=v,y=u)where v,u are in R,Action for synchronization,n,m,a,Clocks:x,y,x3,x:=0,Transitions:,(n,x=2.4,y=3.1415)(n,x=3.5,y=4.2415),wait(1.1),(n,x=2.4,y=3.1415),wait(3.2),x=5,y=10,LocationInvariants,g1,g2,g3,g4,Invariants ensure progress!,Adding Invariants,Timed Aut
5、omata:Syntax,Timed Automata:a tuple(L,l0,A,V,I,E)L:a finite set of locationsl0:initial locationsA:a finite set of labels(alphabet)V:a finite set of clock variablesI:a location constrain functionE:a finite set of edges.Each edge hasa source location l,a target location lGuard g(variable constrain)Lab
6、el a in A(e labels also allowed)A subset u of clock variables to be reset,Timed Automata:Semantics,For a timed automaton A,define an infinite-state transition system S(A)States Q:a state q is a pair(l,v),where l is a location,and v is a clock vector,mapping clocks in X to R+,satisfying I(l)(l0,v)is
7、initial state if l is in V0 and v(x)=0 Elapse of time transitions:for each nonnegative real number d,(l,v)-d-(l,v+d)if both v and v+d satisfy I(l)Location switch transitions:(l,v)-a-(l,v)if there is an edge(l,a,g,l,l)such that v satisfies g and v=vl:=0,Parallel Composition,The product of automata We
8、 use timed automata network to model them,Product Construction,Verification,System modeled as timed automata networks Properties specified as CTL formulars.Verification problem reduced to reachability or to temporal logic model checking ApplicationsReal-time controllersAsynchronous timed circuitsSch
9、edulingDistributed timing-based algorithms,specification of the goal,系统需求,现实,environment,PLC program,PLC,fulfils,Verification goal,specification of the environment,specification of the control,系统规范,结构描述,plant diagram,PLC program,Model checking,specification of the goal,系统需求,automaton for the plant,a
- 配套讲稿:
如PPT文件的首页显示word图标,表示该PPT已包含配套word讲稿。双击word图标可打开word文档。
- 特殊限制:
部分文档作品中含有的国旗、国徽等图片,仅作为作品整体效果示例展示,禁止商用。设计者仅对作品中独创性部分享有著作权。
- 关 键 词:
- 时间 自动机 课件
链接地址:https://www.31ppt.com/p-3528027.html