From asynchronous to synchronous specifications for distributed - - PowerPoint PPT Presentation

from asynchronous to synchronous specifications for
SMART_READER_LITE
LIVE PREVIEW

From asynchronous to synchronous specifications for distributed - - PowerPoint PPT Presentation

From asynchronous to synchronous specifications for distributed program synthesis From asynchronous to synchronous specifications for distributed program synthesis David Janin LaBRI, Bordeaux University 21st January 2008 From asynchronous to


slide-1
SLIDE 1

From asynchronous to synchronous specifications for distributed program synthesis

From asynchronous to synchronous specifications for distributed program synthesis

David Janin

LaBRI, Bordeaux University

21st January 2008

slide-2
SLIDE 2

From asynchronous to synchronous specifications for distributed program synthesis Overview of the talk

Outlines

Synchronous vs asynchronous behaviors Sequential Program synthesis Distributed Program synthesis More on the decidable case (hierarchical game)

slide-3
SLIDE 3

From asynchronous to synchronous specifications for distributed program synthesis Overview of the talk

Outlines

Synchronous vs asynchronous behaviors Sequential Program synthesis Distributed Program synthesis More on the decidable case (hierarchical game)

slide-4
SLIDE 4

From asynchronous to synchronous specifications for distributed program synthesis Overview of the talk

Outlines

Synchronous vs asynchronous behaviors Sequential Program synthesis Distributed Program synthesis More on the decidable case (hierarchical game)

slide-5
SLIDE 5

From asynchronous to synchronous specifications for distributed program synthesis Overview of the talk

Outlines

Synchronous vs asynchronous behaviors Sequential Program synthesis Distributed Program synthesis More on the decidable case (hierarchical game)

slide-6
SLIDE 6

From asynchronous to synchronous specifications for distributed program synthesis Synchronous vs asynchronous behaviors

Distributed process

slide-7
SLIDE 7

From asynchronous to synchronous specifications for distributed program synthesis Synchronous vs asynchronous behaviors

Synchronous behaviors

Processes hand shake at every step !

slide-8
SLIDE 8

From asynchronous to synchronous specifications for distributed program synthesis Synchronous vs asynchronous behaviors

Asynchronous behaviors

Processes receive mails in mail boxes !

slide-9
SLIDE 9

From asynchronous to synchronous specifications for distributed program synthesis Synchronous vs asynchronous behaviors

A meta result

Observation

When mailboxes are of bounded size, asynchronous behaviors are (essentially) synchronous !

slide-10
SLIDE 10

From asynchronous to synchronous specifications for distributed program synthesis Synchronous vs asynchronous behaviors

A question

Asynchronism in program synthesis

In the setting of distribuetd program synthesis, can we expect a similar reduction of asynchronous problems into synchronous one ? The answer is yes as I’ll show you !

slide-11
SLIDE 11

From asynchronous to synchronous specifications for distributed program synthesis Synchronous vs asynchronous behaviors

A question

Asynchronism in program synthesis

In the setting of distribuetd program synthesis, can we expect a similar reduction of asynchronous problems into synchronous one ? The answer is yes as I’ll show you !

slide-12
SLIDE 12

From asynchronous to synchronous specifications for distributed program synthesis Sequential Program synthesis

A wandering process

Goal : the process (player) needs to find his way.

slide-13
SLIDE 13

From asynchronous to synchronous specifications for distributed program synthesis Sequential Program synthesis

The wandering (simple) rules

slide-14
SLIDE 14

From asynchronous to synchronous specifications for distributed program synthesis Sequential Program synthesis

but with uncontrollable environment moves

The Wanderer against the Tour operator

slide-15
SLIDE 15

From asynchronous to synchronous specifications for distributed program synthesis Sequential Program synthesis

The wandering (real) game

slide-16
SLIDE 16

From asynchronous to synchronous specifications for distributed program synthesis Distributed Program synthesis

n against 1 distributed game

  • Each process only sees his own local states.
  • Environment may or may not transmit (depending on his allowed

moves).

slide-17
SLIDE 17

From asynchronous to synchronous specifications for distributed program synthesis Distributed Program synthesis

Synchronous scenarios

slide-18
SLIDE 18

From asynchronous to synchronous specifications for distributed program synthesis Distributed Program synthesis

Asynchronous scenarios

slide-19
SLIDE 19

From asynchronous to synchronous specifications for distributed program synthesis Distributed Program synthesis

Encoding async. into sync. (1)

slide-20
SLIDE 20

From asynchronous to synchronous specifications for distributed program synthesis Distributed Program synthesis

Encoding async. into sync. (2)

slide-21
SLIDE 21

From asynchronous to synchronous specifications for distributed program synthesis Distributed Program synthesis

Main results

Theorem

For any finite distibuted game G there is a synchronous finite distributed game H such processes do have a finite state winning distributed strategy in G if and only if they have a finite state distributed strategy in H.

slide-22
SLIDE 22

From asynchronous to synchronous specifications for distributed program synthesis More on the decidable case (hierarchical game)

And what about decidability issues ? The reduction from asynchronous to synchronous games may break structural decidability properties !

slide-23
SLIDE 23

From asynchronous to synchronous specifications for distributed program synthesis More on the decidable case (hierarchical game)

Hierarchical game

  • Each process sees the local states of all processes on his right.
slide-24
SLIDE 24

From asynchronous to synchronous specifications for distributed program synthesis More on the decidable case (hierarchical game)

Known and new results

Theorem (Peterson and Reif, 80s)

Finite distributed game are undecidable (even Σ1

1-complete) but

finite distributed hierarchical games are decidable !

Theorem

Reduction of distributed game to synchronous distributed game can be adapted to the hierarchical case so that decidability is preserved.

slide-25
SLIDE 25

From asynchronous to synchronous specifications for distributed program synthesis Conclusion

Welcome in Bordeaux from the 21st to the 23rd february