Verification of i-score Using Timed Automata

Transcript

1. Verification of i-score Using Timed Automata Jaime ARIAS, Myriam DESAINTE-CATHERINE,

   and Camilo RUEDA Laboratoire Bordelais de Recherche en Informatique (LaBRI) Université de Bordeaux PoSET Seminar Bordeaux, May 2015 1 
   

2. Temporal Relation t ≤ γ0 t ≤ γ1 idle wait_min

   skipped finished killed flexible semi flexible t ≥ 0, event_s?, {t = 0} true, skip_p?, ∅ true, skip!, {t = 0} true, event_e2!, {t = 0} true, kill!, {t = 0} true, kill_p?, ∅ true, kill_p?, ∅ true, event _i?, ∅ true, kill_p?, ∅ true, event _i?, ∅ t = γ1 , τ, ∅ true, kill_ p?, ∅ t = γ0 ∧ finite = false, event_e1!, ∅ t = γ0 ∧ finite = true, event_e1 !, ∅ time (s) 0 1 2 3 4 5 6 Texture A Texture B γ0 = 8 γ1 = 24 finite = true t = 0 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 1/5 1 /5

3. Temporal Relation t ≤ γ0 t ≤ γ1 idle wait_min

   skipped finished killed flexible semi flexible t ≥ 0, event_s?, {t = 0} true, skip_p?, ∅ true, skip!, {t = 0} true, event_e2!, {t = 0} true, kill!, {t = 0} true, kill_p?, ∅ true, kill_p?, ∅ true, event _i?, ∅ true, kill_p?, ∅ true, event _i?, ∅ t = γ1 , τ, ∅ true, kill_ p?, ∅ t = γ0 ∧ finite = false, event_e1!, ∅ t = γ0 ∧ finite = true, event_e1 !, ∅ time (s) 0 1 2 3 4 5 6 Texture A Texture B γ0 = 8 γ1 = 24 finite = true t = 4 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 1/5 1 /5

4. Temporal Relation t ≤ γ0 t ≤ γ1 idle wait_min

   skipped finished killed flexible semi flexible t ≥ 0, event_s?, {t = 0} true, skip_p?, ∅ true, skip!, {t = 0} true, event_e2!, {t = 0} true, kill!, {t = 0} true, kill_p?, ∅ true, kill_p?, ∅ true, event _i?, ∅ true, kill_p?, ∅ true, event _i?, ∅ t = γ1 , τ, ∅ true, kill_ p?, ∅ t = γ0 ∧ finite = false, event_e1!, ∅ t = γ0 ∧ finite = true, event_e1 !, ∅ time (s) 0 1 2 3 4 5 6 Texture A Texture B γ0 = 8 γ1 = 24 finite = true t = 8 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 1/5 1 /5

5. Temporal Relation t ≤ γ0 t ≤ γ1 idle wait_min

   skipped finished killed flexible semi flexible t ≥ 0, event_s?, {t = 0} true, skip_p?, ∅ true, skip!, {t = 0} true, event_e2!, {t = 0} true, kill!, {t = 0} true, kill_p?, ∅ true, kill_p?, ∅ true, event _i?, ∅ true, kill_p?, ∅ true, event _i?, ∅ t = γ1 , τ, ∅ true, kill_ p?, ∅ t = γ0 ∧ finite = false, event_e1!, ∅ t = γ0 ∧ finite = true, event_e1 !, ∅ time (s) 0 1 2 3 4 5 6 Texture A Texture B γ0 = 8 γ1 = 24 finite = true t = 12 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 1/5 1 /5

6. Temporal Relation t ≤ γ0 t ≤ γ1 idle wait_min

   skipped finished killed flexible semi flexible t ≥ 0, event_s?, {t = 0} true, skip_p?, ∅ true, skip!, {t = 0} true, event_e2!, {t = 0} true, kill!, {t = 0} true, kill_p?, ∅ true, kill_p?, ∅ true, event _i?, ∅ true, kill_p?, ∅ true, event _i?, ∅ t = γ1 , τ, ∅ true, kill_ p?, ∅ t = γ0 ∧ finite = false, event_e1!, ∅ t = γ0 ∧ finite = true, event_e1 !, ∅ time (s) 0 1 2 3 4 5 6 Texture A Texture B γ0 = 8 γ1 = 24 finite = true t = 16 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 1/5 1 /5

7. Temporal Relation t ≤ γ0 t ≤ γ1 idle wait_min

   skipped finished killed flexible semi flexible t ≥ 0, event_s?, {t = 0} true, skip_p?, ∅ true, skip!, {t = 0} true, event_e2!, {t = 0} true, kill!, {t = 0} true, kill_p?, ∅ true, kill_p?, ∅ true, event _i?, ∅ true, kill_p?, ∅ true, event _i?, ∅ t = γ1 , τ, ∅ true, kill_ p?, ∅ t = γ0 ∧ finite = false, event_e1!, ∅ t = γ0 ∧ finite = true, event_e1 !, ∅ time (s) 0 1 2 3 4 5 6 Texture A Texture B γ0 = 8 γ1 = 24 finite = true t = 20 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 1/5 1 /5

8. Temporal Relation t ≤ γ0 t ≤ γ1 idle wait_min

   skipped finished killed flexible semi flexible t ≥ 0, event_s?, {t = 0} true, skip_p?, ∅ true, skip!, {t = 0} true, event_e2!, {t = 0} true, kill!, {t = 0} true, kill_p?, ∅ true, kill_p?, ∅ true, event _i?, ∅ true, kill_p?, ∅ true, event _i?, ∅ t = γ1 , τ, ∅ true, kill_ p?, ∅ t = γ0 ∧ finite = false, event_e1!, ∅ t = γ0 ∧ finite = true, event_e1 !, ∅ time (s) 0 1 2 3 4 5 6 Texture A Texture B γ0 = 8 γ1 = 24 finite = true t = 0 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 1/5 1 /5

9. Temporal Relation t ≤ γ0 t ≤ γ1 idle wait_min

   skipped finished killed flexible semi flexible t ≥ 0, event_s?, {t = 0} true, skip_p?, ∅ true, skip!, {t = 0} true, event_e2!, {t = 0} true, kill!, {t = 0} true, kill_p?, ∅ true, kill_p?, ∅ true, event _i?, ∅ true, kill_p?, ∅ true, event _i?, ∅ t = γ1 , τ, ∅ true, kill_ p?, ∅ t = γ0 ∧ finite = false, event_e1!, ∅ t = γ0 ∧ finite = true, event_e1 !, ∅ time (s) 0 1 2 3 4 5 6 Texture A Texture B γ0 = 8 γ1 = 24 finite = true t = 4 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 1/5 1 /5

10. Temporal Relation t ≤ γ0 t ≤ γ1 idle wait_min

    skipped finished killed flexible semi flexible t ≥ 0, event_s?, {t = 0} true, skip_p?, ∅ true, skip!, {t = 0} true, event_e2!, {t = 0} true, kill!, {t = 0} true, kill_p?, ∅ true, kill_p?, ∅ true, event _i?, ∅ true, kill_p?, ∅ true, event _i?, ∅ t = γ1 , τ, ∅ true, kill_ p?, ∅ t = γ0 ∧ finite = false, event_e1!, ∅ t = γ0 ∧ finite = true, event_e1 !, ∅ time (s) 0 1 2 3 4 5 6 Texture A Texture B γ0 = 8 γ1 = 24 finite = true t = 8 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 1/5 1 /5

11. Temporal Relation t ≤ γ0 t ≤ γ1 idle wait_min

    skipped finished killed flexible semi flexible t ≥ 0, event_s?, {t = 0} true, skip_p?, ∅ true, skip!, {t = 0} true, event_e2!, {t = 0} true, kill!, {t = 0} true, kill_p?, ∅ true, kill_p?, ∅ true, event _i?, ∅ true, kill_p?, ∅ true, event _i?, ∅ t = γ1 , τ, ∅ true, kill_ p?, ∅ t = γ0 ∧ finite = false, event_e1!, ∅ t = γ0 ∧ finite = true, event_e1 !, ∅ time (s) 0 1 2 3 4 5 6 Texture A Texture B γ0 = 8 γ1 = 24 finite = true t = 12 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 1/5 1 /5

12. Temporal Relation t ≤ γ0 t ≤ γ1 idle wait_min

    skipped finished killed flexible semi flexible t ≥ 0, event_s?, {t = 0} true, skip_p?, ∅ true, skip!, {t = 0} true, event_e2!, {t = 0} true, kill!, {t = 0} true, kill_p?, ∅ true, kill_p?, ∅ true, event _i?, ∅ true, kill_p?, ∅ true, event _i?, ∅ t = γ1 , τ, ∅ true, kill_ p?, ∅ t = γ0 ∧ finite = false, event_e1!, ∅ t = γ0 ∧ finite = true, event_e1 !, ∅ time (s) 0 1 2 3 4 5 6 Texture A Texture B γ0 = 8 γ1 = 24 finite = true t = 16 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 1/5 1 /5

13. Temporal Relation t ≤ γ0 t ≤ γ1 idle wait_min

    skipped finished killed flexible semi flexible t ≥ 0, event_s?, {t = 0} true, skip_p?, ∅ true, skip!, {t = 0} true, event_e2!, {t = 0} true, kill!, {t = 0} true, kill_p?, ∅ true, kill_p?, ∅ true, event _i?, ∅ true, kill_p?, ∅ true, event _i?, ∅ t = γ1 , τ, ∅ true, kill_ p?, ∅ t = γ0 ∧ finite = false, event_e1!, ∅ t = γ0 ∧ finite = true, event_e1 !, ∅ time (s) 0 1 2 3 4 5 6 Texture A Texture B γ0 = 8 γ1 = 24 finite = true t = 20 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 1/5 1 /5

14. Temporal Relation t ≤ γ0 t ≤ γ1 idle wait_min

    skipped finished killed flexible semi flexible t ≥ 0, event_s?, {t = 0} true, skip_p?, ∅ true, skip!, {t = 0} true, event_e2!, {t = 0} true, kill!, {t = 0} true, kill_p?, ∅ true, kill_p?, ∅ true, event _i?, ∅ true, kill_p?, ∅ true, event _i?, ∅ t = γ1 , τ, ∅ true, kill_ p?, ∅ t = γ0 ∧ finite = false, event_e1!, ∅ t = γ0 ∧ finite = true, event_e1 !, ∅ time (s) 0 1 2 3 4 5 6 Texture A Texture B γ0 = 8 γ1 = 24 finite = true t = 24 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 1/5 1 /5

15. Temporal Relation t ≤ γ0 t ≤ γ1 idle wait_min

    skipped finished killed flexible semi flexible t ≥ 0, event_s?, {t = 0} true, skip_p?, ∅ true, skip!, {t = 0} true, event_e2!, {t = 0} true, kill!, {t = 0} true, kill_p?, ∅ true, kill_p?, ∅ true, event _i?, ∅ true, kill_p?, ∅ true, event _i?, ∅ t = γ1 , τ, ∅ true, kill_ p?, ∅ t = γ0 ∧ finite = false, event_e1!, ∅ t = γ0 ∧ finite = true, event_e1 !, ∅ time (s) 0 1 2 3 4 5 6 Texture A Texture B γ0 = 8 γ1 = 24 finite = true t = 0 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 1/5 1 /5

16. Temporal Relation t ≤ γ0 t ≤ γ1 idle wait_min

    skipped finished killed flexible semi flexible t ≥ 0, event_s?, {t = 0} true, skip_p?, ∅ true, skip!, {t = 0} true, event_e2!, {t = 0} true, kill!, {t = 0} true, kill_p?, ∅ true, kill_p?, ∅ true, event _i?, ∅ true, kill_p?, ∅ true, event _i?, ∅ t = γ1 , τ, ∅ true, kill_ p?, ∅ t = γ0 ∧ finite = false, event_e1!, ∅ t = γ0 ∧ finite = true, event_e1 !, ∅ time (s) 0 1 2 3 4 5 6 Texture A Texture B γ0 = 8 γ1 = 24 finite = true t = 0 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 1/5 1 /5

17. Temporal Relation t ≤ γ0 t ≤ γ1 idle wait_min

    skipped finished killed flexible semi flexible t ≥ 0, event_s?, {t = 0} true, skip_p?, ∅ true, skip!, {t = 0} true, event_e2!, {t = 0} true, kill!, {t = 0} true, kill_p?, ∅ true, kill_p?, ∅ true, event _i?, ∅ true, kill_p?, ∅ true, event _i?, ∅ t = γ1 , τ, ∅ true, kill_ p?, ∅ t = γ0 ∧ finite = false, event_e1!, ∅ t = γ0 ∧ finite = true, event_e1 !, ∅ time (s) 0 1 2 3 4 5 6 Texture A Texture B γ0 = 8 γ1 = 24 finite = true t = 0 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 1/5 1 /5

18. Temporal Relation t ≤ γ0 t ≤ γ1 idle wait_min

    skipped finished killed flexible semi flexible t ≥ 0, event_s?, {t = 0} true, skip_p?, ∅ true, skip!, {t = 0} true, event_e2!, {t = 0} true, kill!, {t = 0} true, kill_p?, ∅ true, kill_p?, ∅ true, event _i?, ∅ true, kill_p?, ∅ true, event _i?, ∅ t = γ1 , τ, ∅ true, kill_ p?, ∅ t = γ0 ∧ finite = false, event_e1!, ∅ t = γ0 ∧ finite = true, event_e1 !, ∅ time (s) 0 1 2 3 4 5 6 Texture A Texture B γ0 = 8 γ1 = 24 finite = true t = 0 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 1/5 1 /5

19. Temporal Relation t ≤ γ0 t ≤ γ1 idle wait_min

    skipped finished killed flexible semi flexible t ≥ 0, event_s?, {t = 0} true, skip_p?, ∅ true, skip!, {t = 0} true, event_e2!, {t = 0} true, kill!, {t = 0} true, kill_p?, ∅ true, kill_p?, ∅ true, event _i?, ∅ true, kill_p?, ∅ true, event _i?, ∅ t = γ1 , τ, ∅ true, kill_ p?, ∅ t = γ0 ∧ finite = false, event_e1!, ∅ t = γ0 ∧ finite = true, event_e1 !, ∅ time (s) 0 1 2 3 4 5 6 Texture A Texture B γ0 = 8 γ1 = 24 finite = true t = 0 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 1/5 1 /5

20. Temporal Relation Handling Intervals idle error finished true, event_s2 ,

    ∅ true, kill_p?, ∅ true, skip_p?, {counter + +} true, event_s1 ?, {counter + +, skip_v = false} counter < n, τ, ∅ counter = n ∧ skip_v = false, event_e!, ∅ counter = n ∧ skip_v = true, skip!, ∅ time 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 min max TR 2 min max TR 1 min max interaction point n = 2 skipv = true counter = 0 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 2/5 2 /5

21. Temporal Relation Handling Intervals idle error finished true, event_s2 ,

    ∅ true, kill_p?, ∅ true, skip_p?, {counter + +} true, event_s1 ?, {counter + +, skip_v = false} counter < n, τ, ∅ counter = n ∧ skip_v = false, event_e!, ∅ counter = n ∧ skip_v = true, skip!, ∅ time 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 min max TR 2 min max TR 1 min max interaction point n = 2 skipv = true counter = 0 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 2/5 2 /5

22. Temporal Relation Handling Intervals idle error finished true, event_s2 ,

    ∅ true, kill_p?, ∅ true, skip_p?, {counter + +} true, event_s1 ?, {counter + +, skip_v = false} counter < n, τ, ∅ counter = n ∧ skip_v = false, event_e!, ∅ counter = n ∧ skip_v = true, skip!, ∅ time 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 min max TR 2 min max TR 1 min max interaction point n = 2 skipv = true counter = 0 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 2/5 2 /5

23. Temporal Relation Handling Intervals idle error finished true, event_s2 ,

    ∅ true, kill_p?, ∅ true, skip_p?, {counter + +} true, event_s1 ?, {counter + +, skip_v = false} counter < n, τ, ∅ counter = n ∧ skip_v = false, event_e!, ∅ counter = n ∧ skip_v = true, skip!, ∅ time 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 min max TR 2 min max TR 1 min max interaction point n = 2 skipv = true counter = 0 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 2/5 2 /5

24. Temporal Relation Handling Intervals idle error finished true, event_s2 ,

    ∅ true, kill_p?, ∅ true, skip_p?, {counter + +} true, event_s1 ?, {counter + +, skip_v = false} counter < n, τ, ∅ counter = n ∧ skip_v = false, event_e!, ∅ counter = n ∧ skip_v = true, skip!, ∅ time 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 min max TR 2 min max TR 1 min max interaction point n = 2 skipv = true counter = 0 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 2/5 2 /5

25. Temporal Relation Handling Intervals idle error finished true, event_s2 ,

    ∅ true, kill_p?, ∅ true, skip_p?, {counter + +} true, event_s1 ?, {counter + +, skip_v = false} counter < n, τ, ∅ counter = n ∧ skip_v = false, event_e!, ∅ counter = n ∧ skip_v = true, skip!, ∅ time 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 min max TR 2 min max TR 1 min max interaction point n = 2 skipv = true counter = 0 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 2/5 2 /5

26. Temporal Relation Handling Intervals idle error finished true, event_s2 ,

    ∅ true, kill_p?, ∅ true, skip_p?, {counter + +} true, event_s1 ?, {counter + +, skip_v = false} counter < n, τ, ∅ counter = n ∧ skip_v = false, event_e!, ∅ counter = n ∧ skip_v = true, skip!, ∅ time 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 min max TR 2 min max TR 1 min max interaction point n = 2 skipv = true counter = 0 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 2/5 2 /5

27. Temporal Relation Handling Intervals idle error finished true, event_s2 ,

    ∅ true, kill_p?, ∅ true, skip_p?, {counter + +} true, event_s1 ?, {counter + +, skip_v = false} counter < n, τ, ∅ counter = n ∧ skip_v = false, event_e!, ∅ counter = n ∧ skip_v = true, skip!, ∅ time 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 min max TR 2 min max TR 1 min max interaction point n = 2 skipv = true counter = 0 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 2/5 2 /5

28. Temporal Relation Handling Intervals idle error finished true, event_s2 ,

    ∅ true, kill_p?, ∅ true, skip_p?, {counter + +} true, event_s1 ?, {counter + +, skip_v = false} counter < n, τ, ∅ counter = n ∧ skip_v = false, event_e!, ∅ counter = n ∧ skip_v = true, skip!, ∅ time 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 min max TR 2 min max TR 1 min max interaction point n = 2 skipv = false counter = 1 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 2/5 2 /5

29. Temporal Relation Handling Intervals idle error finished true, event_s2 ,

    ∅ true, kill_p?, ∅ true, skip_p?, {counter + +} true, event_s1 ?, {counter + +, skip_v = false} counter < n, τ, ∅ counter = n ∧ skip_v = false, event_e!, ∅ counter = n ∧ skip_v = true, skip!, ∅ time 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 min max TR 2 min max TR 1 min max interaction point n = 2 skipv = false counter = 1 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 2/5 2 /5

30. Temporal Relation Handling Intervals idle error finished true, event_s2 ,

    ∅ true, kill_p?, ∅ true, skip_p?, {counter + +} true, event_s1 ?, {counter + +, skip_v = false} counter < n, τ, ∅ counter = n ∧ skip_v = false, event_e!, ∅ counter = n ∧ skip_v = true, skip!, ∅ time 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 min max TR 2 min max TR 1 min max interaction point n = 2 skipv = false counter = 1 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 2/5 2 /5

31. Temporal Relation Handling Intervals idle error finished true, event_s2 ,

    ∅ true, kill_p?, ∅ true, skip_p?, {counter + +} true, event_s1 ?, {counter + +, skip_v = false} counter < n, τ, ∅ counter = n ∧ skip_v = false, event_e!, ∅ counter = n ∧ skip_v = true, skip!, ∅ time 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 min max TR 2 min max TR 1 min max interaction point n = 2 skipv = false counter = 2 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 2/5 2 /5

32. Temporal Relation Handling Intervals idle error finished true, event_s2 ,

    ∅ true, kill_p?, ∅ true, skip_p?, {counter + +} true, event_s1 ?, {counter + +, skip_v = false} counter < n, τ, ∅ counter = n ∧ skip_v = false, event_e!, ∅ counter = n ∧ skip_v = true, skip!, ∅ time 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 min max TR 2 min max TR 1 min max interaction point n = 2 skipv = false counter = 2 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 2/5 2 /5

33. Temporal Relation Handling Intervals idle error finished true, event_s2 ,

    ∅ true, kill_p?, ∅ true, skip_p?, {counter + +} true, event_s1 ?, {counter + +, skip_v = false} counter < n, τ, ∅ counter = n ∧ skip_v = false, event_e!, ∅ counter = n ∧ skip_v = true, skip!, ∅ time 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 min max TR 2 min max TR 1 min max interaction point n = 2 skipv = false counter = 2 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 2/5 2 /5

34. Temporal Relation Handling Intervals idle error finished true, event_s2 ,

    ∅ true, kill_p?, ∅ true, skip_p?, {counter + +} true, event_s1 ?, {counter + +, skip_v = false} counter < n, τ, ∅ counter = n ∧ skip_v = false, event_e!, ∅ counter = n ∧ skip_v = true, skip!, ∅ time 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 min max TR 2 min max TR 1 min max interaction point n = 2 skipv = false counter = 2 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 2/5 2 /5

35. Temporal Relation Handling Intervals idle error finished true, event_s2 ,

    ∅ true, kill_p?, ∅ true, skip_p?, {counter + +} true, event_s1 ?, {counter + +, skip_v = false} counter < n, τ, ∅ counter = n ∧ skip_v = false, event_e!, ∅ counter = n ∧ skip_v = true, skip!, ∅ time 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 min max TR 2 min max TR 1 min max interaction point n = 2 skipv = false counter = 2 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 2/5 2 /5

36. Temporal Relation Handling Intervals idle error finished true, event_s2 ,

    ∅ true, kill_p?, ∅ true, skip_p?, {counter + +} true, event_s1 ?, {counter + +, skip_v = false} counter < n, τ, ∅ counter = n ∧ skip_v = false, event_e!, ∅ counter = n ∧ skip_v = true, skip!, ∅ time 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 min max TR 2 min max TR 1 min max interaction point n = 2 skipv = false counter = 2 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 2/5 2 /5

37. Temporal Relation Handling Intervals idle error finished true, event_s2 ,

    ∅ true, kill_p?, ∅ true, skip_p?, {counter + +} true, event_s1 ?, {counter + +, skip_v = false} counter < n, τ, ∅ counter = n ∧ skip_v = false, event_e!, ∅ counter = n ∧ skip_v = true, skip!, ∅ time 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 min max TR 2 min max TR 1 min max interaction point n = 2 skipv = false counter = 2 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 2/5 2 /5

38. Temporal Relation Handling Intervals idle error finished true, event_s2 ,

    ∅ true, kill_p?, ∅ true, skip_p?, {counter + +} true, event_s1 ?, {counter + +, skip_v = false} counter < n, τ, ∅ counter = n ∧ skip_v = false, event_e!, ∅ counter = n ∧ skip_v = true, skip!, ∅ time 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 min max TR 2 min max TR 1 min max interaction point n = 2 skipv = false counter = 2 Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 2/5 2 /5

39. Interaction Points idle finished skipped enabled timeout cond = true

    true, skip_p?, ∅ en = false, event_e?, ∅ true, event_s?, {en = true} en = true, event_ e?, ∅ true, kill_p?, ∅ true, skip!, ∅ true, kill_p?, ∅ urg = true, event_t!, ∅ urg = false, skip!, ∅ true, event?, {cond = condition()} true, event_t!, {en = false} true, event_ e!, ∅ time 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 min max TR 2 min max TR 1 min max interaction point urg =true en =true cond =false Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 3/5 3 /5

40. Interaction Points idle finished skipped enabled timeout cond = true

    true, skip_p?, ∅ en = false, event_e?, ∅ true, event_s?, {en = true} en = true, event_ e?, ∅ true, kill_p?, ∅ true, skip!, ∅ true, kill_p?, ∅ urg = true, event_t!, ∅ urg = false, skip!, ∅ true, event?, {cond = condition()} true, event_t!, {en = false} true, event_ e!, ∅ time 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 min max TR 2 min max TR 1 min max interaction point urg =true en =true cond =false Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 3/5 3 /5

41. Interaction Points idle finished skipped enabled timeout cond = true

    true, skip_p?, ∅ en = false, event_e?, ∅ true, event_s?, {en = true} en = true, event_ e?, ∅ true, kill_p?, ∅ true, skip!, ∅ true, kill_p?, ∅ urg = true, event_t!, ∅ urg = false, skip!, ∅ true, event?, {cond = condition()} true, event_t!, {en = false} true, event_ e!, ∅ time 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 min max TR 2 min max TR 1 min max interaction point urg =true en =true cond =false Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 3/5 3 /5

42. Interaction Points idle finished skipped enabled timeout cond = true

    true, skip_p?, ∅ en = false, event_e?, ∅ true, event_s?, {en = true} en = true, event_ e?, ∅ true, kill_p?, ∅ true, skip!, ∅ true, kill_p?, ∅ urg = true, event_t!, ∅ urg = false, skip!, ∅ true, event?, {cond = condition()} true, event_t!, {en = false} true, event_ e!, ∅ time 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 min max TR 2 min max TR 1 min max interaction point urg =true en =true cond =false Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 3/5 3 /5

43. Interaction Points idle finished skipped enabled timeout cond = true

    true, skip_p?, ∅ en = false, event_e?, ∅ true, event_s?, {en = true} en = true, event_ e?, ∅ true, kill_p?, ∅ true, skip!, ∅ true, kill_p?, ∅ urg = true, event_t!, ∅ urg = false, skip!, ∅ true, event?, {cond = condition()} true, event_t!, {en = false} true, event_ e!, ∅ time 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 min max TR 2 min max TR 1 min max interaction point urg =true en =true cond =false Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 3/5 3 /5

44. Interaction Points idle finished skipped enabled timeout cond = true

    true, skip_p?, ∅ en = false, event_e?, ∅ true, event_s?, {en = true} en = true, event_ e?, ∅ true, kill_p?, ∅ true, skip!, ∅ true, kill_p?, ∅ urg = true, event_t!, ∅ urg = false, skip!, ∅ true, event?, {cond = condition()} true, event_t!, {en = false} true, event_ e!, ∅ time 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 min max TR 2 min max TR 1 min max interaction point urg =true en =true cond =false Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 3/5 3 /5

45. Interaction Points idle finished skipped enabled timeout cond = true

    true, skip_p?, ∅ en = false, event_e?, ∅ true, event_s?, {en = true} en = true, event_ e?, ∅ true, kill_p?, ∅ true, skip!, ∅ true, kill_p?, ∅ urg = true, event_t!, ∅ urg = false, skip!, ∅ true, event?, {cond = condition()} true, event_t!, {en = false} true, event_ e!, ∅ time 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 min max TR 2 min max TR 1 min max interaction point urg =true en =true cond =false Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 3/5 3 /5

46. Interaction Points idle finished skipped enabled timeout cond = true

    true, skip_p?, ∅ en = false, event_e?, ∅ true, event_s?, {en = true} en = true, event_ e?, ∅ true, kill_p?, ∅ true, skip!, ∅ true, kill_p?, ∅ urg = true, event_t!, ∅ urg = false, skip!, ∅ true, event?, {cond = condition()} true, event_t!, {en = false} true, event_ e!, ∅ time 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 min max TR 2 min max TR 1 min max interaction point urg =true en =true cond =false Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 3/5 3 /5

47. Interaction Points idle finished skipped enabled timeout cond = true

    true, skip_p?, ∅ en = false, event_e?, ∅ true, event_s?, {en = true} en = true, event_ e?, ∅ true, kill_p?, ∅ true, skip!, ∅ true, kill_p?, ∅ urg = true, event_t!, ∅ urg = false, skip!, ∅ true, event?, {cond = condition()} true, event_t!, {en = false} true, event_ e!, ∅ time 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 min max TR 2 min max TR 1 min max interaction point urg =true en =true cond =false Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 3/5 3 /5

48. Multimedia Processes Brightness 100% 50% 30% 0% p0 p1 p2

    p3 p4 p5 p6 ∆1 ∆2 ∆3 ∆4 ∆5 ∆6 typedef struct { int value; int offset; } parameter_t; parameter_t process_brightness[7] = { {0,0}, {30,5}, {50,2}, ... }; idle finished wait t ≤ mp[i].offset t ≥ 0, start?, {t = 0, i = 0} true, kill_p?, {t = 0} true, skip_p?, {t = 0} true, kill_ p?, {t = 0} true, stop?, {t = 0} t = m p[i].offset ∧ i = lim it, send!, {data = m p[i].value,t = 0} t = mp[i].offset ∧ i < limit, send!, {t = 0, data = mp[i].value, i + +} Arias, Desainte-Catherine, and Rueda (LaBRI) Verification of i-score Using Timed Automata 4/5 4 /5

49. Thank you!

50. Verification of i-score Using Timed Automata Jaime ARIAS, Myriam DESAINTE-CATHERINE,

    and Camilo RUEDA Laboratoire Bordelais de Recherche en Informatique (LaBRI) Université de Bordeaux PoSET Seminar Bordeaux, May 2015 1