aci s curit informatique cortos
play

ACI Scurit Informatique CORTOS CORTOS = Control and Observation of - PowerPoint PPT Presentation

Feb 13, 2023 •207 likes •1.97k views

Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion ACI Scurit Informatique CORTOS CORTOS = Control and Observation of Real-Time Open Systems Participants: LSV + VERIMAG + IRCCyN Web:

  1. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Control and Game a e ℓ 0 ℓ 1 Bad c u u b ℓ 2 ℓ 3 d Open System = 2-player game, Controller (C) vs Environment (E) ◮ Controller does Act c moves, Environment does Act u moves ◮ Control Objective = Winning condition on the game “Avoid bad states” (safety) or “Enforce good states” (reachability) ◮ Control Problem: find a strategy for the controller to win the game ◮ Various types of game models for C and E ◮ Finite or pushdown or counter automata . . . ◮ Timed or hybrid automata MSR’05 (Autrans, France) Control of Timed Systems 7 / 32

  2. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Control and Game a e ℓ 0 ℓ 1 Bad c u u b ℓ 2 ℓ 3 d Open System = 2-player game, Controller (C) vs Environment (E) ◮ Controller does Act c moves, Environment does Act u moves ◮ Control Objective = Winning condition on the game “Avoid bad states” (safety) or “Enforce good states” (reachability) ◮ Control Problem: find a strategy for the controller to win the game ◮ Various types of game models for C and E ◮ Finite or pushdown or counter automata . . . ◮ Timed or hybrid automata MSR’05 (Autrans, France) Control of Timed Systems 7 / 32

  3. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Control and Game a e ℓ 0 ℓ 1 Bad c u u b ℓ 2 ℓ 3 d Open System = 2-player game, Controller (C) vs Environment (E) ◮ Controller does Act c moves, Environment does Act u moves ◮ Control Objective = Winning condition on the game “Avoid bad states” (safety) or “Enforce good states” (reachability) ◮ Control Problem: find a strategy for the controller to win the game ◮ Various types of game models for C and E ◮ Finite or pushdown or counter automata . . . ◮ Timed or hybrid automata MSR’05 (Autrans, France) Control of Timed Systems 7 / 32

  4. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Problems of Interest Verification Problem (or Model Checking Problem) Input: a model of the closed system S and a property ϕ Problem: Does S satisfy ϕ ? Control Problem (CP) Input: a model of the open system (game) G and a property ϕ Problem: Is there a controller (strategy) C s.t. ( C � G ) satisfy ϕ ? Control Synthesis Problem (CSP) Input: a model of the open system (game) G and a property ϕ Problem: If the answer to the CP ( G , ϕ ) is “yes”, can we effectively compute a witness controller ? MSR’05 (Autrans, France) Control of Timed Systems 8 / 32

  5. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Problems of Interest Verification Problem (or Model Checking Problem) Input: a model of the closed system S and a property ϕ Problem: Does S satisfy ϕ ? Control Problem (CP) Input: a model of the open system (game) G and a property ϕ Problem: Is there a controller (strategy) C s.t. ( C � G ) satisfy ϕ ? Control Synthesis Problem (CSP) Input: a model of the open system (game) G and a property ϕ Problem: If the answer to the CP ( G , ϕ ) is “yes”, can we effectively compute a witness controller ? MSR’05 (Autrans, France) Control of Timed Systems 8 / 32

  6. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Problems of Interest Verification Problem (or Model Checking Problem) Input: a model of the closed system S and a property ϕ Problem: Does S satisfy ϕ ? Control Problem (CP) Input: a model of the open system (game) G and a property ϕ Problem: Is there a controller (strategy) C s.t. ( C � G ) satisfy ϕ ? Control Synthesis Problem (CSP) Input: a model of the open system (game) G and a property ϕ Problem: If the answer to the CP ( G , ϕ ) is “yes”, can we effectively compute a witness controller ? MSR’05 (Autrans, France) Control of Timed Systems 8 / 32

  7. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Problems of Interest Verification Problem (or Model Checking Problem) Input: a model of the closed system S and a property ϕ Problem: Does S satisfy ϕ ? Control Problem (CP) Input: a model of the open system (game) G and a property ϕ Problem: Is there a controller (strategy) C s.t. ( C � G ) satisfy ϕ ? Control Synthesis Problem (CSP) Input: a model of the open system (game) G and a property ϕ Problem: If the answer to the CP ( G , ϕ ) is “yes”, can we effectively compute a witness controller ? MSR’05 (Autrans, France) Control of Timed Systems 8 / 32

  8. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Outline ◮ Verification & Control ◮ Control of Finite Automata ◮ Timed Game Automata ◮ Symbolic Algorithms for Timed Game Automata ◮ Conclusion MSR’05 (Autrans, France) Control of Timed Systems 9 / 32

  9. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Game Automata, Strategies & Winning States a e ℓ 0 ℓ 1 Bad d c u u b Game Automaton ℓ 2 ℓ 3 d Strategy ◮ A strategy f gives for each finite run the controllable action to take. We assume full observability of the system MSR’05 (Autrans, France) Control of Timed Systems 10 / 32

  10. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Game Automata, Strategies & Winning States a e ℓ 0 ℓ 1 Bad d c u u b Game Automaton ℓ 2 ℓ 3 d Strategy ◮ A strategy f gives for each finite run the controllable action to take. We assume full observability of the system MSR’05 (Autrans, France) Control of Timed Systems 10 / 32

  11. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Game Automata, Strategies & Winning States a e ℓ 0 ℓ 1 Bad d c u u b Game Automaton ℓ 2 ℓ 3 d Strategy ◮ A strategy f gives for each finite run the controllable action to take. We assume full observability of the system Example of Strategies: f ′ ( · · · ℓ 0 ) = a f ( ℓ 0 ) = a a f ′ ( · · · ℓ 1 ) = c f ( ℓ 0 − → ℓ 1 ) = c a u f ′ ( · · · ℓ 2 ) = b − → ℓ 1 − → ℓ 2 ) = b f ( ℓ 0 a u b a f ′ ( · · · ℓ 3 ) = d f ( ℓ 0 − → ℓ 1 − → ℓ 2 − → ℓ 0 − → ℓ 1 ) = e MSR’05 (Autrans, France) Control of Timed Systems 10 / 32

  12. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Game Automata, Strategies & Winning States a e ℓ 0 ℓ 1 Bad d c u u b Game Automaton ℓ 2 ℓ 3 d Strategy ◮ A strategy f gives for each finite run the controllable action to take. We assume full observability of the system Example of Strategies: f ′ ( · · · ℓ 0 ) = a f ( ℓ 0 ) = a a f ′ ( · · · ℓ 1 ) = c f ( ℓ 0 − → ℓ 1 ) = c a u f ′ ( · · · ℓ 2 ) = b − → ℓ 1 − → ℓ 2 ) = b f ( ℓ 0 a u b a f ′ ( · · · ℓ 3 ) = d f ( ℓ 0 − → ℓ 1 − → ℓ 2 − → ℓ 0 − → ℓ 1 ) = e MSR’05 (Autrans, France) Control of Timed Systems 10 / 32

  13. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Game Automata, Strategies & Winning States a e ℓ 0 ℓ 1 Bad d c u u b Game Automaton ℓ 2 ℓ 3 d Strategy ◮ A strategy f gives for each finite run the controllable action to take. We assume full observability of the system ◮ A strategy restricts the set of runs of the system. from a state s it generates of subset of the runs of the initial game MSR’05 (Autrans, France) Control of Timed Systems 10 / 32

  14. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Game Automata, Strategies & Winning States a e ℓ 0 ℓ 1 Bad d c u u b Game Automaton ℓ 2 ℓ 3 d Strategy ◮ A strategy f gives for each finite run the controllable action to take. We assume full observability of the system ◮ A strategy restricts the set of runs of the system. from a state s it generates of subset of the runs of the initial game ◮ A strategy is winning if it generates only good runs. MSR’05 (Autrans, France) Control of Timed Systems 10 / 32

  15. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Game Automata, Strategies & Winning States a e ℓ 0 ℓ 1 Bad d c u u b Game Automaton ℓ 2 ℓ 3 d Strategy ◮ A strategy f gives for each finite run the controllable action to take. We assume full observability of the system ◮ A strategy restricts the set of runs of the system. from a state s it generates of subset of the runs of the initial game ◮ A strategy is winning if it generates only good runs. Winning States A state s is winning if there exists a winning strategy from s . MSR’05 (Autrans, France) Control of Timed Systems 10 / 32

  16. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Controllable Predecessors a e ℓ 0 ℓ 1 Bad d c u u b ℓ 2 ℓ 3 d MSR’05 (Autrans, France) Control of Timed Systems 11 / 32

  17. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Controllable Predecessors a e ℓ 0 ℓ 1 Bad d c u u b ℓ 2 ℓ 3 d π ( X ) = states from which one can enforce X with a controllable action π ( X ) = Pred Act c ( X ) \ Pred Act u ( X ) MSR’05 (Autrans, France) Control of Timed Systems 11 / 32

  18. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Controllable Predecessors a e ℓ 0 ℓ 1 Bad d c u u b ℓ 2 ℓ 3 d π ( X ) = states from which one can enforce X with a controllable action π ( X ) = Pred Act c ( X ) \ Pred Act u ( X ) ∃ c ∈ Act c X • π ( X ) • X • not ( ∃ u ∈ Act u ) MSR’05 (Autrans, France) Control of Timed Systems 11 / 32

  19. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Controllable Predecessors a e ℓ 0 ℓ 1 Bad d c u u b ℓ 2 ℓ 3 d π ( X ) = states from which one can enforce X with a controllable action π ( X ) = Pred Act c ( X ) \ Pred Act u ( X ) Some Values of the π Operator ◮ π ( { ℓ 3 } ) = ∅ ◮ π ( { ℓ 1 } ) = { ℓ 0 } ◮ π ( { ℓ 0 , ℓ 1 } ) = { ℓ 0 , ℓ 2 } ◮ π ( { ℓ 0 , ℓ 1 , ℓ 2 } ) = { ℓ 0 , ℓ 1 , ℓ 2 } MSR’05 (Autrans, France) Control of Timed Systems 11 / 32

  20. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Controllable Predecessors a e ℓ 0 ℓ 1 Bad d c u u b ℓ 2 ℓ 3 d π ( X ) = states from which one can enforce X with a controllable action A Fixpoint Characterization of Winning States: 1 let ϕ be a set of safe (good) states and G a game 2 let W ∗ be the greatest fixpoint of h ( X ) = ϕ ∩ π ( X ) 3 W ∗ is the set of winning states for ( G , ϕ ) MSR’05 (Autrans, France) Control of Timed Systems 11 / 32

  21. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Controllable Predecessors a e ℓ 0 ℓ 1 Bad d c u u b ℓ 2 ℓ 3 d π ( X ) = states from which one can enforce X with a controllable action A Fixpoint Characterization of Winning States: 1 let ϕ be a set of safe (good) states and G a game 2 let W ∗ be the greatest fixpoint of h ( X ) = ϕ ∩ π ( X ) 3 W ∗ is the set of winning states for ( G , ϕ ) MSR’05 (Autrans, France) Control of Timed Systems 11 / 32

  22. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Controllable Predecessors a e ℓ 0 ℓ 1 Bad d c u u b ℓ 2 ℓ 3 d π ( X ) = states from which one can enforce X with a controllable action A Fixpoint Characterization of Winning States: 1 let ϕ be a set of safe (good) states and G a game 2 let W ∗ be the greatest fixpoint of h ( X ) = ϕ ∩ π ( X ) 3 W ∗ is the set of winning states for ( G , ϕ ) MSR’05 (Autrans, France) Control of Timed Systems 11 / 32

  23. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Controllable Predecessors a e ℓ 0 ℓ 1 Bad d c u u b ℓ 2 ℓ 3 d π ( X ) = states from which one can enforce X with a controllable action A Fixpoint Characterization of Winning States: 1 let ϕ be a set of safe (good) states and G a game 2 let W ∗ be the greatest fixpoint of h ( X ) = ϕ ∩ π ( X ) 3 W ∗ is the set of winning states for ( G , ϕ ) MSR’05 (Autrans, France) Control of Timed Systems 11 / 32

  24. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Controllable Predecessors a e ℓ 0 ℓ 1 Bad d c u u b ℓ 2 ℓ 3 d π ( X ) = states from which one can enforce X with a controllable action A Fixpoint Characterization of Winning States: 1 let ϕ be a set of safe (good) states and G a game 2 let W ∗ be the greatest fixpoint of h ( X ) = ϕ ∩ π ( X ) 3 W ∗ is the set of winning states for ( G , ϕ ) ◮ CP: check that ℓ 0 ∈ W ∗ MSR’05 (Autrans, France) Control of Timed Systems 11 / 32

  25. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Controllable Predecessors a e ℓ 0 ℓ 1 Bad d c u u b ℓ 2 ℓ 3 d π ( X ) = states from which one can enforce X with a controllable action A Fixpoint Characterization of Winning States: 1 let ϕ be a set of safe (good) states and G a game 2 let W ∗ be the greatest fixpoint of h ( X ) = ϕ ∩ π ( X ) 3 W ∗ is the set of winning states for ( G , ϕ ) ◮ CP: check that ℓ 0 ∈ W ∗ ◮ CSP: Given W ∗ and G , we can build a winning strategy MSR’05 (Autrans, France) Control of Timed Systems 11 / 32

  26. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Results for Finite Games Given G a finite game, ϕ a control objective Theorem (Positional Strategies are Sufficient) Positional (or memoryless) strategies suffice to win ω -regular games. The number of states of C is ≤ number of states of G. MSR’05 (Autrans, France) Control of Timed Systems 12 / 32

  27. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Results for Finite Games Given G a finite game, ϕ a control objective The fixpoint computation of W ∗ terminates Theorem (Positional Strategies are Sufficient) Positional (or memoryless) strategies suffice to win ω -regular games. The number of states of C is ≤ number of states of G. MSR’05 (Autrans, France) Control of Timed Systems 12 / 32

  28. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Results for Finite Games Given G a finite game, ϕ a control objective Theorem (CP is Decidable) CP is decidable for ω -regular objectives. Theorem (Positional Strategies are Sufficient) Positional (or memoryless) strategies suffice to win ω -regular games. The number of states of C is ≤ number of states of G. MSR’05 (Autrans, France) Control of Timed Systems 12 / 32

  29. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Results for Finite Games Given G a finite game, ϕ a control objective Theorem (CP is Decidable) CP is decidable for ω -regular objectives. Theorem (Effectiveness of CSP) Strategy synthesis is effective. We can build a finite automaton (controller) C that specifies a winning strategy. Theorem (Positional Strategies are Sufficient) Positional (or memoryless) strategies suffice to win ω -regular games. The number of states of C is ≤ number of states of G. MSR’05 (Autrans, France) Control of Timed Systems 12 / 32

  30. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Results for Finite Games Given G a finite game, ϕ a control objective Theorem (CP is Decidable) CP is decidable for ω -regular objectives. Theorem (Effectiveness of CSP) Strategy synthesis is effective. We can build a finite automaton (controller) C that specifies a winning strategy. Theorem (Positional Strategies are Sufficient) Positional (or memoryless) strategies suffice to win ω -regular games. The number of states of C is ≤ number of states of G. Add Dense Time ... CP and CSP ? MSR’05 (Autrans, France) Control of Timed Systems 12 / 32

  31. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Outline ◮ Verification & Control ◮ Control of Finite Automata ◮ Timed Game Automata ◮ Symbolic Algorithms for Timed Game Automata ◮ Conclusion MSR’05 (Autrans, France) Control of Timed Systems 13 / 32

  32. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Timed Automata [Alur & Dill’94] [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u [ x ≤ 5 ] Runs = sequence of discrete and time steps 1 . 55 c 1 1 . 67 u ρ 1 : ( ℓ 0 , 0 ) − − − → ( ℓ 0 , 1 . 55 ) − − → ( ℓ 1 , 1 . 55 ) − − − → ( ℓ 1 , 3 . 22 ) − → ( Bad , 3 . 22 ) 1 . 1 c 1 2 . 1 c 2 ρ 2 : ( ℓ 0 , 0 ) − − → ( ℓ 0 , 1 . 1 ) − − → ( ℓ 1 , 1 . 1 ) − − → ( ℓ 1 , 3 . 2 ) − − → ( ℓ 2 , 3 . 2 ) 0 . 1 u − − → ( ℓ 2 , 3 . 3 ) − → ( ℓ 0 , 0 ) · · · · · · · · · MSR’05 (Autrans, France) Control of Timed Systems 14 / 32

  33. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Timed Automata [Alur & Dill’94] [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u [ x ≤ 5 ] Runs = sequence of discrete and time steps 1 . 55 c 1 1 . 67 u ρ 1 : ( ℓ 0 , 0 ) − − − → ( ℓ 0 , 1 . 55 ) − − → ( ℓ 1 , 1 . 55 ) − − − → ( ℓ 1 , 3 . 22 ) − → ( Bad , 3 . 22 ) 1 . 1 c 1 2 . 1 c 2 ρ 2 : ( ℓ 0 , 0 ) − − → ( ℓ 0 , 1 . 1 ) − − → ( ℓ 1 , 1 . 1 ) − − → ( ℓ 1 , 3 . 2 ) − − → ( ℓ 2 , 3 . 2 ) 0 . 1 u − − → ( ℓ 2 , 3 . 3 ) − → ( ℓ 0 , 0 ) · · · · · · · · · MSR’05 (Autrans, France) Control of Timed Systems 14 / 32

  34. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Timed Automata [Alur & Dill’94] [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u [ x ≤ 5 ] Runs = sequence of discrete and time steps 1 . 55 c 1 1 . 67 u ρ 1 : ( ℓ 0 , 0 ) − − − → ( ℓ 0 , 1 . 55 ) − − → ( ℓ 1 , 1 . 55 ) − − − → ( ℓ 1 , 3 . 22 ) − → ( Bad , 3 . 22 ) 1 . 1 c 1 2 . 1 c 2 ρ 2 : ( ℓ 0 , 0 ) − − → ( ℓ 0 , 1 . 1 ) − − → ( ℓ 1 , 1 . 1 ) − − → ( ℓ 1 , 3 . 2 ) − − → ( ℓ 2 , 3 . 2 ) 0 . 1 u − − → ( ℓ 2 , 3 . 3 ) − → ( ℓ 0 , 0 ) · · · · · · · · · MSR’05 (Autrans, France) Control of Timed Systems 14 / 32

  35. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Timed Automata [Alur & Dill’94] [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u [ x ≤ 5 ] Runs = sequence of discrete and time steps 1 . 55 c 1 1 . 67 u ρ 1 : ( ℓ 0 , 0 ) − − − → ( ℓ 0 , 1 . 55 ) − − → ( ℓ 1 , 1 . 55 ) − − − → ( ℓ 1 , 3 . 22 ) − → ( Bad , 3 . 22 ) 1 . 1 c 1 2 . 1 c 2 ρ 2 : ( ℓ 0 , 0 ) − − → ( ℓ 0 , 1 . 1 ) − − → ( ℓ 1 , 1 . 1 ) − − → ( ℓ 1 , 3 . 2 ) − − → ( ℓ 2 , 3 . 2 ) 0 . 1 u − − → ( ℓ 2 , 3 . 3 ) − → ( ℓ 0 , 0 ) · · · · · · · · · MSR’05 (Autrans, France) Control of Timed Systems 14 / 32

  36. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Timed Automata [Alur & Dill’94] [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u [ x ≤ 5 ] Runs = sequence of discrete and time steps 1 . 55 c 1 1 . 67 u ρ 1 : ( ℓ 0 , 0 ) − − − → ( ℓ 0 , 1 . 55 ) − − → ( ℓ 1 , 1 . 55 ) − − − → ( ℓ 1 , 3 . 22 ) − → ( Bad , 3 . 22 ) 1 . 1 c 1 2 . 1 c 2 ρ 2 : ( ℓ 0 , 0 ) − − → ( ℓ 0 , 1 . 1 ) − − → ( ℓ 1 , 1 . 1 ) − − → ( ℓ 1 , 3 . 2 ) − − → ( ℓ 2 , 3 . 2 ) 0 . 1 u − − → ( ℓ 2 , 3 . 3 ) − → ( ℓ 0 , 0 ) · · · · · · · · · MSR’05 (Autrans, France) Control of Timed Systems 14 / 32

  37. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Timed Automata [Alur & Dill’94] [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u [ x ≤ 5 ] Runs = sequence of discrete and time steps 1 . 55 c 1 1 . 67 u ρ 1 : ( ℓ 0 , 0 ) − − − → ( ℓ 0 , 1 . 55 ) − − → ( ℓ 1 , 1 . 55 ) − − − → ( ℓ 1 , 3 . 22 ) − → ( Bad , 3 . 22 ) 1 . 1 c 1 2 . 1 c 2 ρ 2 : ( ℓ 0 , 0 ) − − → ( ℓ 0 , 1 . 1 ) − − → ( ℓ 1 , 1 . 1 ) − − → ( ℓ 1 , 3 . 2 ) − − → ( ℓ 2 , 3 . 2 ) 0 . 1 u − − → ( ℓ 2 , 3 . 3 ) − → ( ℓ 0 , 0 ) · · · · · · · · · MSR’05 (Autrans, France) Control of Timed Systems 14 / 32

  38. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Timed Automata [Alur & Dill’94] [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u [ x ≤ 5 ] Runs = sequence of discrete and time steps 1 . 55 c 1 1 . 67 u ρ 1 : ( ℓ 0 , 0 ) − − − → ( ℓ 0 , 1 . 55 ) − − → ( ℓ 1 , 1 . 55 ) − − − → ( ℓ 1 , 3 . 22 ) − → ( Bad , 3 . 22 ) 1 . 1 c 1 2 . 1 c 2 ρ 2 : ( ℓ 0 , 0 ) − − → ( ℓ 0 , 1 . 1 ) − − → ( ℓ 1 , 1 . 1 ) − − → ( ℓ 1 , 3 . 2 ) − − → ( ℓ 2 , 3 . 2 ) 0 . 1 u − − → ( ℓ 2 , 3 . 3 ) − → ( ℓ 0 , 0 ) · · · · · · · · · MSR’05 (Autrans, France) Control of Timed Systems 14 / 32

  39. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Timed Automata [Alur & Dill’94] [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u [ x ≤ 5 ] Runs = sequence of discrete and time steps 1 . 55 c 1 1 . 67 u ρ 1 : ( ℓ 0 , 0 ) − − − → ( ℓ 0 , 1 . 55 ) − − → ( ℓ 1 , 1 . 55 ) − − − → ( ℓ 1 , 3 . 22 ) − → ( Bad , 3 . 22 ) 1 . 1 c 1 2 . 1 c 2 ρ 2 : ( ℓ 0 , 0 ) − − → ( ℓ 0 , 1 . 1 ) − − → ( ℓ 1 , 1 . 1 ) − − → ( ℓ 1 , 3 . 2 ) − − → ( ℓ 2 , 3 . 2 ) 0 . 1 u − − → ( ℓ 2 , 3 . 3 ) − → ( ℓ 0 , 0 ) · · · · · · · · · MSR’05 (Autrans, France) Control of Timed Systems 14 / 32

  40. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Timed Automata [Alur & Dill’94] [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u [ x ≤ 5 ] Runs = sequence of discrete and time steps 1 . 55 c 1 1 . 67 u ρ 1 : ( ℓ 0 , 0 ) − − − → ( ℓ 0 , 1 . 55 ) − − → ( ℓ 1 , 1 . 55 ) − − − → ( ℓ 1 , 3 . 22 ) − → ( Bad , 3 . 22 ) 1 . 1 c 1 2 . 1 c 2 ρ 2 : ( ℓ 0 , 0 ) − − → ( ℓ 0 , 1 . 1 ) − − → ( ℓ 1 , 1 . 1 ) − − → ( ℓ 1 , 3 . 2 ) − − → ( ℓ 2 , 3 . 2 ) 0 . 1 u − − → ( ℓ 2 , 3 . 3 ) − → ( ℓ 0 , 0 ) · · · · · · · · · MSR’05 (Autrans, France) Control of Timed Systems 14 / 32

  41. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Timed Automata [Alur & Dill’94] [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u [ x ≤ 5 ] Runs = sequence of discrete and time steps 1 . 55 c 1 1 . 67 u ρ 1 : ( ℓ 0 , 0 ) − − − → ( ℓ 0 , 1 . 55 ) − − → ( ℓ 1 , 1 . 55 ) − − − → ( ℓ 1 , 3 . 22 ) − → ( Bad , 3 . 22 ) 1 . 1 c 1 2 . 1 c 2 ρ 2 : ( ℓ 0 , 0 ) − − → ( ℓ 0 , 1 . 1 ) − − → ( ℓ 1 , 1 . 1 ) − − → ( ℓ 1 , 3 . 2 ) − − → ( ℓ 2 , 3 . 2 ) 0 . 1 u − − → ( ℓ 2 , 3 . 3 ) − → ( ℓ 0 , 0 ) · · · · · · · · · MSR’05 (Autrans, France) Control of Timed Systems 14 / 32

  42. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Timed Automata [Alur & Dill’94] [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u [ x ≤ 5 ] Runs = sequence of discrete and time steps 1 . 55 c 1 1 . 67 u ρ 1 : ( ℓ 0 , 0 ) − − − → ( ℓ 0 , 1 . 55 ) − − → ( ℓ 1 , 1 . 55 ) − − − → ( ℓ 1 , 3 . 22 ) − → ( Bad , 3 . 22 ) 1 . 1 c 1 2 . 1 c 2 ρ 2 : ( ℓ 0 , 0 ) − − → ( ℓ 0 , 1 . 1 ) − − → ( ℓ 1 , 1 . 1 ) − − → ( ℓ 1 , 3 . 2 ) − − → ( ℓ 2 , 3 . 2 ) 0 . 1 u − − → ( ℓ 2 , 3 . 3 ) − → ( ℓ 0 , 0 ) · · · · · · · · · MSR’05 (Autrans, France) Control of Timed Systems 14 / 32

  43. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Timed Automata [Alur & Dill’94] [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u [ x ≤ 5 ] Runs = sequence of discrete and time steps 1 . 55 c 1 1 . 67 u ρ 1 : ( ℓ 0 , 0 ) − − − → ( ℓ 0 , 1 . 55 ) − − → ( ℓ 1 , 1 . 55 ) − − − → ( ℓ 1 , 3 . 22 ) − → ( Bad , 3 . 22 ) 1 . 1 c 1 2 . 1 c 2 ρ 2 : ( ℓ 0 , 0 ) − − → ( ℓ 0 , 1 . 1 ) − − → ( ℓ 1 , 1 . 1 ) − − → ( ℓ 1 , 3 . 2 ) − − → ( ℓ 2 , 3 . 2 ) 0 . 1 u − − → ( ℓ 2 , 3 . 3 ) − → ( ℓ 0 , 0 ) · · · · · · · · · MSR’05 (Autrans, France) Control of Timed Systems 14 / 32

  44. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Timed Automata [Alur & Dill’94] [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u [ x ≤ 5 ] Runs = sequence of discrete and time steps 1 . 55 c 1 1 . 67 u ρ 1 : ( ℓ 0 , 0 ) − − − → ( ℓ 0 , 1 . 55 ) − − → ( ℓ 1 , 1 . 55 ) − − − → ( ℓ 1 , 3 . 22 ) − → ( Bad , 3 . 22 ) 1 . 1 c 1 2 . 1 c 2 ρ 2 : ( ℓ 0 , 0 ) − − → ( ℓ 0 , 1 . 1 ) − − → ( ℓ 1 , 1 . 1 ) − − → ( ℓ 1 , 3 . 2 ) − − → ( ℓ 2 , 3 . 2 ) 0 . 1 u − − → ( ℓ 2 , 3 . 3 ) − → ( ℓ 0 , 0 ) · · · · · · · · · MSR’05 (Autrans, France) Control of Timed Systems 14 / 32

  45. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Timed Automata [Alur & Dill’94] [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u [ x ≤ 5 ] Runs = sequence of discrete and time steps 1 . 55 c 1 1 . 67 u ρ 1 : ( ℓ 0 , 0 ) − − − → ( ℓ 0 , 1 . 55 ) − − → ( ℓ 1 , 1 . 55 ) − − − → ( ℓ 1 , 3 . 22 ) − → ( Bad , 3 . 22 ) 1 . 1 c 1 2 . 1 c 2 ρ 2 : ( ℓ 0 , 0 ) − − → ( ℓ 0 , 1 . 1 ) − − → ( ℓ 1 , 1 . 1 ) − − → ( ℓ 1 , 3 . 2 ) − − → ( ℓ 2 , 3 . 2 ) 0 . 1 u − − → ( ℓ 2 , 3 . 3 ) − → ( ℓ 0 , 0 ) · · · · · · · · · MSR’05 (Autrans, France) Control of Timed Systems 14 / 32

  46. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Timed Automata [Alur & Dill’94] [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u [ x ≤ 5 ] Runs = sequence of discrete and time steps 1 . 55 c 1 1 . 67 u ρ 1 : ( ℓ 0 , 0 ) − − − → ( ℓ 0 , 1 . 55 ) − − → ( ℓ 1 , 1 . 55 ) − − − → ( ℓ 1 , 3 . 22 ) − → ( Bad , 3 . 22 ) 1 . 1 c 1 2 . 1 c 2 ρ 2 : ( ℓ 0 , 0 ) − − → ( ℓ 0 , 1 . 1 ) − − → ( ℓ 1 , 1 . 1 ) − − → ( ℓ 1 , 3 . 2 ) − − → ( ℓ 2 , 3 . 2 ) 0 . 1 u − − → ( ℓ 2 , 3 . 3 ) − → ( ℓ 0 , 0 ) · · · · · · · · · MSR’05 (Autrans, France) Control of Timed Systems 14 / 32

  47. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Timed Game Automata [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u ◮ Introduced by Maler, Pnueli, Sifakis [Maler, 95] ◮ The controller continuously observes the system time elapsing and discrete moves are observable ◮ It has the choice between two types of moves: ◮ “do nothing” ◮ “do a controllable action” (among the ones that are possible) ◮ It can stop time from elapsing by taking a controllable move MSR’05 (Autrans, France) Control of Timed Systems 15 / 32

  48. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Timed Game Automata [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u ◮ Introduced by Maler, Pnueli, Sifakis [Maler, 95] ◮ The controller continuously observes the system time elapsing and discrete moves are observable ◮ It has the choice between two types of moves: ◮ “do nothing” ◮ “do a controllable action” (among the ones that are possible) ◮ It can stop time from elapsing by taking a controllable move MSR’05 (Autrans, France) Control of Timed Systems 15 / 32

  49. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Timed Game Automata [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u ◮ Introduced by Maler, Pnueli, Sifakis [Maler, 95] ◮ The controller continuously observes the system time elapsing and discrete moves are observable ◮ It has the choice between two types of moves: ◮ “do nothing” ◮ “do a controllable action” (among the ones that are possible) ◮ It can stop time from elapsing by taking a controllable move MSR’05 (Autrans, France) Control of Timed Systems 15 / 32

  50. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Timed Game Automata [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u ◮ Introduced by Maler, Pnueli, Sifakis [Maler, 95] ◮ The controller continuously observes the system time elapsing and discrete moves are observable ◮ It has the choice between two types of moves: ◮ “do nothing” ◮ “do a controllable action” (among the ones that are possible) ◮ It can stop time from elapsing by taking a controllable move MSR’05 (Autrans, France) Control of Timed Systems 15 / 32

  51. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Timed Game Automata [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u ◮ Introduced by Maler, Pnueli, Sifakis [Maler, 95] ◮ The controller continuously observes the system time elapsing and discrete moves are observable ◮ It has the choice between two types of moves: ◮ “do nothing” ◮ “do a controllable action” (among the ones that are possible) ◮ It can stop time from elapsing by taking a controllable move MSR’05 (Autrans, France) Control of Timed Systems 15 / 32

  52. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Timed Game Automata [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u ◮ Introduced by Maler, Pnueli, Sifakis [Maler, 95] ◮ The controller continuously observes the system time elapsing and discrete moves are observable ◮ It has the choice between two types of moves: ◮ “do nothing” ◮ “do a controllable action” (among the ones that are possible) ◮ It can stop time from elapsing by taking a controllable move MSR’05 (Autrans, France) Control of Timed Systems 15 / 32

  53. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Timed Game Automata [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u ◮ Introduced by Maler, Pnueli, Sifakis [Maler, 95] ◮ The controller continuously observes the system time elapsing and discrete moves are observable ◮ It has the choice between two types of moves: ◮ “do nothing” ◮ “do a controllable action” (among the ones that are possible) ◮ It can stop time from elapsing by taking a controllable move MSR’05 (Autrans, France) Control of Timed Systems 15 / 32

  54. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion How to Deal with Dense-Time ? ◮ Infinite state systems Symbolic representation of states ◮ A strategy (or controller) can choose to wait Add a special wait action ◮ Dense time · · · the controller can be unfair ◮ block time ◮ do infinitely many actions in a bounded time ◮ do arbitrarily closed (in time) discrete actions Implementation Issues MSR’05 (Autrans, France) Control of Timed Systems 16 / 32

  55. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion How to Deal with Dense-Time ? ◮ Infinite state systems Symbolic representation of states ◮ A strategy (or controller) can choose to wait Add a special wait action ◮ Dense time · · · the controller can be unfair ◮ block time ◮ do infinitely many actions in a bounded time ◮ do arbitrarily closed (in time) discrete actions Implementation Issues MSR’05 (Autrans, France) Control of Timed Systems 16 / 32

  56. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion How to Deal with Dense-Time ? ◮ Infinite state systems Symbolic representation of states ◮ A strategy (or controller) can choose to wait Add a special wait action ◮ Dense time · · · the controller can be unfair ◮ block time ◮ do infinitely many actions in a bounded time ◮ do arbitrarily closed (in time) discrete actions Implementation Issues MSR’05 (Autrans, France) Control of Timed Systems 16 / 32

  57. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion How to Deal with Dense-Time ? ◮ Infinite state systems Symbolic representation of states ◮ A strategy (or controller) can choose to wait Add a special wait action ◮ Dense time · · · the controller can be unfair ◮ block time ◮ do infinitely many actions in a bounded time ◮ do arbitrarily closed (in time) discrete actions Implementation Issues MSR’05 (Autrans, France) Control of Timed Systems 16 / 32

  58. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion How to Deal with Dense-Time ? ◮ Infinite state systems Symbolic representation of states ◮ A strategy (or controller) can choose to wait Add a special wait action ◮ Dense time · · · the controller can be unfair ◮ block time ◮ do infinitely many actions in a bounded time ◮ do arbitrarily closed (in time) discrete actions Implementation Issues MSR’05 (Autrans, France) Control of Timed Systems 16 / 32

  59. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion How to Deal with Dense-Time ? ◮ Infinite state systems Symbolic representation of states ◮ A strategy (or controller) can choose to wait Add a special wait action ◮ Dense time · · · the controller can be unfair ◮ block time ◮ do infinitely many actions in a bounded time ◮ do arbitrarily closed (in time) discrete actions Implementation Issues MSR’05 (Autrans, France) Control of Timed Systems 16 / 32

  60. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion How to Deal with Dense-Time ? ◮ Infinite state systems Symbolic representation of states ◮ A strategy (or controller) can choose to wait Add a special wait action ◮ Dense time · · · the controller can be unfair ◮ block time ◮ do infinitely many actions in a bounded time ◮ do arbitrarily closed (in time) discrete actions Implementation Issues MSR’05 (Autrans, France) Control of Timed Systems 16 / 32

  61. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion How to Deal with Dense-Time ? ◮ Infinite state systems Symbolic representation of states ◮ A strategy (or controller) can choose to wait Add a special wait action ◮ Dense time · · · the controller can be unfair ◮ block time ◮ do infinitely many actions in a bounded time ◮ do arbitrarily closed (in time) discrete actions Implementation Issues MSR’05 (Autrans, France) Control of Timed Systems 16 / 32

  62. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion How to Deal with Dense-Time ? ◮ Infinite state systems Symbolic representation of states ◮ A strategy (or controller) can choose to wait Add a special wait action ◮ Dense time · · · the controller can be unfair ◮ block time ◮ do infinitely many actions in a bounded time ◮ do arbitrarily closed (in time) discrete actions Implementation Issues MSR’05 (Autrans, France) Control of Timed Systems 16 / 32

  63. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Strategies and Winning States [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u [ x ≤ 5 ] MSR’05 (Autrans, France) Control of Timed Systems 17 / 32

  64. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Strategies and Winning States [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u [ x ≤ 5 ] The strategy f : “Always wait as long as the system permits” 4 c 1 0 . 5 u ρ 1 : ( ℓ 0 , 0 ) − → ( ℓ 0 , 4 ) − − → ( ℓ 1 , 4 ) − − → ( ℓ 1 , 4 . 5 ) − → ( Bad , 4 . 5 ) 4 c 1 1 . 0 c 2 c 3 − → ( ℓ 0 , 4 ) − − → ( ℓ 1 , 4 ) − − → ( ℓ 1 , 5 ) − − → ( ℓ 2 , 5 ) − − → ( ℓ 0 , 0 ) · · · ρ 2 : ( ℓ 0 , 0 ) MSR’05 (Autrans, France) Control of Timed Systems 17 / 32

  65. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Strategies and Winning States [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u [ x ≤ 5 ] The strategy f : “Always wait as long as the system permits” 4 c 1 0 . 5 u ρ 1 : ( ℓ 0 , 0 ) − → ( ℓ 0 , 4 ) − − → ( ℓ 1 , 4 ) − − → ( ℓ 1 , 4 . 5 ) − → ( Bad , 4 . 5 ) 4 c 1 1 . 0 c 2 c 3 − → ( ℓ 0 , 4 ) − − → ( ℓ 1 , 4 ) − − → ( ℓ 1 , 5 ) − − → ( ℓ 2 , 5 ) − − → ( ℓ 0 , 0 ) · · · ρ 2 : ( ℓ 0 , 0 ) MSR’05 (Autrans, France) Control of Timed Systems 17 / 32

  66. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Strategies and Winning States [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u [ x ≤ 5 ] The strategy f : “Always wait as long as the system permits” 4 c 1 0 . 5 u ρ 1 : ( ℓ 0 , 0 ) − → ( ℓ 0 , 4 ) − − → ( ℓ 1 , 4 ) − − → ( ℓ 1 , 4 . 5 ) − → ( Bad , 4 . 5 ) 4 c 1 1 . 0 c 2 c 3 − → ( ℓ 0 , 4 ) − − → ( ℓ 1 , 4 ) − − → ( ℓ 1 , 5 ) − − → ( ℓ 2 , 5 ) − − → ( ℓ 0 , 0 ) · · · ρ 2 : ( ℓ 0 , 0 ) MSR’05 (Autrans, France) Control of Timed Systems 17 / 32

  67. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Strategies and Winning States [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u [ x ≤ 5 ] The strategy f : “Always wait as long as the system permits” 4 c 1 0 . 5 u ρ 1 : ( ℓ 0 , 0 ) − → ( ℓ 0 , 4 ) − − → ( ℓ 1 , 4 ) − − → ( ℓ 1 , 4 . 5 ) − → ( Bad , 4 . 5 ) 4 c 1 1 . 0 c 2 c 3 − → ( ℓ 0 , 4 ) − − → ( ℓ 1 , 4 ) − − → ( ℓ 1 , 5 ) − − → ( ℓ 2 , 5 ) − − → ( ℓ 0 , 0 ) · · · ρ 2 : ( ℓ 0 , 0 ) MSR’05 (Autrans, France) Control of Timed Systems 17 / 32

  68. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Strategies and Winning States [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u [ x ≤ 5 ] The strategy f : “Always wait as long as the system permits” 4 c 1 0 . 5 u ρ 1 : ( ℓ 0 , 0 ) − → ( ℓ 0 , 4 ) − − → ( ℓ 1 , 4 ) − − → ( ℓ 1 , 4 . 5 ) − → ( Bad , 4 . 5 ) 4 c 1 1 . 0 c 2 c 3 − → ( ℓ 0 , 4 ) − − → ( ℓ 1 , 4 ) − − → ( ℓ 1 , 5 ) − − → ( ℓ 2 , 5 ) − − → ( ℓ 0 , 0 ) · · · ρ 2 : ( ℓ 0 , 0 ) MSR’05 (Autrans, France) Control of Timed Systems 17 / 32

  69. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Strategies and Winning States [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u [ x ≤ 5 ] The strategy f : “Always wait as long as the system permits” 4 c 1 0 . 5 u ρ 1 : ( ℓ 0 , 0 ) − → ( ℓ 0 , 4 ) − − → ( ℓ 1 , 4 ) − − → ( ℓ 1 , 4 . 5 ) − → ( Bad , 4 . 5 ) 4 c 1 1 . 0 c 2 c 3 − → ( ℓ 0 , 4 ) − − → ( ℓ 1 , 4 ) − − → ( ℓ 1 , 5 ) − − → ( ℓ 2 , 5 ) − − → ( ℓ 0 , 0 ) · · · ρ 2 : ( ℓ 0 , 0 ) MSR’05 (Autrans, France) Control of Timed Systems 17 / 32

  70. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Strategies and Winning States [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u [ x ≤ 5 ] The strategy f : “Always wait as long as the system permits” 4 c 1 0 . 5 u ρ 1 : ( ℓ 0 , 0 ) − → ( ℓ 0 , 4 ) − − → ( ℓ 1 , 4 ) − − → ( ℓ 1 , 4 . 5 ) − → ( Bad , 4 . 5 ) 4 c 1 1 . 0 c 2 c 3 − → ( ℓ 0 , 4 ) − − → ( ℓ 1 , 4 ) − − → ( ℓ 1 , 5 ) − − → ( ℓ 2 , 5 ) − − → ( ℓ 0 , 0 ) · · · ρ 2 : ( ℓ 0 , 0 ) MSR’05 (Autrans, France) Control of Timed Systems 17 / 32

  71. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Strategies and Winning States [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u [ x ≤ 5 ] The strategy f : “Always wait as long as the system permits” 4 c 1 0 . 5 u ρ 1 : ( ℓ 0 , 0 ) − → ( ℓ 0 , 4 ) − − → ( ℓ 1 , 4 ) − − → ( ℓ 1 , 4 . 5 ) − → ( Bad , 4 . 5 ) 4 c 1 1 . 0 c 2 c 3 − → ( ℓ 0 , 4 ) − − → ( ℓ 1 , 4 ) − − → ( ℓ 1 , 5 ) − − → ( ℓ 2 , 5 ) − − → ( ℓ 0 , 0 ) · · · ρ 2 : ( ℓ 0 , 0 ) MSR’05 (Autrans, France) Control of Timed Systems 17 / 32

  72. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Strategies and Winning States [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u [ x ≤ 5 ] The strategy f : “Always wait as long as the system permits” 4 c 1 0 . 5 u ρ 1 : ( ℓ 0 , 0 ) − → ( ℓ 0 , 4 ) − − → ( ℓ 1 , 4 ) − − → ( ℓ 1 , 4 . 5 ) − → ( Bad , 4 . 5 ) 4 c 1 1 . 0 c 2 c 3 − → ( ℓ 0 , 4 ) − − → ( ℓ 1 , 4 ) − − → ( ℓ 1 , 5 ) − − → ( ℓ 2 , 5 ) − − → ( ℓ 0 , 0 ) · · · ρ 2 : ( ℓ 0 , 0 ) MSR’05 (Autrans, France) Control of Timed Systems 17 / 32

  73. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Strategies and Winning States [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u [ x ≤ 5 ] The strategy f : “Always wait as long as the system permits” 4 c 1 0 . 5 u ρ 1 : ( ℓ 0 , 0 ) − → ( ℓ 0 , 4 ) − − → ( ℓ 1 , 4 ) − − → ( ℓ 1 , 4 . 5 ) − → ( Bad , 4 . 5 ) 4 c 1 1 . 0 c 2 c 3 − → ( ℓ 0 , 4 ) − − → ( ℓ 1 , 4 ) − − → ( ℓ 1 , 5 ) − − → ( ℓ 2 , 5 ) − − → ( ℓ 0 , 0 ) · · · ρ 2 : ( ℓ 0 , 0 ) MSR’05 (Autrans, France) Control of Timed Systems 17 / 32

  74. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Strategies and Winning States [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u [ x ≤ 5 ] The strategy f : “Always wait as long as the system permits” 4 c 1 0 . 5 u ρ 1 : ( ℓ 0 , 0 ) − → ( ℓ 0 , 4 ) − − → ( ℓ 1 , 4 ) − − → ( ℓ 1 , 4 . 5 ) − → ( Bad , 4 . 5 ) 4 c 1 1 . 0 c 2 c 3 − → ( ℓ 0 , 4 ) − − → ( ℓ 1 , 4 ) − − → ( ℓ 1 , 5 ) − − → ( ℓ 2 , 5 ) − − → ( ℓ 0 , 0 ) · · · ρ 2 : ( ℓ 0 , 0 ) MSR’05 (Autrans, France) Control of Timed Systems 17 / 32

  75. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Strategies and Winning States [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u [ x ≤ 5 ] The strategy f : “Always wait as long as the system permits” 4 c 1 0 . 5 u ρ 1 : ( ℓ 0 , 0 ) − → ( ℓ 0 , 4 ) − − → ( ℓ 1 , 4 ) − − → ( ℓ 1 , 4 . 5 ) − → ( Bad , 4 . 5 ) 4 c 1 1 . 0 c 2 c 3 − → ( ℓ 0 , 4 ) − − → ( ℓ 1 , 4 ) − − → ( ℓ 1 , 5 ) − − → ( ℓ 2 , 5 ) − − → ( ℓ 0 , 0 ) · · · ρ 2 : ( ℓ 0 , 0 ) MSR’05 (Autrans, France) Control of Timed Systems 17 / 32

  76. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Strategies and Winning States [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u [ x ≤ 5 ] The strategy f : “Always wait as long as the system permits” 4 c 1 0 . 5 u ρ 1 : ( ℓ 0 , 0 ) − → ( ℓ 0 , 4 ) − − → ( ℓ 1 , 4 ) − − → ( ℓ 1 , 4 . 5 ) − → ( Bad , 4 . 5 ) 4 c 1 1 . 0 c 2 c 3 − → ( ℓ 0 , 4 ) − − → ( ℓ 1 , 4 ) − − → ( ℓ 1 , 5 ) − − → ( ℓ 2 , 5 ) − − → ( ℓ 0 , 0 ) · · · ρ 2 : ( ℓ 0 , 0 ) MSR’05 (Autrans, France) Control of Timed Systems 17 / 32

  77. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Strategies and Winning States [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u [ x ≤ 5 ] A winning strategy f ′ in ℓ 0 at x = 2 do c 1 ; in ℓ 1 at x = 2 . 5 do c 2 ; in ℓ 2 at x = 4 do c 3 2 c 1 ( ℓ 0 , 0 ) − → ( ℓ 0 , 2 ) − − → ( ℓ 1 , 2 ) ρ : MSR’05 (Autrans, France) Control of Timed Systems 17 / 32

  78. Verification & Control Discrete Games Timed Games Symbolic Algorithms Conclusion Strategies and Winning States [ x ≤ 4 ] [ x ≤ 5 ] x ≤ 4; c 1 x > 3; u x := 0 ℓ 0 ℓ 1 Bad c 2 c 3 ; x := 0 ℓ 2 x < 2; u [ x ≤ 5 ] A winning strategy f ′ in ℓ 0 at x = 2 do c 1 ; in ℓ 1 at x = 2 . 5 do c 2 ; in ℓ 2 at x = 4 do c 3 2 c 1 ( ℓ 0 , 0 ) − → ( ℓ 0 , 2 ) − − → ( ℓ 1 , 2 ) ρ : MSR’05 (Autrans, France) Control of Timed Systems 17 / 32

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

NON T NON-T RADIT RADIT IONAL IONAL / / HUMAN SE HUMAN SE CURIT CURIT Y T Y T HRE

NON T NON-T RADIT RADIT IONAL IONAL / / HUMAN SE HUMAN SE CURIT CURIT Y T Y T HRE

NON T NON-T RADIT RADIT IONAL IONAL / / HUMAN SE HUMAN SE CURIT CURIT Y T Y T HRE HRE AT AT S S IN SOUT IN SOUT HE HE AST AST ASIA ASIA 30 Nove mbe r 30 Nove mbe r 2015 2015 NESTOR Z OCHOA AMBASSADOR OF THE REPUBLIC

677 views • 33 slides
A DE L PHI ST UDY OF COUNT E RME AS URE S T O SE CURIT Y Me linda L yle s T HRE

A DE L PHI ST UDY OF COUNT E RME AS URE S T O SE CURIT Y Me linda L yle s T HRE

A DE L PHI ST UDY OF COUNT E RME AS URE S T O SE CURIT Y Me linda L yle s T HRE AT S IN NE T WORKE D ME DICAL DE VICE S Pro b le m Sta te me nt Purpo se o f the Re se a rc h Re se a rc h Que stio ns

380 views • 13 slides
T HE SPI RI T OF INNOVAT ION DE F E NSE HOME L AND SE CURIT Y SUST AINME NT

T HE SPI RI T OF INNOVAT ION DE F E NSE HOME L AND SE CURIT Y SUST AINME NT

T HE SPI RI T OF INNOVAT ION DE F E NSE HOME L AND SE CURIT Y SUST AINME NT &amp; SUPPORT ME DICAL INST RUME NT AT ION COMME RCIAL AVIAT ION 1 AGE NDA Sta te o f Glo b a l Se c urity a nd T hre a ts

419 views • 27 slides
MANAGING INF ORMAT ION PRIVACY &amp; SE CURIT Y RE MOT E L Y Pr e se nte d by: Mar y

MANAGING INF ORMAT ION PRIVACY &amp; SE CURIT Y RE MOT E L Y Pr e se nte d by: Mar y

MANAGING INF ORMAT ION PRIVACY &amp; SE CURIT Y RE MOT E L Y Pr e se nte d by: Mar y Golab, IPO In c ollabor ation with Damian Hollow, URO &amp; She lle y Gar r e tt, CISO Offic e F OI P L ia iso n Offic e r (F L O) Me e ting

263 views • 12 slides
CO CO 447 CO COURSE INTRODUCTION SE SECU CURIT RITY P PROP OPER ERTIE IES SE SECU

CO CO 447 CO COURSE INTRODUCTION SE SECU CURIT RITY P PROP OPER ERTIE IES SE SECU

CO CO 447 CO COURSE INTRODUCTION SE SECU CURIT RITY P PROP OPER ERTIE IES SE SECU CURE D RE DESIG SIGN Dr. Ben Livshits Hi High-Le Level el Course e Lo Logistics cs 2 https://co447.doc.ic.ac.uk/ Cou Course Log ogistics

984 views • 25 slides
Agr ic ultur e in Che shir e County A F OOD SE CURIT Y VISION WHY AN AGRICUL T URE

Agr ic ultur e in Che shir e County A F OOD SE CURIT Y VISION WHY AN AGRICUL T URE

Agr ic ultur e in Che shir e County A F OOD SE CURIT Y VISION WHY AN AGRICUL T URE VISION? RE CONCIL E KE E NE AGRICUL T URE COUNT Y SE AT IS CE NT E R OF COMMISSION (2012) WIT H CIT Y MAST E R AGRICUL T URE HUB

523 views • 12 slides
5 Intgration continue 625-1.1 Industrialisation du logiciel Bachelor en informatique de

5 Intgration continue 625-1.1 Industrialisation du logiciel Bachelor en informatique de

5 Intgration continue 625-1.1 Industrialisation du logiciel Bachelor en informatique de gestion 3IGPT/4IGTP ulysse.rosselet@he-arc.ch Analyse Conception Production Dploiement Build tools, rcapitulation Jusquici

748 views • 21 slides
Master Informatique - Universit Paris-Sud 06/10/16 Outline What is a theory? a model?

Master Informatique - Universit Paris-Sud 06/10/16 Outline What is a theory? a model?

Master Informatique - Universit Paris-Sud 06/10/16 Outline What is a theory? a model? Theories and Models Perception, action for Human-Computer Interaction Cognition, behavior Michel Beaudouin-Lafon - mbl@lri.fr Laboratoire de Recherche

238 views • 10 slides
BEYOND MEAN-FIELD APPROXIMATION AURLIEN DECELLE LABORATOIRE DE RECHERCHE EN INFORMATIQUE

BEYOND MEAN-FIELD APPROXIMATION AURLIEN DECELLE LABORATOIRE DE RECHERCHE EN INFORMATIQUE

BEYOND MEAN-FIELD APPROXIMATION AURLIEN DECELLE LABORATOIRE DE RECHERCHE EN INFORMATIQUE UNIVERSIT PARIS SUD MOTIVATIONS Why inverse problems ? In Machine Learning online recognition tasks In Physics understanding a

754 views • 40 slides
Informatique et preuve Une br` eve histoire du raisonnement automatis e Charles Pecheur

Informatique et preuve Une br` eve histoire du raisonnement automatis e Charles Pecheur

Informatique et preuve Une br` eve histoire du raisonnement automatis e Charles Pecheur Universit e catholique de Louvain S eminaire fondements et notions fondamentales 12 mars 2012 Replacing Scholars by Programs? From to ?

1.17k views • 114 slides
About contingency and ignorance Philippe Balbiani Institut de recherche en informatique de

About contingency and ignorance Philippe Balbiani Institut de recherche en informatique de

About contingency and ignorance Philippe Balbiani Institut de recherche en informatique de Toulouse CNRS Toulouse University, France with a little help from Hans van Ditmarsch and Jie Fan Introduction Modal logic Study of principles of

828 views • 58 slides
Ins GAM Dr. Camille SALINESI Centre de Recherche en Informatique Universit Paris1

Ins GAM Dr. Camille SALINESI Centre de Recherche en Informatique Universit Paris1

Ins GAM Dr. Camille SALINESI Centre de Recherche en Informatique Universit Paris1 Panthon Sorbonne 1 A Requirement-driven Approach for Designing Data Warehouses RE/WS RE/WS Strategies RE/DW Strategies cu_DW systems 2

418 views • 17 slides
RIStAL Centre de Recherche en Informatique, Signal et Automatique de Lille 1 Outline

RIStAL Centre de Recherche en Informatique, Signal et Automatique de Lille 1 Outline

Temporal Interfaces for Adaptive Real-Time Components Giuseppe Lipari, University of Lille CRTS Workshop @ RTSS, 5 december 2017 RIStAL Centre de Recherche en Informatique, Signal et Automatique de Lille 1 Outline Introduction 1 2

559 views • 44 slides
Cyberguerre informatique une r ealit e Pascal Lafourcade Octobre 2017 1 / 19 Computers

Cyberguerre informatique une r ealit e Pascal Lafourcade Octobre 2017 1 / 19 Computers

Cyberguerre informatique une r ealit e Pascal Lafourcade Octobre 2017 1 / 19 Computers are everywhere! 2 / 19 5 Famillies of Cyber Criminality Phishing Espionnage Ransomwares Sabotage Destabilisation 3 / 19

465 views • 29 slides
S ns r N t Sensor Network Security rk S curit 3/2/2017 Sensor Network Security (Simon S. Lam)

S ns r N t Sensor Network Security rk S curit 3/2/2017 Sensor Network Security (Simon S. Lam)

3/2/2017 S ns r N t Sensor Network Security rk S curit 3/2/2017 Sensor Network Security (Simon S. Lam) 1 1 3/2/2017 R. Blom, An optimal class of symmetric key generation systems, R. Blom, An optimal class of symmetric key generation

445 views • 12 slides
FEU STOP Dpartement Gnie lectrique et Informatique Industrielle 2007/2008 Ancienne

FEU STOP Dpartement Gnie lectrique et Informatique Industrielle 2007/2008 Ancienne

Guillaume Lematre et Nicolas Chapelle prsentent FEU STOP Dpartement Gnie lectrique et Informatique Industrielle 2007/2008 Ancienne interface Fonctionnement ancien systme Surface &lt; Niveau 1 Capture dune image

320 views • 16 slides
A survey of Tutte-Whitney polynomials Graham Farr Faculty of IT Monash University

A survey of Tutte-Whitney polynomials Graham Farr Faculty of IT Monash University

A survey of Tutte-Whitney polynomials Graham Farr Faculty of IT Monash University Graham.Farr@infotech.monash.edu.au July 2007 Counting colourings proper colourings Counting colourings proper colourings Counting colourings proper

1.78k views • 141 slides
Summary: Proposed Notice of Benefit &amp; Payment Parameters for 2017 QHP Certification

Summary: Proposed Notice of Benefit &amp; Payment Parameters for 2017 QHP Certification

Summary: Proposed Notice of Benefit &amp; Payment Parameters for 2017 QHP Certification Considerations December 1, 2015 Agenda I. Overview of QHP Certification Topics A. Meaningful Difference Standards B. Cost Sharing C. Standard Plans

772 views • 13 slides
Euston Community Representatives Group - HS2 update 3 December 2019 For community use only

Euston Community Representatives Group - HS2 update 3 December 2019 For community use only

Euston Community Representatives Group - HS2 update 3 December 2019 For community use only Version One Local Area Engagement Plan Finalised and printed Post-election publication on hs2.org Next steps 2 Community Engagement update

288 views • 15 slides
I. Pesticides Definition: any chemical used to kill pests. A. In the U.S., over 700 active

I. Pesticides Definition: any chemical used to kill pests. A. In the U.S., over 700 active

I. Pesticides Definition: any chemical used to kill pests. A. In the U.S., over 700 active ingredients plus 1200 inert ingredients are mixed to make 50,000 individual pesticide products. I. Pesticides B. Types and Usage: TYPES Targets Percent

799 views • 48 slides
Domain Adaptation and Zero-Shot Learning Llus Castrejn CSC2523 Tutorial What is this? Game:

Domain Adaptation and Zero-Shot Learning Llus Castrejn CSC2523 Tutorial What is this? Game:

Domain Adaptation and Zero-Shot Learning Llus Castrejn CSC2523 Tutorial What is this? Game: Caption the following images using one short sentence. 2 / 46 What is this? 3 / 46 What is this? 4 / 46 What is this? 5 / 46 Current computer

1.03k views • 46 slides
2014 Cotton Update For Growers 1. Brake F2 2. 3. 4. 5. 6. 7. Section 18 Submitted: Brake F2

2014 Cotton Update For Growers 1. Brake F2 2. 3. 4. 5. 6. 7. Section 18 Submitted: Brake F2

2014 Cotton Update For Growers 1. Brake F2 2. 3. 4. 5. 6. 7. Section 18 Submitted: Brake F2 1. EPA should approve or reject by March 2. Mixture of fomesafen (Reflex) &amp; fluridone 3. Apply PRE 16 oz/A (8 oz Reflex + 0.2 lb Brake/A)

684 views • 41 slides
Nonspatial/Information Visualization Visualization http://www.ugrad.cs.ubc.ca/~cs314/Vjan2013 2

Nonspatial/Information Visualization Visualization http://www.ugrad.cs.ubc.ca/~cs314/Vjan2013 2

University of British Columbia CPSC 314 Computer Graphics Jan-Apr 2013 Tamara Munzner Nonspatial/Information Visualization Visualization http://www.ugrad.cs.ubc.ca/~cs314/Vjan2013 2 Reading Why Do Visualization? FCG Chap 27 pictures

390 views • 11 slides
LLVM - the early days Where did it come from, and how? Before LLVM September 1999 Tiger native

LLVM - the early days Where did it come from, and how? Before LLVM September 1999 Tiger native

LLVM - the early days Where did it come from, and how? Before LLVM September 1999 Tiger native compiler Directed study in compilers @ UofP: with Dr. Steven Vegdahl, Nick Forrette http://www.nondot.org/sabre/Projects/Compilers/ Tiger native

966 views • 79 slides

More recommend