• Aucun résultat trouvé

Distributed verification with LoLA

N/A
N/A
Protected

Academic year: 2022

Partager "Distributed verification with LoLA"

Copied!
10
0
0

Texte intégral

(1)

!"# $% &

%

# '

( )***+ ! ,-"

" . /0,"#

Æ

1 Æ 2# $ (

( Æ # 0

3 4# !

%

# $5

% #

% %&

# 6

%%

( #

%% #

.%

# $

#

0 !7,8"

9 # $ &

&# $

9 # $

%

(

% #

%

&% 1 2

# 6

(2)

#

(5 :

% # ;

5 & &4# ;

%# <

&

# ; :

#

# &

( #

#

;

# = %

>0,?"#

# $

1 2

% %# $

%

(

#

%

# 12

@

0 A

$ 5 A

$ 67.

1 2 $.B.

# 0 Æ

# % CC'

!DD" 67. %Æ

$.B. ( #

' # '

# D

# $

% "E

"E # ' 1 2

#

# $:

: # (

#

1 ( 9 2# C

FE

½

# '

(3)

F#

5

#

5

# $ G

# $ 1 2

& # $ #

$ # $

#

00 00 00 00 11 11 11 11

00 00 00 00 11 11 11 11

00 00 00 00 00 11 11 11 11 11

000 000 000 000 000 111 111 111 111 111

00 00 00 11 11 11

00 00 11 11

00 00 00 11 11 11

000 000 111 111

00 00 11 11

000 000 000 111 111 111

000 000 111 111

00 00 00 00 00 11 11 11 11 11

000 000 111 111 00 00 11 11 000 000 000 111 111 111

true

process 1

process 2

process 3

process 4

<-@' +# 7

D-# .-

1DDD-2# .? 1D-DD2 1D--D2# .H

1--DD21--D-2# .+1----2#

#

# ' 5 #

' #

) # $

@

A

A

1

2A

$:

# <

#

(4)

# $ 4

%

# $

E

5

% 1

% 2#

! <# ?#

I%I

1 2

#

000 000 000 000 000 111 111 111 111 111

000 000 000 000 000 111 111 111 111 111

00 00 00 00 11 11 11 11

00 00 00 00 00 11 11 11 11 11

000 000 111 111

00 00 00 11 11 11

000 000 000 000 000 111 111 111 111 111

000 000 000 000 000 111 111 111 111 111

000 000 111 111 00 00 00 11 11 11

000 000 000 111 111 111

000 000 000 000 111 111 111 111

000 000 111 111

000 000 000 000 111 111 111 111

000 000 111 111

00 00 00 11 11 11 00 00 00 11 11 11

000 000 111 111

00 00 00 00 00 11 11 11 11 11

00 00 00 00 00 11 11 11 11 11 0000000000000 0000000000000 0000000000000 1111111111111 1111111111111 1111111111111

0000000000000 0000000000000 1111111111111 1111111111111

0000000000000 0000000000000 1111111111111

1111111111111 0000000000000 0000000000000 1111111111111 1111111111111

true true

true true

< ?@ C

#

#

(5)

$ && #

J

#

# <

&& (

G # $

3

#

( #

!&& #'! 'K)

: # &

# ! 'K)

#

#

7 C J'$ #

'7 C J'$ : 12#

(

G # 7 C J'$

# 7 C J'$

#

! 'K)

( #

# $

#

E1 : 2

# =

#

# # <

%

#

# (

( #

(

# C

G

G

# !

#

7 C J'$

E

#

C

#

#

7 C J'$ %# $

#

5

(6)

# C # $

5

#

5

7 C J'$

# ' 7 C J'$

#

C #

$ %# $ 7 C J'$

! 'K) # $

%# $

7 C J'$ #

! 'K) + ! 'K)

% 7 C J'$ #

5 %

# $ # 6

7 C J'$

7 C J'$ 7 C J'$

# ' %

7 C J'$ #

000 000 000 000 111 111 111 111

SEARCH -->

Case 3

00 00 00 00 00 11 11 11 11 11

000 000 111 111

00 00 00 11 11 11 000 000 111 111

00 00 11 11

0000000000000 0000000000000 1111111111111 1111111111111

000 000 000 111 111 111

true Case 4 DELEGATE

Case 2 insert locally or DELEGATE arbitrarily

Case 1 do nothing (depth 3) -->

< H@ K ! 'K)(

$! 'K)

# -? # H+

# C E D ! 'K)

7 C J'$ # $

# H ED

1 2 D (

# < +

7 C J'$

#

7 C J'$

#

(7)

5

# )

! 'K)B7 C J'$

-#

#

# $

# $ % %?

! 'K) # $(

%

% # '

7 C J'$

7 C J'$

#

1 2

! 'K)#

1

2#

(! 'K)7 C J'$

(

1 2#

' <# ?#

1--DD23

1 D

-2# $ D# H

! 'K) : 1 2# $

% 1

# $ 7 C J'$

- %# C %

1 H 1--DD2 2# (

7 C J'$ H # $

# =

1--DD2 (#

'

1-DDD2# ' ! 'K)

7 C J'$ % # C %

-1 1-DDD2 #

% #

1-DDD2 1-DDD2

(# 7 C J'$

- H# $

D# - 7 C J'$

# '

% %

<# +# $

#

(8)

00 00 00 00 00 11 11 11 11 11

00 00 00 00 11 11 11 11

00 00 00 11 11 11

00 00 11 11

00 00 11 11

000 000 000 000 000 111 111 111 111 111

00 00 11 11

000 000 111 111 00 00 11 11

000 000 111 111

000 000 000 000 111 111 111 111

000 000 000 000 000 111 111 111 111 111

000 000 111 111 00 00

11 11 000 000 111 111

0000000000000 0000000000000 1111111111111 1111111111111 0000000000000

0000000000000 1111111111111

1111111111111 true true

< +@ = 1-DDD2

% <# ?#

: # $ (

%

#

' &

# ;

# ' 1 2

# # )

# $

%

: 1

2#

#

# $

# 7 # $

# ! 5

(

4 #

6 5

( # '5

# ;

# $5

(I I #

% (

# $( 7 C J'$

! 'K) #

(9)

(#

$ # !

Æ

# $

#

(

9 &

# ! (

# # ! &

(

#

#

% % -D0> -DD0>

Æ (

#

( #

( #

$

1 2

( #

' -DDD

?,,8DD? H,,8DDD#

% # ; %-L!6=%

L# $ -L

#

!

>0,?" *# K# > 0# % / C# 00# !

%@ -D

¾¼

#

,1?2*-,,?#

!" 0#% #0# '#.#! #' &

& #

!! "!! #1?2@?++

M?H'-,#

)***+" )'#**/#*# $

M # $ %&'( "%

#''?-LM?HH-,+#

/0," K# 0# / K# # 0# . # )

## -+8M-,L0-,,#

!DD" /#! #CM:#

("%#'* +LM+8+?DDD#

!7,8" 6#! 7#C#7# .: #

+,("%#* ?LM?8-,,8#

(10)

#@?,+MHDH-,,-#

" '# # #

&-./

%(+-,#

" 0#N# .## ' & &

# --- # "! #0

HH?MH++-,#

Références

Documents relatifs

Colle les lettres au bon endroit pour reconstituer les noms des animaux qu’ont rencontrés Lola, Olga et Ollie au fil de leurs aventures... Lola cherche ses bottes

Whatever the protocol to be monitored (global one or projection) and the framework (JADE or Jason), a monitor keeps track of the runtime evolution of the protocol by saving its

Convergence properties are then defined by mixing two dimensions: (i) number of faulty nodes in a run, with the two extreme cases of global (no faulty node) vs partial (at least

There are also some distinct promising concepts of parallel code execution, such as the futures concept (packages future and future.batchjobs) for running independent jobs on

Its time constraints are expressed as bounded intervals to model the uncertainty of the delay in migration and communication of agents placed in the locations of a distributed

This section also explains how different monitoring configurations are re- alised, including orchestrated, centralised and choreography based monitoring, by letting distributed L

We define a class of certifying distributed algorithm that terminate and verify their distributed input-output pair at runtime by a distributed witness such that the

The coordinator constructs the synchronisation graph, coordinates the differ- ent worker processes and determines the termination of the modular state space construction, while