Example button/ ✷ clean/ � [ ǫ ] water/ � pod/ � button/ ✷ [ pod ] [ water ] pod/ � water/ � water/ � pod/ � button/ K [ podwater ] [ podwaterbutton ] Σ \ { clean } / ✷ { water, pod } / � button/ ✷ [ button ] Σ / ✷
Example button/ ✷ clean/ � [ ǫ ] water/ � pod/ � clean/ � button/ ✷ [ pod ] [ water ] pod/ � water/ � water/ � pod/ � button/ K [ podwater ] [ podwaterbutton ] Σ \ { clean } / ✷ { water, pod } / � button/ ✷ [ button ] Σ / ✷
Consequences (I) We will call P regular if ≡ P has finite index, i.e., if there is a corresponding Mealy machine M P .
Consequences (I) We will call P regular if ≡ P has finite index, i.e., if there is a corresponding Mealy machine M P . Corollary (Minimality) For regular P , M P is minimal.
Consequences (I) We will call P regular if ≡ P has finite index, i.e., if there is a corresponding Mealy machine M P . Corollary (Minimality) For regular P , M P is minimal. Proof: ◮ Every state of a Mealy machine M belongs to one class of ≡ � M � .
Consequences (I) We will call P regular if ≡ P has finite index, i.e., if there is a corresponding Mealy machine M P . Corollary (Minimality) For regular P , M P is minimal. Proof: ◮ Every state of a Mealy machine M belongs to one class of ≡ � M � . ◮ M � M � has exactly one state per class of ≡ � M � .
Consequences (II) Corollary (Bounded reachability) For regular P , every transition of M P can be covered by a sequence of length at most n from the initial state. ( n : number of states of M P )
Consequences (II) Corollary (Bounded reachability) For regular P , every transition of M P can be covered by a sequence of length at most n from the initial state. ( n : number of states of M P ) Especially: For every Mealy machine with N states, all transitions of its mininmal equivalent Mealy machine can be covered by sequences of length at most N .
Canonical Mealy machines
Minimizing automata Question: How can we minimize non-minimal automata / proof minimality?
Minimizing automata Question: How can we minimize non-minimal automata / proof minimality? First idea: merge states based on equivalence of words: s ≡ s ′ ⇔ ∀ v ∈ Σ + . λ ∗ ( s, v ) = λ ∗ ( s ′ , v )
Minimizing automata Question: How can we minimize non-minimal automata / proof minimality? First idea: merge states based on equivalence of words: s ≡ s ′ ⇔ ∀ v ∈ Σ + . λ ∗ ( s, v ) = λ ∗ ( s ′ , v ) But: it may be hard to argue about all future behaviors. ⇒ exchange quantifier!
k-distinguishability Definition (k-distinguishability) Two states s, s ′ ∈ S of some Mealy machine M are k-distinguishable, iff there is a word w ∈ Σ ∗ of length k or shorter, for which λ ∗ ( s, w ) � = λ ∗ ( s ′ , w ) .
k-distinguishability Definition (k-distinguishability) Two states s, s ′ ∈ S of some Mealy machine M are k-distinguishable, iff there is a word w ∈ Σ ∗ of length k or shorter, for which λ ∗ ( s, w ) � = λ ∗ ( s ′ , w ) . How big can k get?
k-distinguishability Definition (k-distinguishability) Two states s, s ′ ∈ S of some Mealy machine M are k-distinguishable, iff there is a word w ∈ Σ ∗ of length k or shorter, for which λ ∗ ( s, w ) � = λ ∗ ( s ′ , w ) . How big can k get? Proposition In a Mealy machine of size n , states s �≡ s ′ ∈ S are n -distinguishable.
Naive minimization 1. Compute spanning tree for M , (size n )
Naive minimization 1. Compute spanning tree for M , (size n ) 2. Associate every state with path to it in spanning tree (from root), its access sequence
Naive minimization 1. Compute spanning tree for M , (size n ) 2. Associate every state with path to it in spanning tree (from root), its access sequence 3. For every state construct T s : Σ ≤ n �→ Ω by T s ( v ) = def � M � ( uv ) where u is access sequence to s and v ∈ Σ ≤ n
Naive minimization 1. Compute spanning tree for M , (size n ) 2. Associate every state with path to it in spanning tree (from root), its access sequence 3. For every state construct T s : Σ ≤ n �→ Ω by T s ( v ) = def � M � ( uv ) where u is access sequence to s and v ∈ Σ ≤ n 4. Merge states s, s ′ , whenever T s = T s ′
Naive minimization 1. Compute spanning tree for M , (size n ) 2. Associate every state with path to it in spanning tree (from root), its access sequence 3. For every state construct T s : Σ ≤ n �→ Ω by T s ( v ) = def � M � ( uv ) where u is access sequence to s and v ∈ Σ ≤ n 4. Merge states s, s ′ , whenever T s = T s ′ Complexity for comparing states: O ( n 2 · | Σ | n )
Partition refinement
λ valuation Definition For a Mealy machine M and some state s in M , the λ valuation of s is a mapping λ s : Σ �→ Ω , with λ s ( α ) = def λ ( s, α )
Partition refinement (algorithm) Input: A Mealy machine M = � S, s 0 , Σ , Ω , δ, λ � Output: A partition P on S , the set of states of the Mealy machine 1: i := 1 2: put all s ∈ S with the same λ valuation into the same class p of partition P i 3: loop 4: for all p ∈ P i do 5: for all s ∈ p do 6: construct mapping sig : Σ → P i : sig ( α ) = p ′ such that δ ( s, α ) ∈ p ′ 7: S i sig := S i 8: sig ∪ s 9: end for sig S i 10: P i +1 := � sig 11: end for 12: if P i = P i +1 then 13: return P i 14: end if 15: i := i + 1 16: end loop
Partition refinement (algorithm) Input: A Mealy machine M = � S, s 0 , Σ , Ω , δ, λ � Output: A partition P on S , the set of states of the Mealy machine 1: i := 1 2: put all s ∈ S with the same λ valuation into the same class p of partition P i 3: loop 4: for all p ∈ P i do 5: for all s ∈ p do 6: construct mapping sig : Σ → P i : sig ( α ) = p ′ such that δ ( s, α ) ∈ p ′ 7: S i sig := S i 8: sig ∪ s 9: end for sig S i 10: P i +1 := � sig 11: end for 12: if P i = P i +1 then 13: return P i 14: end if 15: i := i + 1 16: end loop
Partition refinement (algorithm) Input: A Mealy machine M = � S, s 0 , Σ , Ω , δ, λ � Output: A partition P on S , the set of states of the Mealy machine 1: i := 1 2: put all s ∈ S with the same λ valuation into the same class p of partition P i 3: loop 4: for all p ∈ P i do 5: for all s ∈ p do 6: construct mapping sig : Σ → P i : sig ( α ) = p ′ such that δ ( s, α ) ∈ p ′ 7: S i sig := S i 8: sig ∪ s 9: end for sig S i 10: P i +1 := � sig 11: end for 12: if P i = P i +1 then 13: return P i 14: end if 15: i := i + 1 16: end loop
Partition refinement (algorithm) Input: A Mealy machine M = � S, s 0 , Σ , Ω , δ, λ � Output: A partition P on S , the set of states of the Mealy machine 1: i := 1 2: put all s ∈ S with the same λ valuation into the same class p of partition P i 3: loop 4: for all p ∈ P i do 5: for all s ∈ p do 6: construct mapping sig : Σ → P i : sig ( α ) = p ′ such that δ ( s, α ) ∈ p ′ 7: S i sig := S i 8: sig ∪ s 9: end for sig S i 10: P i +1 := � sig 11: end for 12: if P i = P i +1 then 13: return P i 14: end if 15: i := i + 1 16: end loop
Partition refinement (algorithm) Input: A Mealy machine M = � S, s 0 , Σ , Ω , δ, λ � Output: A partition P on S , the set of states of the Mealy machine 1: i := 1 2: put all s ∈ S with the same λ valuation into the same class p of partition P i 3: loop 4: for all p ∈ P i do 5: for all s ∈ p do 6: construct mapping sig : Σ → P i : sig ( α ) = p ′ such that δ ( s, α ) ∈ p ′ 7: S i sig := S i 8: sig ∪ s 9: end for sig S i 10: P i +1 := � sig 11: end for 12: if P i = P i +1 then 13: return P i 14: end if 15: i := i + 1 16: end loop
Partition refinement (complexity) ◮ Initial computation of λ valuations: ( n · | Σ | ) ◮ Computation of sig objects per rounds: ( n · | Σ | ) ◮ Maximum number of rounds n . Overall complexity: O ( n 2 · | Σ | )
Partition refinement (example) button/ ✷ clean/ � a water/ � pod/ � clean/ � button/ ✷ b c pod/ � water/ � water/ � pod/ � button/ K button/ K d ′ d e Σ \ { clean } / ✷ { water, pod } / � { water, pod } / � button/ ✷ f Σ / ✷
Partition refinement (example) button/ ✷ clean/ � a water/ � pod/ � clean/ � P 1 = { a, b, c } , { d, d ′ } , { e } , { f } button/ ✷ c b pod/ � water/ � water/ � pod/ � button/ K button/ K d ′ e d Σ \ { clean } ( esp. water ) / ✷ { water, pod } / � { water, pod } / � button/ ✷ f Σ( esp. clean ) / ✷
Partition refinement (example) button/ ✷ clean/ � a water/ � pod/ � clean/ � P 1 = { a, b, c } , { d, d ′ } , { e } , { f } button/ ✷ c b pod/ � water/ � water/ � pod/ � P 2 = { a } , { b } , { c } , { d, d ′ } , { e } , { f } button/ K button/ K d ′ e d Σ \ { clean } / ✷ { water, pod } / � { water, pod } / � button/ ✷ f Σ / ✷
Partition refinement (example) button/ ✷ clean/ � a water/ � pod/ � clean/ � P 1 = { a, b, c } , { d, d ′ } , { e } , { f } button/ ✷ c b pod/ � water/ � water/ � pod/ � P 2 = { a } , { b } , { c } , { d, d ′ } , { e } , { f } button/ K button/ K d ′ e d Σ \ { clean } / ✷ { water, pod } / � { water, pod } / � P 3 = { a } , { b } , { c } , { d, d ′ } , { e } , { f } button/ ✷ f Σ / ✷
Minimized Mealy machine button/ ✷ a clean/ � water/ � pod/ � clean/ � button/ ✷ c b pod/ � water/ � water/ � pod/ � button/ K e d { water, pod } / � Σ \ { clean } / ✷ button/ ✷ f Σ / ✷
Extension to black-boxes
Scenario ◮ System under learning (SUL) is a black-box ◮ No knowledge about (number of) internal states ◮ Input alphabet given ◮ Tests can be executed on SUL, output can be recorded
Scenario ◮ System under learning (SUL) is a black-box ◮ No knowledge about (number of) internal states ◮ Input alphabet given ◮ Tests can be executed on SUL, output can be recorded Try to produce complete and correct behavioral model of (interface-)behavior
Naive learning Bad news: in general impossible! The possibility that one has not tested enough will always remain.
Naive learning Bad news: in general impossible! The possibility that one has not tested enough will always remain. ◮ Assume maximum number of states to be N . ◮ Modify naive minimization
Naive minimization 1. Compute prefix tree for depth N .
Naive minimization 1. Compute prefix tree for depth N . 2. Associate every state with path to it in prefix tree (from root)
Naive minimization 1. Compute prefix tree for depth N . 2. Associate every state with path to it in prefix tree (from root) 3. For every state construct T s : Σ ≤ N �→ Ω by T s ( v ) = def � M � ( uv ) where u is access sequence to s and v ∈ Σ ≤ N
Naive minimization 1. Compute prefix tree for depth N . 2. Associate every state with path to it in prefix tree (from root) 3. For every state construct T s : Σ ≤ N �→ Ω by T s ( v ) = def � M � ( uv ) where u is access sequence to s and v ∈ Σ ≤ N 4. Merge states s, s ′ , whenever T s = T s ′
Naive minimization 1. Compute prefix tree for depth N . 2. Associate every state with path to it in prefix tree (from root) 3. For every state construct T s : Σ ≤ N �→ Ω by T s ( v ) = def � M � ( uv ) where u is access sequence to s and v ∈ Σ ≤ N 4. Merge states s, s ′ , whenever T s = T s ′ Complexity for comparing states: O ( | Σ | N · | Σ | N ) = O ( | Σ | 2 N )
Summarizing ◮ States can be represented by access sequences ◮ States can be distinguished by suffixes
Summarizing ◮ States can be represented by access sequences ◮ States can be distinguished by suffixes Open questions: ◮ Can we extend the partition refinement pattern to produce suffixes? ◮ Can the partition refinement pattern be applied in the black box scenario?
The ID learning algorithm
Identifying states Definition (Output-signature) For a SUL and some word u in Σ ∗ , the output-signature of u in SUL is a mapping � SUL � D u : D �→ Ω with D ⊂ Σ ∗ , and � SUL � u ( v ) = def � SUL � ( uv )
ID learning algorithm Input: A SUL with inputs Σ , a set U ⊂ Σ ∗ of access sequences to all states of SUL Output: A Mealy machine M = � S, s 0 , Σ , Ω , δ, λ � for SUL 1: i := 1 , D := Σ , S := U ∪ U × Σ 2: start: 3: compute � SUL � D u for all u ∈ S 4: put u, u ′ ∈ S into the same class p of partition P i if � SUL � D u = � SUL � D u ′ 5: for all p ∈ P i do 6: for all α ∈ Σ do for all u, u ′ ∈ p ∩ U do 7: if uα ∈ p ′ ∧ u ′ α / ∈ p ′ then 8: Let v ∈ D be s.t. � SUL � D uα ( v ) � = � SUL � D 9: u ′ α ( v ) 10: D := D ∪ { αv } , i := i + 1 11: goto start 12: end if 13: end for 14: end for 15: end for 16: construct M � SUL � from P i
ID learning algorithm Input: A SUL with inputs Σ , a set U ⊂ Σ ∗ of access sequences to all states of SUL Output: A Mealy machine M = � S, s 0 , Σ , Ω , δ, λ � for SUL 1: i := 1 , D := Σ , S := U ∪ U × Σ 2: start: 3: compute � SUL � D u for all u ∈ S 4: put u, u ′ ∈ S into the same class p of partition P i if � SUL � D u = � SUL � D u ′ 5: for all p ∈ P i do 6: for all α ∈ Σ do for all u, u ′ ∈ p ∩ U do 7: if uα ∈ p ′ ∧ u ′ α / ∈ p ′ then 8: Let v ∈ D be s.t. � SUL � D uα ( v ) � = � SUL � D 9: u ′ α ( v ) 10: D := D ∪ { αv } , i := i + 1 11: goto start 12: end if 13: end for 14: end for 15: end for 16: construct M � SUL � from P i
ID learning algorithm Input: A SUL with inputs Σ , a set U ⊂ Σ ∗ of access sequences to all states of SUL Output: A Mealy machine M = � S, s 0 , Σ , Ω , δ, λ � for SUL 1: i := 1 , D := Σ , S := U ∪ U × Σ 2: start: 3: compute � SUL � D u for all u ∈ S 4: put u, u ′ ∈ S into the same class p of partition P i if � SUL � D u = � SUL � D u ′ 5: for all p ∈ P i do 6: for all α ∈ Σ do for all u, u ′ ∈ p ∩ U do 7: if uα ∈ p ′ ∧ u ′ α / ∈ p ′ then 8: Let v ∈ D be s.t. � SUL � D uα ( v ) � = � SUL � D 9: u ′ α ( v ) 10: D := D ∪ { αv } , i := i + 1 11: goto start 12: end if 13: end for 14: end for 15: end for 16: construct M � SUL � from P i
ID learning algorithm Input: A SUL with inputs Σ , a set U ⊂ Σ ∗ of access sequences to all states of SUL Output: A Mealy machine M = � S, s 0 , Σ , Ω , δ, λ � for SUL 1: i := 1 , D := Σ , S := U ∪ U × Σ 2: start: 3: compute � SUL � D u for all u ∈ S 4: put u, u ′ ∈ S into the same class p of partition P i if � SUL � D u = � SUL � D u ′ 5: for all p ∈ P i do 6: for all α ∈ Σ do for all u, u ′ ∈ p ∩ U do 7: if uα ∈ p ′ ∧ u ′ α / ∈ p ′ then 8: Let v ∈ D be s.t. � SUL � D uα ( v ) � = � SUL � D 9: u ′ α ( v ) 10: D := D ∪ { αv } , i := i + 1 11: goto start 12: end if 13: end for 14: end for 15: end for 16: construct M � SUL � from P i
ID learning algorithm Input: A SUL with inputs Σ , a set U ⊂ Σ ∗ of access sequences to all states of SUL Output: A Mealy machine M = � S, s 0 , Σ , Ω , δ, λ � for SUL 1: i := 1 , D := Σ , S := U ∪ U × Σ 2: start: 3: compute � SUL � D u for all u ∈ S 4: put u, u ′ ∈ S into the same class p of partition P i if � SUL � D u = � SUL � D u ′ 5: for all p ∈ P i do 6: for all α ∈ Σ do for all u, u ′ ∈ p ∩ U do 7: if uα ∈ p ′ ∧ u ′ α / ∈ p ′ then 8: Let v ∈ D be s.t. � SUL � D uα ( v ) � = � SUL � D 9: u ′ α ( v ) 10: D := D ∪ { αv } , i := i + 1 11: goto start 12: end if 13: end for 14: end for 15: end for 16: construct M � SUL � from P i
Model construction from final P i We will construct a Mealy machine from final P i by: Let M � SUL � = � S, s 0 , Σ , Ω , δ, λ � : ◮ S is given by the classes of P i .
Model construction from final P i We will construct a Mealy machine from final P i by: Let M � SUL � = � S, s 0 , Σ , Ω , δ, λ � : ◮ S is given by the classes of P i . ◮ s 0 is given by p that contains ǫ .
Model construction from final P i We will construct a Mealy machine from final P i by: Let M � SUL � = � S, s 0 , Σ , Ω , δ, λ � : ◮ S is given by the classes of P i . ◮ s 0 is given by p that contains ǫ . ◮ the transition function is defined by δ ( p, α ) = p ′ if exists u ∈ p ∩ U with uα ∈ p ′
Model construction from final P i We will construct a Mealy machine from final P i by: Let M � SUL � = � S, s 0 , Σ , Ω , δ, λ � : ◮ S is given by the classes of P i . ◮ s 0 is given by p that contains ǫ . ◮ the transition function is defined by δ ( p, α ) = p ′ if exists u ∈ p ∩ U with uα ∈ p ′ ◮ the output function can be defined as λ ( p, α ) = o if exists u ∈ p ∩ U with � SUL � D u ( α ) = o
Model construction from final P i We will construct a Mealy machine from final P i by: Let M � SUL � = � S, s 0 , Σ , Ω , δ, λ � : ◮ S is given by the classes of P i . ◮ s 0 is given by p that contains ǫ . ◮ the transition function is defined by δ ( p, α ) = p ′ if exists u ∈ p ∩ U with uα ∈ p ′ ◮ the output function can be defined as λ ( p, α ) = o if exists u ∈ p ∩ U with � SUL � D u ( α ) = o M � SUL � is well-defined and has semantic functional � SUL � if U contains access sequences to all classes of � SUL � .
Recommend
More recommend
