-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmanuscrit.lof
95 lines (95 loc) · 5.25 KB
/
manuscrit.lof
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
\boolfalse {citerequest}\boolfalse {citetracker}\boolfalse {pagetracker}\boolfalse {backtracker}\relax
\defcounter {refsection}{0}\relax
\select@language {english}
\defcounter {refsection}{0}\relax
\select@language {french}
\defcounter {refsection}{0}\relax
\select@language {english}
\defcounter {refsection}{0}\relax
\addvspace {10\p@ }
\defcounter {refsection}{0}\relax
\contentsline {figure}{\numberline {1.1}{\ignorespaces Robot example\relax }}{1}
\defcounter {refsection}{0}\relax
\contentsline {figure}{\numberline {1.2}{\ignorespaces Particular configurations\relax }}{11}
\defcounter {refsection}{0}\relax
\addvspace {10\p@ }
\defcounter {refsection}{0}\relax
\contentsline {figure}{\numberline {2.1}{\ignorespaces A generic automaton for the robot behavior.\relax }}{23}
\defcounter {refsection}{0}\relax
\contentsline {figure}{\numberline {2.2}{\ignorespaces Scheduler automata.\relax }}{25}
\defcounter {refsection}{0}\relax
\contentsline {subfigure}{\numberline {(a)}{\ignorespaces {) Ssync model.}}}{25}
\defcounter {refsection}{0}\relax
\contentsline {subfigure}{\numberline {(b)}{\ignorespaces {) Async model.}}}{25}
\defcounter {refsection}{0}\relax
\contentsline {figure}{\numberline {2.3}{\ignorespaces Equivalent configurations\relax }}{29}
\defcounter {refsection}{0}\relax
\contentsline {figure}{\numberline {2.4}{\ignorespaces Symmetrical configurations\relax }}{29}
\defcounter {refsection}{0}\relax
\contentsline {figure}{\numberline {2.5}{\ignorespaces Other types of configurations\relax }}{30}
\defcounter {refsection}{0}\relax
\contentsline {figure}{\numberline {2.6}{\ignorespaces View\relax }}{33}
\defcounter {refsection}{0}\relax
\contentsline {figure}{\numberline {2.7}{\ignorespaces Automaton of robot $r$ on a ring.\relax }}{34}
\defcounter {refsection}{0}\relax
\contentsline {figure}{\numberline {2.8}{\ignorespaces System configurations equivalence.\relax }}{35}
\defcounter {refsection}{0}\relax
\contentsline {subfigure}{\numberline {(c)}{\ignorespaces Legend}}{35}
\defcounter {refsection}{0}\relax
\addvspace {10\p@ }
\defcounter {refsection}{0}\relax
\contentsline {figure}{\numberline {3.1}{\ignorespaces Illustration of the definitions.\relax }}{40}
\defcounter {refsection}{0}\relax
\contentsline {subfigure}{\numberline {(a)}{\ignorespaces {}}}{40}
\defcounter {refsection}{0}\relax
\contentsline {subfigure}{\numberline {(b)}{\ignorespaces {}}}{40}
\defcounter {refsection}{0}\relax
\contentsline {figure}{\numberline {3.2}{\ignorespaces Movement in a type $A$ configuration.\relax }}{43}
\defcounter {refsection}{0}\relax
\contentsline {figure}{\numberline {3.3}{\ignorespaces Tower-Creation phase from Set-Up final configurations.\relax }}{46}
\defcounter {refsection}{0}\relax
\contentsline {subfigure}{\numberline {(a)}{\ignorespaces {Set-Up final configurations.}}}{46}
\defcounter {refsection}{0}\relax
\contentsline {subfigure}{\numberline {(b)}{\ignorespaces {Tower-Completed configurations.}}}{46}
\defcounter {refsection}{0}\relax
\addvspace {10\p@ }
\defcounter {refsection}{0}\relax
\contentsline {figure}{\numberline {4.1}{\ignorespaces Counter-example.\relax }}{57}
\defcounter {refsection}{0}\relax
\contentsline {figure}{\numberline {4.2}{\ignorespaces Graph of Min-algorithm.\relax }}{60}
\defcounter {refsection}{0}\relax
\contentsline {figure}{\numberline {4.3}{\ignorespaces Lower convergence phase.\relax }}{61}
\defcounter {refsection}{0}\relax
\contentsline {figure}{\numberline {4.4}{\ignorespaces A step for the exploration.\relax }}{62}
\defcounter {refsection}{0}\relax
\addvspace {10\p@ }
\defcounter {refsection}{0}\relax
\contentsline {figure}{\numberline {5.1}{\ignorespaces A two player game with a reachability objective.\relax }}{75}
\defcounter {refsection}{0}\relax
\contentsline {figure}{\numberline {5.2}{\ignorespaces A part of the gathering arena for 4 robots in a 12 nodes ring.\relax }}{77}
\defcounter {refsection}{0}\relax
\contentsline {figure}{\numberline {5.3}{\ignorespaces Strategies from Uppaal Tiga.\relax }}{83}
\defcounter {refsection}{0}\relax
\contentsline {subfigure}{\numberline {(a)}{\ignorespaces {) Strategies for 3 robots on an 9-nodes ring.}}}{83}
\defcounter {refsection}{0}\relax
\contentsline {subfigure}{\numberline {(b)}{\ignorespaces {) Strategies for 3 robots on a ring of 10 nodes.}}}{83}
\defcounter {refsection}{0}\relax
\addvspace {10\p@ }
\defcounter {refsection}{0}\relax
\contentsline {figure}{\numberline {6.1}{\ignorespaces A partial observation game with a reachability objective\relax }}{90}
\defcounter {refsection}{0}\relax
\contentsline {figure}{\numberline {6.2}{\ignorespaces Example of a $V_a$ to $V_p$ transition from $a$ to $b$, normalized in $c$.\relax }}{95}
\defcounter {refsection}{0}\relax
\contentsline {subfigure}{\numberline {(d)}{\ignorespaces Legend}}{95}
\defcounter {refsection}{0}\relax
\contentsline {figure}{\numberline {6.3}{\ignorespaces Example of a tree constructed by \ref {algoSynth}\relax }}{98}
\defcounter {refsection}{0}\relax
\addvspace {10\p@ }
\defcounter {refsection}{0}\relax
\select@language {french}
\defcounter {refsection}{0}\relax
\addvspace {10\p@ }
\defcounter {refsection}{0}\relax
\contentsline {figure}{\numberline {A.1}{\ignorespaces Exemple d'applications pour robots mobiles\relax }}{115}
\defcounter {refsection}{0}\relax
\select@language {english}