Mobile Calculi
-
Upload
dempster-maximiliano -
Category
Documents
-
view
34 -
download
0
description
Transcript of Mobile Calculi
![Page 1: Mobile Calculi](https://reader035.fdocuments.us/reader035/viewer/2022062321/568132b2550346895d996bdb/html5/thumbnails/1.jpg)
Mobile Calculi
Prof. Diletta Romana Cacciagrano
![Page 2: Mobile Calculi](https://reader035.fdocuments.us/reader035/viewer/2022062321/568132b2550346895d996bdb/html5/thumbnails/2.jpg)
Some expressiveness results
![Page 3: Mobile Calculi](https://reader035.fdocuments.us/reader035/viewer/2022062321/568132b2550346895d996bdb/html5/thumbnails/3.jpg)
Expressiveness
In general, in order to compare the expressive power of two languages, we look for the existence/non existence of an encoding with certain properties among these languages.
What is a good notion of encoding to be used as a basis to measure the relative expressive power?
In general we would be happy with an encoding L1 L2 being:
![Page 4: Mobile Calculi](https://reader035.fdocuments.us/reader035/viewer/2022062321/568132b2550346895d996bdb/html5/thumbnails/4.jpg)
A good notion of encoding
Compositional w.r.t. the operators
(Preferably) homomorphic w.r.t. parallel (distribution-preserving)
![Page 5: Mobile Calculi](https://reader035.fdocuments.us/reader035/viewer/2022062321/568132b2550346895d996bdb/html5/thumbnails/5.jpg)
A good notion of encoding
Preserving some kind of semantics. Here there are several possibilities:
• Preserving observables
• Preserving equivalence (This is one of the most popular requirements for an encoding)
![Page 6: Mobile Calculi](https://reader035.fdocuments.us/reader035/viewer/2022062321/568132b2550346895d996bdb/html5/thumbnails/6.jpg)
A good notion of encoding
(Preferably) the encoding should not introduce divergences (tau-loops), in the sense that if in the original process all the computations converge, then the same holds for its translation.
Note that weak bisimulations are insensitive w.r.t. divergences.
![Page 7: Mobile Calculi](https://reader035.fdocuments.us/reader035/viewer/2022062321/568132b2550346895d996bdb/html5/thumbnails/7.jpg)
Expressiveness: Process mobility as name mobility
![Page 8: Mobile Calculi](https://reader035.fdocuments.us/reader035/viewer/2022062321/568132b2550346895d996bdb/html5/thumbnails/8.jpg)
Expressiveness: Process mobility as name mobility
![Page 9: Mobile Calculi](https://reader035.fdocuments.us/reader035/viewer/2022062321/568132b2550346895d996bdb/html5/thumbnails/9.jpg)
Expressiveness: Polyadic as monadic
![Page 10: Mobile Calculi](https://reader035.fdocuments.us/reader035/viewer/2022062321/568132b2550346895d996bdb/html5/thumbnails/10.jpg)
Expressiveness: Replication vs recursion
![Page 11: Mobile Calculi](https://reader035.fdocuments.us/reader035/viewer/2022062321/568132b2550346895d996bdb/html5/thumbnails/11.jpg)
Expressiveness: Replication vs recursion
|
Theorem:
![Page 12: Mobile Calculi](https://reader035.fdocuments.us/reader035/viewer/2022062321/568132b2550346895d996bdb/html5/thumbnails/12.jpg)
Expressiveness: Data (Boolean) as processes
|
||*
![Page 13: Mobile Calculi](https://reader035.fdocuments.us/reader035/viewer/2022062321/568132b2550346895d996bdb/html5/thumbnails/13.jpg)
Expressiveness: Synchrony as asynchrony(Boudol’s Encoding)
Boudol (1992) provided the following encoding of Pi (without choice) into asynchronous Pi.
The idea is to force both partners to proceed only when it is sure that the communication can take place, by using a sort of rendez-vous protocol.
![Page 14: Mobile Calculi](https://reader035.fdocuments.us/reader035/viewer/2022062321/568132b2550346895d996bdb/html5/thumbnails/14.jpg)
Expressiveness: Synchrony as asynchrony(Boudol’s Encoding)
![Page 15: Mobile Calculi](https://reader035.fdocuments.us/reader035/viewer/2022062321/568132b2550346895d996bdb/html5/thumbnails/15.jpg)
Honda-Tokoro (1992) defined the following encoding of Pi (without choice) into asynchronous Pi, in which the communication protocol takes two steps instead than three.
The idea is to let the receiver take the initiative (instead than the sender).
Expressiveness: Synchrony as asynchrony(Honda and Tokoro’s Encoding)
![Page 16: Mobile Calculi](https://reader035.fdocuments.us/reader035/viewer/2022062321/568132b2550346895d996bdb/html5/thumbnails/16.jpg)
Expressiveness: Synchrony as asynchrony(Honda and Tokoro’s Encoding)
![Page 17: Mobile Calculi](https://reader035.fdocuments.us/reader035/viewer/2022062321/568132b2550346895d996bdb/html5/thumbnails/17.jpg)
Honda proved this encoding sound and “almost” complete w.r.t. a certain logical semantics.
Expressiveness: Synchrony as asynchrony(Honda and Tokoro’s Encoding)
![Page 18: Mobile Calculi](https://reader035.fdocuments.us/reader035/viewer/2022062321/568132b2550346895d996bdb/html5/thumbnails/18.jpg)
Expressiveness: Synchrony as asynchrony and Testing semantics
We don’t expect the encodings the encodings of output prefix to be correct w.r.t. testing semantics (why?) but we would like the encoding to satisfy at least the following property:
where can be
![Page 19: Mobile Calculi](https://reader035.fdocuments.us/reader035/viewer/2022062321/568132b2550346895d996bdb/html5/thumbnails/19.jpg)
Expressiveness: Synchrony as asynchrony and Testing semantics
The encoding of Boudol and Honda-Tokoro preserve may and fair semantics, but not must semantics, i.e.
![Page 20: Mobile Calculi](https://reader035.fdocuments.us/reader035/viewer/2022062321/568132b2550346895d996bdb/html5/thumbnails/20.jpg)
Expressiveness: Synchrony as asynchrony and Testing semantics
Theorem [Cacciagrano, Corradini, Palamidessi, 2004]:
Let an encoding of Pi-calculus (without choice) into asynchronous Pi-calculus such that
• compositional w.r.t. prefixes• there exists P such that P diverges Then does not preserve must testing.
![Page 21: Mobile Calculi](https://reader035.fdocuments.us/reader035/viewer/2022062321/568132b2550346895d996bdb/html5/thumbnails/21.jpg)
Expressiveness: Synchrony as asynchrony and Testing semantics
The problem, however, is uniquely a problem of fairness.
Theorem [Cacciagrano, Corradini, Palamidessi, 2004]:
The encodings of Boudol and of Honda-Tokoro
• preserve must testing if we restrict to fair computations only.• preserve a version of must testing called fair-must testing.
![Page 22: Mobile Calculi](https://reader035.fdocuments.us/reader035/viewer/2022062321/568132b2550346895d996bdb/html5/thumbnails/22.jpg)
The Pi-calculus hierarchy