Upgrade to Pro — share decks privately, control downloads, hide ads and more …

Verification of i-score Using Timed Automata

E49d1bfa9f9443686cbb9b4aaf6298af?s=47 Jaime Arias Almeida
May 06, 2015
Research
0
22

Verification of i-score Using Timed Automata

E49d1bfa9f9443686cbb9b4aaf6298af?s=128

Jaime Arias Almeida

May 06, 2015
Tweet

More Decks by Jaime Arias Almeida

See All by Jaime Arias Almeida
E49d1bfa9f9443686cbb9b4aaf6298af?s=48 himito
0
6
E49d1bfa9f9443686cbb9b4aaf6298af?s=48 himito
1
48
E49d1bfa9f9443686cbb9b4aaf6298af?s=48 himito
1
34
E49d1bfa9f9443686cbb9b4aaf6298af?s=48 himito
0
91
E49d1bfa9f9443686cbb9b4aaf6298af?s=48 himito
0
75
E49d1bfa9f9443686cbb9b4aaf6298af?s=48 himito
0
31
E49d1bfa9f9443686cbb9b4aaf6298af?s=48 himito
1
67
E49d1bfa9f9443686cbb9b4aaf6298af?s=48 himito
0
79
E49d1bfa9f9443686cbb9b4aaf6298af?s=48 himito
0
130

Other Decks in Research

See All in Research
C612ab39597a17ba5948cae54d13f99f?s=48 mkimura
0
100
C29f097d23f8904532ca088ac23ce801?s=48 kayceesrk
2
3.5k
91b77d9a98b86e27838b183407270bc0?s=48 supikiti
0
220
77e8bd47ec598a4717eb61b21917f363?s=48 flankerhqd
2
2.8k
931bf827a9410634647b1b71f863555c?s=48 highlow
0
400
C3bc10b8a72ed3c3bfd843793b8a9868?s=48 s3_seminar
0
160
Be0f86176276318b4b9775d795278f7e?s=48 yushiku
3
3.6k
588cbb64aaebe393fcdb3e05c1e34d6c?s=48 yuawn
1
110
A658ec7f1badf73819dfa501165016c1?s=48 yuukit
0
860
Cab798ff74597f6784c628b4119bbd2f?s=48 scwuaptx
1
1.9k
A182964bc0a261a5fc8bb207d660c743?s=48 diracdiego
1
760
9f29b4c9b76c81994553982244957ccf?s=48 future_tamaki
0
620

Featured

See All Featured
A0517b08532aec8ab2aae3f65d40ad86?s=48 hannesfritz
27
930
0c6fd6a08d0f898159cda7cafcacf07f?s=48 afnizarnur
176
14k
719435d98d452de7ac367c828266cf01?s=48 erikaheidi
13
4.2k
D83926c323d4f9289f947b4b4e76b939?s=48 jensimmons
207
10k
06f8b41980eb4c577fa40c41d5030c19?s=48 keathley
18
650
F716e5f737fcfb03f2cf8d1a184f1dbe?s=48 nonsquared
81
3.3k
Be9caeb9d4ef9944d151af909063ed6e?s=48 samlambert
237
9.9k
C44e1f7e22c3f23cff7bc130871047ef?s=48 eileencodes
113
25k
651dcfe41723207fbb0aa044a4f7c07f?s=48 dotmariusz
94
5.1k
C157b16234f1e75e8eac3698c1d4414a?s=48 ddemaree
274
31k
Fde6c3a50ca518a909ef35c22c0ee0e4?s=48 destraynor
146
19k
C1daf20e5c49ff910745198ef9869ac2?s=48 hatefulcrawdad
257
17k

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