Timed Automata培训课件.pptVIP

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 Inv(l) (l,v) is 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 Inv(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’=v[l:=0] Product Construction A B x4 x:=0 x3 a b a | a,x:=0 a b c C D y4 y:=0 y3 b b| b,y:=0 b c AC BC x4 x:=0 x3 a b, y:=0 a| a,x:=0 AD y4 y3 c BD x4 y4 x3, b| x3, b,y:=0 a| a, x:=0 y3 c a, x:=0 Verification System modeled as a product of timed automata Verification problem reduced to reachability or to temporal logic model checking Applications Real-time controllers Asynchronous timed circuits Scheduling Distributed timing-based algorithms Course Overview Timed Automata Model Reachability Preliminaries: Transition Systems and Equivalences Region Graph Construction Decidability Boundary Timed Regular Languages Closure Properties and Complementation Deterministic and two-way Automata Robustness Inclusion Reachability for Timed Automata Is finite state analysis possible? Is reachability problem decidable? Finite Partitioning Goal: To partition state-space into finitely many equivalence classes so that equivalent states exhibit similar behaviors Labeled Transition System T Set Q of states Set I of initial states Set S of labels Set ? of labeled transitions of the form q –a- q’ Partitions and Quotients Let T=(Q,I,S,?) be a transition system and @ be a partitioning of Q (i.e. an equivalence relation on Q) Quotient T/ @ is transition system: 1. States are equivalence classes of @ 2. A state P is initial if it contains a state in I 3. Set of labels is S 4. Transitions: P –a- P’ if q-a-q’ for some q in P and some q’ in P’ Language Equivalence Language