second generation model based testing
play

Second Generation Model-based Testing Provably Strong Testing - PowerPoint PPT Presentation

CyPhyAssure Spring School Second Generation Model-based Testing Provably Strong Testing Methods for the Certification of Autonomous Systems Part II of III Provably Strong Testing Methods for Autonomous Systems Jan Peleska University of Bremen


  1. CyPhyAssure Spring School Second Generation Model-based Testing Provably Strong Testing Methods for the Certification of Autonomous Systems Part II of III – Provably Strong Testing Methods for Autonomous Systems Jan Peleska University of Bremen and Verified Systems International GmbH peleska@uni-bremen.de 2019-03-21

  2. A Development Approach – the Basis for Model- based Testing

  3. Typical architecture of an autonomous system Wardzi ń ski A. (2008) Safety Assurance Strategies for Autonomous Vehicles. In: Harrison M.D., Sujan MA. (eds) Computer Safety, Reliability, and Security. SAFECOMP 2008. Lecture Notes in Computer Science, vol 5219. Springer, Berlin, Heidelberg

  4. Identify applicable scenario from finite library of pre-definined parametrised scenarios Wardzi ń ski A. (2008) Safety Assurance Strategies for Autonomous Vehicles. In: Harrison M.D., Sujan MA. (eds) Computer Safety, Reliability, and Security. SAFECOMP 2008. Lecture Notes in Computer Science, vol 5219. Springer, Berlin, Heidelberg

  5. Scheduling of risk mitigation actions and mission accomplishment Wardzi ń ski A. (2008) Safety Assurance Strategies for Autonomous Vehicles. In: Harrison M.D., Sujan MA. (eds) Computer Safety, Reliability, and Security. SAFECOMP 2008. Lecture Notes in Computer Science, vol 5219. Springer, Berlin, Heidelberg

  6. Safety objective. Select optimal behavioural strategy that keeps risks at acceptable level, while optimising the mission reachability, as long as safety permits Wardzi ń ski A. (2008) Safety Assurance Strategies for Autonomous Vehicles. In: Harrison M.D., Sujan MA. (eds) Computer Safety, Reliability, and Security. SAFECOMP 2008. Lecture Notes in Computer Science, vol 5219. Springer, Berlin, Heidelberg

  7. Scene . Snapshot of tra ffi c and environment constellations Situation . Scene experienced from the perspective of one tra ffi c participant – the SUT Scenario . A transition system whose computations are physically consistent sequences of situations Events/actions trigger transitions between situations – either increasing or lowering the risk Wardzi ń ski A. (2008) Safety Assurance Strategies for Autonomous Vehicles. In: Harrison M.D., Sujan MA. (eds) Computer Safety, Reliability, and Security. SAFECOMP 2008. Lecture Notes in Computer Science, vol 5219. Springer, Berlin, Heidelberg

  8. Design Restrictions • To ensure constant worst-case execution time boundaries … • … only a bounded number of scenarios is admissible (no synthesis of new scenarios during runtime) • … only a bounded number of risk mitigation strategies are admissible (no learning of new mitigation strategies during runtime)

  9. Design Workflow and MBT-Test Preparation Scenario Identification Hardi Hungar: Scenario-Based Validation of Automated Driving Systems. ISoLA (3) 2018: 449-460 Ulbrich, S., et al.: Defining and substantiating the terms scene, Mario Gleirscher, Stefan Kugele: 
 situation and scenario for automated driving. From Hazard Analysis to Hazard Mitigation Planning: In: IEEE International Annual Conference on Intelligent The Automated Driving Case. CoRR abs/1802.08327 (2018) Transportation Systems (ITSC) (2015)

  10. For each scenario, … Scenario Hazard Analysis Identification Numerous publications, e.g. Mario Gleirscher: Hazard Analysis for Technical Systems. SWQD 2013: 104-124 Important research direction for autonomous systems Runtime hazard identification instead of handling pre-specified hazards only

  11. For each scenario, … Scenario Hazard Mitigation Hazard Analysis Identification Strategy Incremental elaboration Risk Structure Mario Gleirscher, Stefan Kugele: 
 From Hazard Analysis to Hazard Mitigation Planning: The Automated Driving Case. CoRR abs/1802.08327 (2018)

  12. For each scenario, … Scenario Hazard Mitigation Hazard Analysis Identification Strategy Risk structure is created on Risk Structure abstraction Risk State Space: hazard-related predicates p H 1 , …, p H m Abstract State Space: predicates p 1 ( v 1 , …, v n ), …, p k ( v k 1 , …) CPS State Space: variables v 1 , …, v n Physical World

  13. Finite State Machine or a/0 SysML State Machine or q1 b/1 Kripke Structure or b/0 q0 CSP model or a/0,b/1 a/1 RoboChart or … q2 For each scenario, … Safety Monitor – Scenario Hazard Mitigation Hazard Analysis Behavioural Identification Strategy Model Risk Structure

  14. Safety Monitor triggers a/0 mitigation actions for risk minimisation q1 b/1 b/0 q0 a/0,b/1 a/1 q2 For each scenario, … Safety Monitor – Scenario Hazard Mitigation Hazard Analysis Behavioural Identification Strategy Model Risk Structure

  15. Example . Creating a CSP Model for a Scenario- specific Safety Monitor

  16. Scenario. Red car overtakes ego vehicle (blue car) and swerves into right lane 1 Blue: Ego Vehicle 2 3

  17. ⃗ ⃗ ⃗ ⃗ ⃗ ⃗ Variables if the CPS state space (scenario-independent) Sensor data and actuator data (no further details shown) t Time x blue Position of blue car x red Position of red car Speed of blue car v blue v red Speed of red car a blue Acceleration of blue car a red Acceleration of red car

  18. ⃗ ⃗ ⃗ ⃗ ⃗ ⃗ ⃗ ⃗ ⃗ ⃗ Variables in the abstract state space (“predicate space”) d − 2 , d − 1 , d 0 , d 1 , d 2 Relative distance thresholds red car/blue car -2 : “red car is far behind blue car”, -1 : “close behind” 0 : “next to” 1 : “close in front” 2 : “far in front” d − 2 ≡ ∥ x blue − x red ∥ > δ far ∧ pr 1 ( x blue ) − pr 1 ( x red ) > 0 … d 0 ≡ ∥ x blue − x red ∥ < ε … d 2 ≡ ∥ x blue − x red ∥ > δ far ∧ pr 1 ( x blue ) − pr 1 ( x red ) < 0

  19. ⃗ ⃗ ⃗ ⃗ Variables in the abstract state space (“predicate space”) v − , v 0 , v + Relative speed thresholds red car/blue car - : “red car is much slower than blue car”, 0 : “red and blue car have the same speed” 1 : “red car is faster than blue car” v − ≡∥ v blue − v red ∥ > σ ∧ pr 1 ( v blue − v red ) > 0 …

  20. ⃗ ⃗ ⃗ Variables in the abstract state space (“predicate space”) Blue car and red car, respectively, are ℓ blue , ℓ red , r blue , r red , s blue , s red in left lane / right lane / continue straight r red ≡ pr 2 ( x red ) < mid … Blue car and red car change to R blue , L blue , R red , L red the right lane or in the left lane, respectively v red R red ≡ pr 2 ( v red ∥ ) < − γ < 0 ∥ …

  21. ⃗ Variables in the abstract state space (“predicate space”) Ego vehicle (blue car) accelerates in driving direction a − 2 , a − 1 , a 0 , a 1 , a 2 -2: maximal brake force (negative acceleration) -1: normal brake force 0: no acceleration 1: normal acceleration 2: maximal acceleration a − 2 ≡ ∥ a blue ∥≤ a min < 0 …

  22. Variables in the hazard space (“predicate space”) Hazard h 1 . h 1 ≡ ℓ red ∧ r blue ∧ d 0 ∧ R red The red car is in the left lane, the blue car is in the right lane, the cars are very close to each other, the red car is swerving into the right lane 3

  23. Result of hazard mitigation strategy: refined hazard Mario Gleirscher, Stefan Kugele: 
 From Hazard Analysis to Hazard Mitigation Planning: The Automated Driving Case. CoRR abs/1802.08327 (2018) Hazard h 1.1 . h 1.1 ≡ ℓ red ∧ r blue ∧ d 0 ∧ R red ∧ v − The red car is in the left lane, the blue car is in the right lane, the cars are very close to each other, the red car is swerving into the right lane, the red car is much slower than the blue car Admissible mitigation action . Maximal acceleration of blue car 3

  24. Result of hazard mitigation strategy: refined hazard h 1.2 ≡ ℓ red ∧ r blue ∧ d 0 ∧ R red ∧ v 0 Hazard h 1.2 . The red car is in the left lane, the blue car is in the right lane, the cars are very close to each other, the red car is swerving into the right lane, the red car has same speed as the blue car Admissible mitigation actions . (1) Brake blue car with maximal force (2) Maximal acceleration of blue car 3

  25. Result of hazard mitigation strategy: refined hazard Hazard h 1.3 . h 1.3 ≡ ℓ red ∧ r blue ∧ d 0 ∧ R red ∧ v + The red car is in the left lane, the blue car is in the right lane, the cars are very close to each other, the red car is swerving into the right lane, the red car is faster than the blue car Admissible mitigation action . Brake blue car with maximal force 3

  26. Derive Safety Monitor Model from Hazard Mitigation Analysis Objectives for the safety monitor 1. Input predicates from the predicate state space 2. In hazard states, enforce hazard mitigation actions obtained from risk structure 3. Optimal mitigation actions force system into “acceptable risk corridor” and still allow for mission completion Inputs to safety monitor – Outputs of safety monitor – from predicate state space from predicate state space R blue , L blue d − 2 , d − 1 , d 0 , d 1 , d 2 a − 2 , a − 1 , a 0 , a 1 , a 2 v − , v 0 , v + ℓ blue , ℓ red , r blue , r red , s blue , s red R red , L red

  27. Interplay Between Mission Planning and Safety Monitor Predicate space data relevant for mission planning Mission Planning R plan blue , L plan blue a plan − 2 , a plan − 1 , a plan , a plan , a plan 0 1 2 d − 2 , d − 1 , d 0 , d 1 , d 2 v − , v 0 , v + Safety Monitor ℓ blue , ℓ red , r blue , r red , s blue , s red R red , L red R blue , L blue a − 2 , a − 1 , a 0 , a 1 , a 2

Recommend


More recommend