Upgrade to Pro
— share decks privately, control downloads, hide ads and more …
Speaker Deck
Speaker Deck
PRO
Sign in
Sign up for free
Verification of i-score Using Timed Automata
Jaime Arias Almeida
May 06, 2015
Research
0
50
Verification of i-score Using Timed Automata
Jaime Arias Almeida
May 06, 2015
Tweet
Share
More Decks by Jaime Arias Almeida
See All by Jaime Arias Almeida
Hybrid Parallel Model Checking of Hybrid LTL on Hybrid State Space Representation
himito
0
24
25 Years - AVISPA: Specification and Verification of Interactive Multimedia Systems
himito
0
14
Continuous Integration & Deployment
himito
1
38
Hunting Moby Dick: An introduction to Docker at LIPN
himito
1
85
Git: A Distributed Revision Control System
himito
1
77
Hunting Moby Dick: An Introduction to Docker
himito
0
110
PyHRF: A Python Library for the Analysis of fMRI Data Based on Local Estimation of Hemodynamic Response Function
himito
0
99
A tree-based Operational Semantics for Interactive Multimedia Scores
himito
0
40
Github in practice
himito
1
75
Other Decks in Research
See All in Research
Offline Time-Independent Multi-Agent Path Planning
kei18
0
120
ICSE22: An Exploratory Study of Deep Learning Supply Chain
sunflowerpku
0
320
Navigation for a team of agents
kei18
0
370
PLDI '21論文読み会: Specification Synthesis with Constrainted Horn Clauses
ideininc
0
840
第2回『帰ってきたウルトラマン』勉強会〜ヤマトで生きるウチナンチュ上原正三〜
hirokundayon
0
110
まちづくりのデジタル_トランスフォーメーション実現ビジョン_ver1.0.pdf
toshiseisaku
0
5k
汎用音響信号表現の発展について@TokyoBISHBash#07
daisukelab_cs
0
230
DeNA, MoT AI勉強会発表資料「顔認識と最近のArcFaceまわりと」 / Face Recognition & ArcFace papers
takarasawa_
4
2.3k
Generating a Pairwise Dataset for Click-through Rate Prediction of News Articles Considering Positions and Contents
upura
0
140
アノテーションのバイアス排除に関する2020年代の研究動向
kuri8ive
1
490
蓄電池経済効果シミュレーションを提示するとお客さんは販売会社を信頼するか?購入意欲はアップするか?最新調査結果
satoru_higuchi
0
2.1k
PLDI '21論文読み会: DNNFusion: Accelerating Deep Neural Networks Execution with Advanced Operator Fusion
ideininc
0
900
Featured
See All Featured
Responsive Adventures: Dirty Tricks From The Dark Corners of Front-End
smashingmag
237
19k
No one is an island. Learnings from fostering a developers community.
thoeni
9
1.3k
"I'm Feeling Lucky" - Building Great Search Experiences for Today's Users (#IAC19)
danielanewman
212
20k
Designing with Data
zakiwarfel
91
4k
CoffeeScript is Beautiful & I Never Want to Write Plain JavaScript Again
sstephenson
151
13k
How New CSS Is Changing Everything About Graphic Design on the Web
jensimmons
213
11k
Bootstrapping a Software Product
garrettdimon
296
110k
RailsConf & Balkan Ruby 2019: The Past, Present, and Future of Rails at GitHub
eileencodes
119
28k
ピンチをチャンスに:未来をつくるプロダクトロードマップ #pmconf2020
aki_i
25
15k
How to Ace a Technical Interview
jacobian
267
21k
The Art of Programming - Codeland 2020
erikaheidi
32
11k
Producing Creativity
orderedlist
PRO
334
37k
Transcript
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
Thank you!
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