SlideShare a Scribd company logo
1 of 86
Download to read offline
A Compositional Encoding of the Asynchronous
       π-Calculus into the Join-Calculus

Stephan Mennicke†          Tobias Prehn‡         Tsvetelina Yonova-Karbe‡

        Institute for Programming and Reactive Systems, TU Braunschweig†
 Institute for Software Engineering and Theoretical Computer Science, TU Berlin‡


                            September 3, 2012
                            YR-CONCUR 2012
WraP – Writing and Publishing a Scientific Paper




                                             Supervision by Uwe Nestmann and
                                             Kirstin Peters




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join     YR-CONCUR 2012   2 / 15
Scope of Interest


   Asynchronous π (πa )                                    Join-Calculus




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join      YR-CONCUR 2012   3 / 15
Scope of Interest


   Asynchronous π (πa )                                           Join-Calculus

               P |Q                 Parallelism                          P |Q
                xv                      Send                             xv

             x(w).P                   Receive              def x w | o     P in . . . | o
            x(w)∗ .P                 Recursion                 def x w     P in . . .
         x(w).P | x v            Communication                def x w      P in x v




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join             YR-CONCUR 2012     3 / 15
Scope of Interest


   Asynchronous π (πa )                                           Join-Calculus

               P |Q                 Parallelism                          P |Q
                xv                      Send                             xv

             x(w).P                   Receive              def x w | o     P in . . . | o
            x(w)∗ .P                 Recursion                 def x w     P in . . .
         x(w).P | x v            Communication                def x w      P in x v

                                    Restriction




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join             YR-CONCUR 2012     3 / 15
Scope of Interest


   Asynchronous π (πa )                                           Join-Calculus

               P |Q                 Parallelism                          P |Q
                xv                      Send                             xv

             x(w).P                   Receive              def x w | o     P in . . . | o
            x(w)∗ .P                 Recursion                 def x w     P in . . .
         x(w).P | x v            Communication                def x w      P in x v
    (νx)(x(w).P | x v )             Restriction




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join             YR-CONCUR 2012     3 / 15
Scope of Interest


   Asynchronous π (πa )                                           Join-Calculus

               P |Q                 Parallelism                          P |Q
                xv                      Send                             xv

             x(w).P                   Receive              def x w | o     P in . . . | o
            x(w)∗ .P                 Recursion                 def x w     P in . . .
         x(w).P | x v            Communication                def x w      P in x v
    (νx)(x(w).P | x v )             Restriction               def x w      P in x v




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join             YR-CONCUR 2012     3 / 15
Scope of Interest


   Asynchronous π (πa )                                           Join-Calculus

               P |Q                 Parallelism                          P |Q
                xv                      Send                             xv

             x(w).P                   Receive              def x w | o     P in . . . | o
            x(w)∗ .P                 Recursion                 def x w     P in . . .
         x(w).P | x v            Communication                def x w      P in x v
    (νx)(x(w).P | x v )             Restriction               def x w      P in x v




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join             YR-CONCUR 2012     3 / 15
Scope of Interest


                                             π
   Asynchronous π (πa )                      j                    Join-Calculus

               P |Q                 Parallelism                          P |Q
                xv                      Send                             xv

             x(w).P                   Receive              def x w | o     P in . . . | o
            x(w)∗ .P                 Recursion                 def x w     P in . . .
         x(w).P | x v            Communication                def x w      P in x v
    (νx)(x(w).P | x v )             Restriction               def x w      P in x v




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join             YR-CONCUR 2012     3 / 15
An Encoding is Non-Trivial




                                 |
          no (νx)
                                     xv
          x(w)




 S. Mennicke (TU Braunschweig)        Compositional πa ⇒ Join   YR-CONCUR 2012   4 / 15
An Encoding is Non-Trivial




                                 |
          no (νx)
                                     xv
          x(w)




 S. Mennicke (TU Braunschweig)        Compositional πa ⇒ Join   YR-CONCUR 2012   4 / 15
An Encoding is Non-Trivial




                                 |                               |
          no (νx)
                                     xv                                xv
          x(w)                                           def x




 S. Mennicke (TU Braunschweig)        Compositional πa ⇒ Join    YR-CONCUR 2012   4 / 15
An Encoding is Non-Trivial




                                 |                               |
          no (νx)
                                     xv                                xv
          x(w)                                           def x




 S. Mennicke (TU Braunschweig)        Compositional πa ⇒ Join    YR-CONCUR 2012   4 / 15
The Encoding of Fournet and Gonthier
[Fournet and Gonthier(1996)]


First Layer




Second Layer




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join   YR-CONCUR 2012   5 / 15
The Encoding of Fournet and Gonthier
[Fournet and Gonthier(1996)]


First Layer
      x v → xo v
      P |Q → P |Q




Second Layer




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join   YR-CONCUR 2012   5 / 15
The Encoding of Fournet and Gonthier
[Fournet and Gonthier(1996)]


First Layer
      x v → xo v
      P |Q → P |Q
      x(w).P → def κ             P in xi



Second Layer




 S. Mennicke (TU Braunschweig)       Compositional πa ⇒ Join   YR-CONCUR 2012   5 / 15
The Encoding of Fournet and Gonthier
[Fournet and Gonthier(1996)]


First Layer
      x v → xo v
      P |Q → P |Q
      x(w).P → def κ             P in xi
      (νx)P → def xi | xo κ in P

Second Layer




 S. Mennicke (TU Braunschweig)       Compositional πa ⇒ Join   YR-CONCUR 2012   5 / 15
The Encoding of Fournet and Gonthier
[Fournet and Gonthier(1996)]


First Layer
      x v → xo v
      P |Q → P |Q
      x(w).P → def κ             P in xi
      (νx)P → def xi | xo κ in P

Second Layer
      Restrict all free names




 S. Mennicke (TU Braunschweig)       Compositional πa ⇒ Join   YR-CONCUR 2012   5 / 15
The Encoding of Fournet and Gonthier
[Fournet and Gonthier(1996)]


First Layer
      x v → xo v
      P |Q → P |Q
      x(w).P → def κ              P in xi
      (νx)P → def xi | xo κ in P

Second Layer
      Restrict all free names



                                 Is this good?
 S. Mennicke (TU Braunschweig)        Compositional πa ⇒ Join   YR-CONCUR 2012   5 / 15
Gorla’s Criteria for Good Encodings                        [Gorla(2010)]




                                            .




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join               YR-CONCUR 2012   6 / 15
Gorla’s Criteria for Good Encodings                        [Gorla(2010)]




                                                 I. Compositionality




                                            .




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join               YR-CONCUR 2012   6 / 15
Gorla’s Criteria for Good Encodings                        [Gorla(2010)]




                                                 I. Compositionality




                                            .

                                                           II. Name Invariance




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join                YR-CONCUR 2012   6 / 15
Gorla’s Criteria for Good Encodings                        [Gorla(2010)]




                                                 I. Compositionality




                                                           Syntactic Criteria

                                            .

                                                            II. Name Invariance




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join                 YR-CONCUR 2012   6 / 15
Gorla’s Criteria for Good Encodings                             [Gorla(2010)]




                                                      I. Compositionality




                                                                Syntactic Criteria

                                                 .

                                                                 II. Name Invariance




                                 III. Operational Correspondence



 S. Mennicke (TU Braunschweig)        Compositional πa ⇒ Join                 YR-CONCUR 2012   6 / 15
Gorla’s Criteria for Good Encodings                             [Gorla(2010)]




                                                      I. Compositionality




                                                                Syntactic Criteria

                                                 .

              IV. Divergence Reflection                           II. Name Invariance




                                 III. Operational Correspondence



 S. Mennicke (TU Braunschweig)        Compositional πa ⇒ Join                 YR-CONCUR 2012   6 / 15
Gorla’s Criteria for Good Encodings                               [Gorla(2010)]




                         V. Success Sensitiveness       I. Compositionality




                                                                  Syntactic Criteria

                                                    .

              IV. Divergence Reflection                             II. Name Invariance




                                  III. Operational Correspondence



 S. Mennicke (TU Braunschweig)          Compositional πa ⇒ Join                 YR-CONCUR 2012   6 / 15
Gorla’s Criteria for Good Encodings                               [Gorla(2010)]




                         V. Success Sensitiveness       I. Compositionality




                                                                  Syntactic Criteria
               Semantic Criteria
                                                    .

              IV. Divergence Reflection                             II. Name Invariance




                                  III. Operational Correspondence



 S. Mennicke (TU Braunschweig)          Compositional πa ⇒ Join                 YR-CONCUR 2012   6 / 15
Fournet and Gonthier’s Encoding Revisited

      First level encoding is compositional and operationally correspondent
      for closed terms




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join   YR-CONCUR 2012   7 / 15
Fournet and Gonthier’s Encoding Revisited

      First level encoding is compositional and operationally correspondent
      for closed terms
      First level encoding is not operationally correspondent for open
      terms




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join   YR-CONCUR 2012   7 / 15
Fournet and Gonthier’s Encoding Revisited

      First level encoding is compositional and operationally correspondent
      for closed terms
      First level encoding is not operationally correspondent for open
      terms
      First+Second level encoding is not compositional




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join   YR-CONCUR 2012   7 / 15
Fournet and Gonthier’s Encoding Revisited

      First level encoding is compositional and operationally correspondent
      for closed terms
      First level encoding is not operationally correspondent for open
      terms
      First+Second level encoding is not compositional

Our Approach




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join   YR-CONCUR 2012   7 / 15
Fournet and Gonthier’s Encoding Revisited

      First level encoding is compositional and operationally correspondent
      for closed terms
      First level encoding is not operationally correspondent for open
      terms
      First+Second level encoding is not compositional

Our Approach
      We introduce send/receive requests carrying the channel names




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join   YR-CONCUR 2012   7 / 15
Fournet and Gonthier’s Encoding Revisited

      First level encoding is compositional and operationally correspondent
      for closed terms
      First level encoding is not operationally correspondent for open
      terms
      First+Second level encoding is not compositional

Our Approach
      We introduce send/receive requests carrying the channel names
      We keep the main idea of restriction




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join   YR-CONCUR 2012   7 / 15
Fournet and Gonthier’s Encoding Revisited

      First level encoding is compositional and operationally correspondent
      for closed terms
      First level encoding is not operationally correspondent for open
      terms
      First+Second level encoding is not compositional

Our Approach
      We introduce send/receive requests carrying the channel names
      We keep the main idea of restriction
      We implement a protocol to handle communication
      [Peters and Nestmann(2011)]




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join   YR-CONCUR 2012   7 / 15
Fournet and Gonthier’s Encoding Revisited

      First level encoding is compositional and operationally correspondent
      for closed terms
      First level encoding is not operationally correspondent for open
      terms
      First+Second level encoding is not compositional

Our Approach
      We introduce send/receive requests carrying the channel names
      We keep the main idea of restriction
      We implement a protocol to handle communication
      [Peters and Nestmann(2011)]
      We need matching to decide which requests may cooperate


 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join   YR-CONCUR 2012   7 / 15
The Big Picture

                                 π
         (1)            x v      j   =   def lf t, f | f alse      f | f alse in
         (2)                             def lt t, f | true       t | f alse in
         (3)                             def l t, f    lt t, f | lf t, f in sr x, v, l | true
                                 π
         (4)           P |Q      j   =   def rrτ c, k | trans0 m m c, k | trans0 m in
         (5)                             def chain trans0 | srτ c, v, l
         (6)                                def mup c, k | trans m m c, k | trans m in
         (7)                                def m c , k
         (8)                                   [c = c ]k v, l | mup c , k
         (9)                                 in trans0 m | chain trans
        (10)                              in chain trans0 |
        (11)                             def sr c, v, l srup c, v, l | srτ c, v, l in
        (12)                             def srup c, v, l sr c, v, l in
        (13)                             def rr c, k rrup c, k | rrτ c, k in
        (14)                             def rrup c, k rr c, k in
        (15)                               P π | Q π
                                               j         j
                                 π
        (16)         x(v).P      j   =   def k v, l | once
        (17)                                def t       P π in
                                                            j
        (18)                                def f      once in l t, f
        (19)                              in rr x, k | once
                                 π
        (20)          (νx)P      j   =   def x      0 in P π   j



 S. Mennicke (TU Braunschweig)            Compositional πa ⇒ Join              YR-CONCUR 2012   8 / 15
What our Encoding does

                         P = (νx)(y a | x(u).Q) | x b | y(z).R




 S. Mennicke (TU Braunschweig)      Compositional πa ⇒ Join      YR-CONCUR 2012   9 / 15
What our Encoding does

                         P = (νx)(y a | x(u).Q) | x b | y(z).R


                                                |


                          νx                                       |



                           |                                   x          y



                  y              x

 S. Mennicke (TU Braunschweig)       Compositional πa ⇒ Join           YR-CONCUR 2012   9 / 15
What our Encoding does

                         P = (νx)(y a | x(u).Q) | x b | y(z).R


                                                |


                          νx                                       |



                           |                             x     x          y      y




          y       y              x   x


 S. Mennicke (TU Braunschweig)       Compositional πa ⇒ Join           YR-CONCUR 2012   9 / 15
What our Encoding does

                         P = (νx)(y a | x(u).Q) | x b | y(z).R


                                                |


                          νx                                       |



                           |     y                       x     x          y      y




                  y              x   x


 S. Mennicke (TU Braunschweig)       Compositional πa ⇒ Join           YR-CONCUR 2012   9 / 15
What our Encoding does

                         P = (νx)(y a | x(u).Q) | x b | y(z).R


                                                |       y




                          νx                                        |



                           |     y                          x   x          y      y




                  y              x   x


 S. Mennicke (TU Braunschweig)       Compositional πa ⇒ Join            YR-CONCUR 2012   9 / 15
What our Encoding does

                         P = (νx)(y a | x(u).Q) | x b | y(z).R


                                                |       y




                          νx                                        |



                           |     y   x                      x   x          y      y




                  y              x

 S. Mennicke (TU Braunschweig)       Compositional πa ⇒ Join            YR-CONCUR 2012   9 / 15
What our Encoding does

                         P = (νx)(y a | x(u).Q) | x b | y(z).R


                                                |       y       x




                          νx                                            |



                           |     y   x                      x       x          y      y




                  y              x

 S. Mennicke (TU Braunschweig)       Compositional πa ⇒ Join                YR-CONCUR 2012   9 / 15
What our Encoding does

                         P = (νx)(y a | x(u).Q) | x b | y(z).R


                                                |       y




                          νx                                       |      x




                           |     y   x                         x          y      y




                  y              x

 S. Mennicke (TU Braunschweig)       Compositional πa ⇒ Join           YR-CONCUR 2012   9 / 15
What our Encoding does

                         P = (νx)(y a | x(u).Q) | x b | y(z).R


                                                |       y




                          νx                                       |      x     y




                           |     y   x                         x          y



                  y              x

 S. Mennicke (TU Braunschweig)       Compositional πa ⇒ Join           YR-CONCUR 2012   9 / 15
What our Encoding does

                         P = (νx)(y a | x(u).Q) | x b | y(z).R


                                                |       y      y




                          νx                                           |      x     y




                           |     y   x                             x          y



                  y              x

 S. Mennicke (TU Braunschweig)       Compositional πa ⇒ Join               YR-CONCUR 2012   9 / 15
What our Encoding does

                         P = (νx)(y a | x(u).Q) | x b | y(z).R


                                                |       y      y

                                                        x

                          νx                                           |      x     y




                           |     y   x                             x          y



                  y              x

 S. Mennicke (TU Braunschweig)       Compositional πa ⇒ Join               YR-CONCUR 2012   9 / 15
What our Encoding does

                         P = (νx)(y a | x(u).Q) | x b | y(z).R


                                                |       y      y

                                                        x

                          νx                                           |      x     y




                           |     y   x                             x          y



                  y              x

 S. Mennicke (TU Braunschweig)       Compositional πa ⇒ Join               YR-CONCUR 2012   9 / 15
What our Encoding does

                         P = (νx)(y a | x(u).Q) | x b | y(z).R


                                                |       y      y

                                                        x

                          νx                                           |      x     y




                           |     y   x                             x          y



                  y              x

 S. Mennicke (TU Braunschweig)       Compositional πa ⇒ Join               YR-CONCUR 2012   9 / 15
What our Encoding does

                         P = (νx)(y a | x(u).Q) | x b | y(z).R


                                                |       y      y

                                                        x

                          νx                                           |      x     y




                           |     y   x                             x          y



                  y              x

 S. Mennicke (TU Braunschweig)       Compositional πa ⇒ Join               YR-CONCUR 2012   9 / 15
A Receive Requests (x(v).P )




                                           x




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join   YR-CONCUR 2012   10 / 15
A Receive Requests (x(v).P )




                                      def k
                                      rr x, k




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join   YR-CONCUR 2012   10 / 15
A Receive Requests (x(v).P )



                                 rr x, k

                                                  def k




 S. Mennicke (TU Braunschweig)             Compositional πa ⇒ Join   YR-CONCUR 2012   10 / 15
A Receive Requests (x(v).P )




                                        def k




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join   YR-CONCUR 2012   10 / 15
A Receive Requests (x(v).P )



                                             k v, l


                                        def k




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join   YR-CONCUR 2012   10 / 15
A Receive Requests (x(v).P )




                                       k v, l




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join   YR-CONCUR 2012   10 / 15
A Receive Requests (x(v).P )




                                   if l then P




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join   YR-CONCUR 2012   10 / 15
B Send Requests (x v )




                                         x




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join   YR-CONCUR 2012   11 / 15
B Send Requests (x v )




                                   def l
                                   sr x, v, l
                                   true




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join   YR-CONCUR 2012   11 / 15
B Send Requests (x v )


                                       sr x, v, l


                                     def l
                                     true




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join   YR-CONCUR 2012   11 / 15
B Send Requests (x v )




                                     def l
                                     true




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join   YR-CONCUR 2012   11 / 15
B Send Requests (x v )



                                           l t, f


                                     def l
                                     true




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join   YR-CONCUR 2012   11 / 15
B Send Requests (x v )



                                                t


                                       def l




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join   YR-CONCUR 2012   11 / 15
B Send Requests (x v )



                                           l t, f


                                       def l




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join   YR-CONCUR 2012   11 / 15
B Send Requests (x v )



                                               f


                                       def l




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join   YR-CONCUR 2012   11 / 15
C Restriction (νx)




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join   YR-CONCUR 2012   12 / 15
C Restriction (νx)




                                        ¬x




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join   YR-CONCUR 2012   12 / 15
D Parallel Composition ( | )
Remember this?
                 π
       P |Q      j    = def rrτ c, k | trans0 m m c, k | trans0 m in
                        def chain trans0 | srτ c, v, l
                           def mup c, k | trans m m c, k | trans m in
                           def m c , k
                              [c = c ]k v, l | mup c , k
                            in trans0 m | chain trans
                         in chain trans0 |
                        def sr c, v, l srup c, v, l | srτ c, v, l in
                        def srup c, v, l sr c, v, l in
                        def rr c, k rrup c, k | rrτ c, k in
                        def rrup c, k rr c, k in
                          P π | Q π
                               j        j



 S. Mennicke (TU Braunschweig)    Compositional πa ⇒ Join   YR-CONCUR 2012   13 / 15
D Parallel Composition ( | )




                                            |




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join   YR-CONCUR 2012   13 / 15
D Parallel Composition ( | )




                                                   |


                                 sr x1 , v1 , l1




 S. Mennicke (TU Braunschweig)          Compositional πa ⇒ Join   YR-CONCUR 2012   13 / 15
D Parallel Composition ( | )




                                               |


                                 rr y1 , k1




 S. Mennicke (TU Braunschweig)      Compositional πa ⇒ Join   YR-CONCUR 2012   13 / 15
D Parallel Composition ( | )



                                 sr x1 , v1 , l1 , . . . , sr xn , vn , ln
                                 rr y1 , k1 , . . . , rr yn , kn




 S. Mennicke (TU Braunschweig)             Compositional πa ⇒ Join           YR-CONCUR 2012   13 / 15
D Parallel Composition ( | )


                                 sr/rr

                                 sr x1 , v1 , l1 , . . . , sr xn , vn , ln
                                 rr y1 , k1 , . . . , rr yn , kn




 S. Mennicke (TU Braunschweig)             Compositional πa ⇒ Join           YR-CONCUR 2012   13 / 15
D Parallel Composition ( | )



                                 sr x1 , v1 , l1 , . . . , sr xn , vn , ln
                                 rr y1 , k1 , . . . , rr yn , kn




 S. Mennicke (TU Braunschweig)             Compositional πa ⇒ Join           YR-CONCUR 2012   13 / 15
D Parallel Composition ( | )



                                 sr x1 , v1 , l1 , . . . , sr xn , vn , ln
                                 rr y1 , k1 , . . . , rr yn , kn

                     sr x1 , v1 , l1




 S. Mennicke (TU Braunschweig)             Compositional πa ⇒ Join           YR-CONCUR 2012   13 / 15
D Parallel Composition ( | )



                                 sr x1 , v1 , l1 , . . . , sr xn , vn , ln
                                 rr y1 , k1 , . . . , rr yn , kn

                     sr x1 , v1 , l1


                     sr x2 , v2 , l2




 S. Mennicke (TU Braunschweig)             Compositional πa ⇒ Join           YR-CONCUR 2012   13 / 15
D Parallel Composition ( | )




                                    rr y1 , k1 , . . . , rr yn , kn
                           sr x1 , v1 , l1


                           sr x2 , v2 , l2

                                 ...

                           sr xn , vn , ln




 S. Mennicke (TU Braunschweig)               Compositional πa ⇒ Join   YR-CONCUR 2012   13 / 15
D Parallel Composition ( | )




                                    rr y1 , k1 , . . . , rr yn , kn
                           sr x1 , v1 , l1            rr yi , ki       if x1 = yi then ki v1 , l1

                           sr x2 , v2 , l2

                                 ...

                           sr xn , vn , ln




 S. Mennicke (TU Braunschweig)               Compositional πa ⇒ Join            YR-CONCUR 2012   13 / 15
D Parallel Composition ( | )




                                    rr y1 , k1 , . . . , rr yn , kn
                           sr x1 , v1 , l1


                           sr x2 , v2 , l2            rr yi , ki       if x2 = yi then ki v2 , l2
                                 ...

                           sr xn , vn , ln




 S. Mennicke (TU Braunschweig)               Compositional πa ⇒ Join            YR-CONCUR 2012   13 / 15
D Parallel Composition ( | )




                                       k2 v1 , l1 , k9 v42 , l42
                           sr x1 , v1 , l1


                           sr x2 , v2 , l2

                                 ...

                           sr xn , vn , ln




 S. Mennicke (TU Braunschweig)               Compositional πa ⇒ Join   YR-CONCUR 2012   13 / 15
D Parallel Composition ( | )




                                                   k9 v42 , l42
                                 sr x1 , v1 , l1                         k2 v1 , l1

                                 sr x2 , v2 , l2

                                       ...

                                 sr xn , vn , ln




 S. Mennicke (TU Braunschweig)                 Compositional πa ⇒ Join                YR-CONCUR 2012   13 / 15
Take-Home-Points




  1   There is a good encoding from πa to Join: ours!




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join   YR-CONCUR 2012   14 / 15
Take-Home-Points




  1   There is a good encoding from πa to Join: ours!
  2   It is compositional




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join   YR-CONCUR 2012   14 / 15
Take-Home-Points




  1   There is a good encoding from πa to Join: ours!
  2   It is compositional
  3   Strong Conjecture: It is operationally correspondent




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join   YR-CONCUR 2012   14 / 15
Take-Home-Points




  1   There is a good encoding from πa to Join: ours!
  2   It is compositional
  3   Strong Conjecture: It is operationally correspondent

                                 Thank you!



 S. Mennicke (TU Braunschweig)     Compositional πa ⇒ Join   YR-CONCUR 2012   14 / 15
Bibliography



     Cédric Fournet and Georges Gonthier.
     The reflexive chemical abstract machine and the join-calculus.
     pages 372–385, 1996.
     D. Gorla.
     Towards a Unified Approach to Encodability and Separation Results
     for Process Calculi.
     Information and Computation, 208(9) 1031–1053, 2010.
     K. Peters and U. Nestmann.
     Breaking Symmetries.
     Submitted to Mathematical Structures in Computer Science, 2011.




 S. Mennicke (TU Braunschweig)   Compositional πa ⇒ Join   YR-CONCUR 2012   15 / 15

More Related Content

What's hot

Discussion of ABC talk by Francesco Pauli, Padova, March 21, 2013
Discussion of ABC talk by Francesco Pauli, Padova, March 21, 2013Discussion of ABC talk by Francesco Pauli, Padova, March 21, 2013
Discussion of ABC talk by Francesco Pauli, Padova, March 21, 2013Christian Robert
 
(Approximate) Bayesian computation as a new empirical Bayes (something)?
(Approximate) Bayesian computation as a new empirical Bayes (something)?(Approximate) Bayesian computation as a new empirical Bayes (something)?
(Approximate) Bayesian computation as a new empirical Bayes (something)?Christian Robert
 
ABC-Xian
ABC-XianABC-Xian
ABC-XianDeb Roy
 
ABC: How Bayesian can it be?
ABC: How Bayesian can it be?ABC: How Bayesian can it be?
ABC: How Bayesian can it be?Christian Robert
 
Discussion of ABC talk by Stefano Cabras, Padova, March 21, 2013
Discussion of ABC talk by Stefano Cabras, Padova, March 21, 2013Discussion of ABC talk by Stefano Cabras, Padova, March 21, 2013
Discussion of ABC talk by Stefano Cabras, Padova, March 21, 2013Christian Robert
 
Discussion of Fearnhead and Prangle, RSS< Dec. 14, 2011
Discussion of Fearnhead and Prangle, RSS< Dec. 14, 2011Discussion of Fearnhead and Prangle, RSS< Dec. 14, 2011
Discussion of Fearnhead and Prangle, RSS< Dec. 14, 2011Christian Robert
 
Non-archimedean construction of elliptic curves and rational points
Non-archimedean construction of elliptic curves and rational pointsNon-archimedean construction of elliptic curves and rational points
Non-archimedean construction of elliptic curves and rational pointsmmasdeu
 
Csr2011 june16 16_30_golovach
Csr2011 june16 16_30_golovachCsr2011 june16 16_30_golovach
Csr2011 june16 16_30_golovachCSR2011
 
Numerical approach for Hamilton-Jacobi equations on a network: application to...
Numerical approach for Hamilton-Jacobi equations on a network: application to...Numerical approach for Hamilton-Jacobi equations on a network: application to...
Numerical approach for Hamilton-Jacobi equations on a network: application to...Guillaume Costeseque
 
The Graph Minor Theorem: a walk on the wild side of graphs
The Graph Minor Theorem: a walk on the wild side of graphsThe Graph Minor Theorem: a walk on the wild side of graphs
The Graph Minor Theorem: a walk on the wild side of graphsMarco Benini
 
A Unifying Review of Gaussian Linear Models (Roweis 1999)
A Unifying Review of Gaussian Linear Models (Roweis 1999)A Unifying Review of Gaussian Linear Models (Roweis 1999)
A Unifying Review of Gaussian Linear Models (Roweis 1999)Feynman Liang
 
Representation formula for traffic flow estimation on a network
Representation formula for traffic flow estimation on a networkRepresentation formula for traffic flow estimation on a network
Representation formula for traffic flow estimation on a networkGuillaume Costeseque
 
Analytic construction of elliptic curves and rational points
Analytic construction of elliptic curves and rational pointsAnalytic construction of elliptic curves and rational points
Analytic construction of elliptic curves and rational pointsmmasdeu
 
Jyokyo-kai-20120605
Jyokyo-kai-20120605Jyokyo-kai-20120605
Jyokyo-kai-20120605ketanaka
 
Hamilton-Jacobi approach for second order traffic flow models
Hamilton-Jacobi approach for second order traffic flow modelsHamilton-Jacobi approach for second order traffic flow models
Hamilton-Jacobi approach for second order traffic flow modelsGuillaume Costeseque
 

What's hot (20)

Athens workshop on MCMC
Athens workshop on MCMCAthens workshop on MCMC
Athens workshop on MCMC
 
Discussion of ABC talk by Francesco Pauli, Padova, March 21, 2013
Discussion of ABC talk by Francesco Pauli, Padova, March 21, 2013Discussion of ABC talk by Francesco Pauli, Padova, March 21, 2013
Discussion of ABC talk by Francesco Pauli, Padova, March 21, 2013
 
(Approximate) Bayesian computation as a new empirical Bayes (something)?
(Approximate) Bayesian computation as a new empirical Bayes (something)?(Approximate) Bayesian computation as a new empirical Bayes (something)?
(Approximate) Bayesian computation as a new empirical Bayes (something)?
 
ABC-Xian
ABC-XianABC-Xian
ABC-Xian
 
ABC: How Bayesian can it be?
ABC: How Bayesian can it be?ABC: How Bayesian can it be?
ABC: How Bayesian can it be?
 
Discussion of ABC talk by Stefano Cabras, Padova, March 21, 2013
Discussion of ABC talk by Stefano Cabras, Padova, March 21, 2013Discussion of ABC talk by Stefano Cabras, Padova, March 21, 2013
Discussion of ABC talk by Stefano Cabras, Padova, March 21, 2013
 
Qghl
QghlQghl
Qghl
 
Discussion of Fearnhead and Prangle, RSS< Dec. 14, 2011
Discussion of Fearnhead and Prangle, RSS< Dec. 14, 2011Discussion of Fearnhead and Prangle, RSS< Dec. 14, 2011
Discussion of Fearnhead and Prangle, RSS< Dec. 14, 2011
 
Non-archimedean construction of elliptic curves and rational points
Non-archimedean construction of elliptic curves and rational pointsNon-archimedean construction of elliptic curves and rational points
Non-archimedean construction of elliptic curves and rational points
 
Csr2011 june16 16_30_golovach
Csr2011 june16 16_30_golovachCsr2011 june16 16_30_golovach
Csr2011 june16 16_30_golovach
 
QMC: Transition Workshop - Probabilistic Integrators for Deterministic Differ...
QMC: Transition Workshop - Probabilistic Integrators for Deterministic Differ...QMC: Transition Workshop - Probabilistic Integrators for Deterministic Differ...
QMC: Transition Workshop - Probabilistic Integrators for Deterministic Differ...
 
Numerical approach for Hamilton-Jacobi equations on a network: application to...
Numerical approach for Hamilton-Jacobi equations on a network: application to...Numerical approach for Hamilton-Jacobi equations on a network: application to...
Numerical approach for Hamilton-Jacobi equations on a network: application to...
 
The Graph Minor Theorem: a walk on the wild side of graphs
The Graph Minor Theorem: a walk on the wild side of graphsThe Graph Minor Theorem: a walk on the wild side of graphs
The Graph Minor Theorem: a walk on the wild side of graphs
 
A Unifying Review of Gaussian Linear Models (Roweis 1999)
A Unifying Review of Gaussian Linear Models (Roweis 1999)A Unifying Review of Gaussian Linear Models (Roweis 1999)
A Unifying Review of Gaussian Linear Models (Roweis 1999)
 
Representation formula for traffic flow estimation on a network
Representation formula for traffic flow estimation on a networkRepresentation formula for traffic flow estimation on a network
Representation formula for traffic flow estimation on a network
 
QMC: Transition Workshop - Importance Sampling the Union of Rare Events with ...
QMC: Transition Workshop - Importance Sampling the Union of Rare Events with ...QMC: Transition Workshop - Importance Sampling the Union of Rare Events with ...
QMC: Transition Workshop - Importance Sampling the Union of Rare Events with ...
 
Sylvain Weill
Sylvain WeillSylvain Weill
Sylvain Weill
 
Analytic construction of elliptic curves and rational points
Analytic construction of elliptic curves and rational pointsAnalytic construction of elliptic curves and rational points
Analytic construction of elliptic curves and rational points
 
Jyokyo-kai-20120605
Jyokyo-kai-20120605Jyokyo-kai-20120605
Jyokyo-kai-20120605
 
Hamilton-Jacobi approach for second order traffic flow models
Hamilton-Jacobi approach for second order traffic flow modelsHamilton-Jacobi approach for second order traffic flow models
Hamilton-Jacobi approach for second order traffic flow models
 

Viewers also liked

Daad March 8th 2010
Daad   March 8th 2010Daad   March 8th 2010
Daad March 8th 2010khalid_nitt
 
FSLN12 Kick-Off, TU Braunschweig
FSLN12 Kick-Off, TU BraunschweigFSLN12 Kick-Off, TU Braunschweig
FSLN12 Kick-Off, TU Braunschweigalexanderperl
 
Icmens 2009 L100
Icmens 2009   L100Icmens 2009   L100
Icmens 2009 L100khalid_nitt
 
Distributed systems and scalability rules
Distributed systems and scalability rulesDistributed systems and scalability rules
Distributed systems and scalability rulesOleg Tsal-Tsalko
 
State Machine Design and Synthesis
State Machine Design and SynthesisState Machine Design and Synthesis
State Machine Design and SynthesisAbhilash Nair
 
Practical Byzantine Fault Tolerance
Practical Byzantine Fault TolerancePractical Byzantine Fault Tolerance
Practical Byzantine Fault ToleranceSuman Karumuri
 
From Mainframe to Microservice: An Introduction to Distributed Systems
From Mainframe to Microservice: An Introduction to Distributed SystemsFrom Mainframe to Microservice: An Introduction to Distributed Systems
From Mainframe to Microservice: An Introduction to Distributed SystemsTyler Treat
 
The State of HBase Replication
The State of HBase ReplicationThe State of HBase Replication
The State of HBase ReplicationHBaseCon
 
Introduction state machine
Introduction state machineIntroduction state machine
Introduction state machineShreyans Pathak
 

Viewers also liked (10)

Daad March 8th 2010
Daad   March 8th 2010Daad   March 8th 2010
Daad March 8th 2010
 
FSLN12 Kick-Off, TU Braunschweig
FSLN12 Kick-Off, TU BraunschweigFSLN12 Kick-Off, TU Braunschweig
FSLN12 Kick-Off, TU Braunschweig
 
Icmens 2009 L100
Icmens 2009   L100Icmens 2009   L100
Icmens 2009 L100
 
Distributed systems and scalability rules
Distributed systems and scalability rulesDistributed systems and scalability rules
Distributed systems and scalability rules
 
State Machine Design and Synthesis
State Machine Design and SynthesisState Machine Design and Synthesis
State Machine Design and Synthesis
 
Practical Byzantine Fault Tolerance
Practical Byzantine Fault TolerancePractical Byzantine Fault Tolerance
Practical Byzantine Fault Tolerance
 
PBFT
PBFTPBFT
PBFT
 
From Mainframe to Microservice: An Introduction to Distributed Systems
From Mainframe to Microservice: An Introduction to Distributed SystemsFrom Mainframe to Microservice: An Introduction to Distributed Systems
From Mainframe to Microservice: An Introduction to Distributed Systems
 
The State of HBase Replication
The State of HBase ReplicationThe State of HBase Replication
The State of HBase Replication
 
Introduction state machine
Introduction state machineIntroduction state machine
Introduction state machine
 

Recently uploaded

The Codex of Business Writing Software for Real-World Solutions 2.pptx
The Codex of Business Writing Software for Real-World Solutions 2.pptxThe Codex of Business Writing Software for Real-World Solutions 2.pptx
The Codex of Business Writing Software for Real-World Solutions 2.pptxMalak Abu Hammad
 
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...Drew Madelung
 
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...Miguel Araújo
 
Handwritten Text Recognition for manuscripts and early printed texts
Handwritten Text Recognition for manuscripts and early printed textsHandwritten Text Recognition for manuscripts and early printed texts
Handwritten Text Recognition for manuscripts and early printed textsMaria Levchenko
 
Presentation on how to chat with PDF using ChatGPT code interpreter
Presentation on how to chat with PDF using ChatGPT code interpreterPresentation on how to chat with PDF using ChatGPT code interpreter
Presentation on how to chat with PDF using ChatGPT code interpreternaman860154
 
Factors to Consider When Choosing Accounts Payable Services Providers.pptx
Factors to Consider When Choosing Accounts Payable Services Providers.pptxFactors to Consider When Choosing Accounts Payable Services Providers.pptx
Factors to Consider When Choosing Accounts Payable Services Providers.pptxKatpro Technologies
 
Powerful Google developer tools for immediate impact! (2023-24 C)
Powerful Google developer tools for immediate impact! (2023-24 C)Powerful Google developer tools for immediate impact! (2023-24 C)
Powerful Google developer tools for immediate impact! (2023-24 C)wesley chun
 
A Year of the Servo Reboot: Where Are We Now?
A Year of the Servo Reboot: Where Are We Now?A Year of the Servo Reboot: Where Are We Now?
A Year of the Servo Reboot: Where Are We Now?Igalia
 
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
04-2024-HHUG-Sales-and-Marketing-Alignment.pptxHampshireHUG
 
Boost Fertility New Invention Ups Success Rates.pdf
Boost Fertility New Invention Ups Success Rates.pdfBoost Fertility New Invention Ups Success Rates.pdf
Boost Fertility New Invention Ups Success Rates.pdfsudhanshuwaghmare1
 
Boost PC performance: How more available memory can improve productivity
Boost PC performance: How more available memory can improve productivityBoost PC performance: How more available memory can improve productivity
Boost PC performance: How more available memory can improve productivityPrincipled Technologies
 
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdfThe Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdfEnterprise Knowledge
 
Artificial Intelligence: Facts and Myths
Artificial Intelligence: Facts and MythsArtificial Intelligence: Facts and Myths
Artificial Intelligence: Facts and MythsJoaquim Jorge
 
Histor y of HAM Radio presentation slide
Histor y of HAM Radio presentation slideHistor y of HAM Radio presentation slide
Histor y of HAM Radio presentation slidevu2urc
 
GenCyber Cyber Security Day Presentation
GenCyber Cyber Security Day PresentationGenCyber Cyber Security Day Presentation
GenCyber Cyber Security Day PresentationMichael W. Hawkins
 
A Domino Admins Adventures (Engage 2024)
A Domino Admins Adventures (Engage 2024)A Domino Admins Adventures (Engage 2024)
A Domino Admins Adventures (Engage 2024)Gabriella Davis
 
From Event to Action: Accelerate Your Decision Making with Real-Time Automation
From Event to Action: Accelerate Your Decision Making with Real-Time AutomationFrom Event to Action: Accelerate Your Decision Making with Real-Time Automation
From Event to Action: Accelerate Your Decision Making with Real-Time AutomationSafe Software
 
IAC 2024 - IA Fast Track to Search Focused AI Solutions
IAC 2024 - IA Fast Track to Search Focused AI SolutionsIAC 2024 - IA Fast Track to Search Focused AI Solutions
IAC 2024 - IA Fast Track to Search Focused AI SolutionsEnterprise Knowledge
 
Axa Assurance Maroc - Insurer Innovation Award 2024
Axa Assurance Maroc - Insurer Innovation Award 2024Axa Assurance Maroc - Insurer Innovation Award 2024
Axa Assurance Maroc - Insurer Innovation Award 2024The Digital Insurer
 
Workshop - Best of Both Worlds_ Combine KG and Vector search for enhanced R...
Workshop - Best of Both Worlds_ Combine  KG and Vector search for  enhanced R...Workshop - Best of Both Worlds_ Combine  KG and Vector search for  enhanced R...
Workshop - Best of Both Worlds_ Combine KG and Vector search for enhanced R...Neo4j
 

Recently uploaded (20)

The Codex of Business Writing Software for Real-World Solutions 2.pptx
The Codex of Business Writing Software for Real-World Solutions 2.pptxThe Codex of Business Writing Software for Real-World Solutions 2.pptx
The Codex of Business Writing Software for Real-World Solutions 2.pptx
 
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
 
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
 
Handwritten Text Recognition for manuscripts and early printed texts
Handwritten Text Recognition for manuscripts and early printed textsHandwritten Text Recognition for manuscripts and early printed texts
Handwritten Text Recognition for manuscripts and early printed texts
 
Presentation on how to chat with PDF using ChatGPT code interpreter
Presentation on how to chat with PDF using ChatGPT code interpreterPresentation on how to chat with PDF using ChatGPT code interpreter
Presentation on how to chat with PDF using ChatGPT code interpreter
 
Factors to Consider When Choosing Accounts Payable Services Providers.pptx
Factors to Consider When Choosing Accounts Payable Services Providers.pptxFactors to Consider When Choosing Accounts Payable Services Providers.pptx
Factors to Consider When Choosing Accounts Payable Services Providers.pptx
 
Powerful Google developer tools for immediate impact! (2023-24 C)
Powerful Google developer tools for immediate impact! (2023-24 C)Powerful Google developer tools for immediate impact! (2023-24 C)
Powerful Google developer tools for immediate impact! (2023-24 C)
 
A Year of the Servo Reboot: Where Are We Now?
A Year of the Servo Reboot: Where Are We Now?A Year of the Servo Reboot: Where Are We Now?
A Year of the Servo Reboot: Where Are We Now?
 
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
 
Boost Fertility New Invention Ups Success Rates.pdf
Boost Fertility New Invention Ups Success Rates.pdfBoost Fertility New Invention Ups Success Rates.pdf
Boost Fertility New Invention Ups Success Rates.pdf
 
Boost PC performance: How more available memory can improve productivity
Boost PC performance: How more available memory can improve productivityBoost PC performance: How more available memory can improve productivity
Boost PC performance: How more available memory can improve productivity
 
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdfThe Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
 
Artificial Intelligence: Facts and Myths
Artificial Intelligence: Facts and MythsArtificial Intelligence: Facts and Myths
Artificial Intelligence: Facts and Myths
 
Histor y of HAM Radio presentation slide
Histor y of HAM Radio presentation slideHistor y of HAM Radio presentation slide
Histor y of HAM Radio presentation slide
 
GenCyber Cyber Security Day Presentation
GenCyber Cyber Security Day PresentationGenCyber Cyber Security Day Presentation
GenCyber Cyber Security Day Presentation
 
A Domino Admins Adventures (Engage 2024)
A Domino Admins Adventures (Engage 2024)A Domino Admins Adventures (Engage 2024)
A Domino Admins Adventures (Engage 2024)
 
From Event to Action: Accelerate Your Decision Making with Real-Time Automation
From Event to Action: Accelerate Your Decision Making with Real-Time AutomationFrom Event to Action: Accelerate Your Decision Making with Real-Time Automation
From Event to Action: Accelerate Your Decision Making with Real-Time Automation
 
IAC 2024 - IA Fast Track to Search Focused AI Solutions
IAC 2024 - IA Fast Track to Search Focused AI SolutionsIAC 2024 - IA Fast Track to Search Focused AI Solutions
IAC 2024 - IA Fast Track to Search Focused AI Solutions
 
Axa Assurance Maroc - Insurer Innovation Award 2024
Axa Assurance Maroc - Insurer Innovation Award 2024Axa Assurance Maroc - Insurer Innovation Award 2024
Axa Assurance Maroc - Insurer Innovation Award 2024
 
Workshop - Best of Both Worlds_ Combine KG and Vector search for enhanced R...
Workshop - Best of Both Worlds_ Combine  KG and Vector search for  enhanced R...Workshop - Best of Both Worlds_ Combine  KG and Vector search for  enhanced R...
Workshop - Best of Both Worlds_ Combine KG and Vector search for enhanced R...
 

A Compositional Encoding for the Asynchronous Pi-Calculus into the Join-Calculus

  • 1. A Compositional Encoding of the Asynchronous π-Calculus into the Join-Calculus Stephan Mennicke† Tobias Prehn‡ Tsvetelina Yonova-Karbe‡ Institute for Programming and Reactive Systems, TU Braunschweig† Institute for Software Engineering and Theoretical Computer Science, TU Berlin‡ September 3, 2012 YR-CONCUR 2012
  • 2. WraP – Writing and Publishing a Scientific Paper Supervision by Uwe Nestmann and Kirstin Peters S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 2 / 15
  • 3. Scope of Interest Asynchronous π (πa ) Join-Calculus S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 3 / 15
  • 4. Scope of Interest Asynchronous π (πa ) Join-Calculus P |Q Parallelism P |Q xv Send xv x(w).P Receive def x w | o P in . . . | o x(w)∗ .P Recursion def x w P in . . . x(w).P | x v Communication def x w P in x v S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 3 / 15
  • 5. Scope of Interest Asynchronous π (πa ) Join-Calculus P |Q Parallelism P |Q xv Send xv x(w).P Receive def x w | o P in . . . | o x(w)∗ .P Recursion def x w P in . . . x(w).P | x v Communication def x w P in x v Restriction S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 3 / 15
  • 6. Scope of Interest Asynchronous π (πa ) Join-Calculus P |Q Parallelism P |Q xv Send xv x(w).P Receive def x w | o P in . . . | o x(w)∗ .P Recursion def x w P in . . . x(w).P | x v Communication def x w P in x v (νx)(x(w).P | x v ) Restriction S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 3 / 15
  • 7. Scope of Interest Asynchronous π (πa ) Join-Calculus P |Q Parallelism P |Q xv Send xv x(w).P Receive def x w | o P in . . . | o x(w)∗ .P Recursion def x w P in . . . x(w).P | x v Communication def x w P in x v (νx)(x(w).P | x v ) Restriction def x w P in x v S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 3 / 15
  • 8. Scope of Interest Asynchronous π (πa ) Join-Calculus P |Q Parallelism P |Q xv Send xv x(w).P Receive def x w | o P in . . . | o x(w)∗ .P Recursion def x w P in . . . x(w).P | x v Communication def x w P in x v (νx)(x(w).P | x v ) Restriction def x w P in x v S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 3 / 15
  • 9. Scope of Interest π Asynchronous π (πa ) j Join-Calculus P |Q Parallelism P |Q xv Send xv x(w).P Receive def x w | o P in . . . | o x(w)∗ .P Recursion def x w P in . . . x(w).P | x v Communication def x w P in x v (νx)(x(w).P | x v ) Restriction def x w P in x v S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 3 / 15
  • 10. An Encoding is Non-Trivial | no (νx) xv x(w) S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 4 / 15
  • 11. An Encoding is Non-Trivial | no (νx) xv x(w) S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 4 / 15
  • 12. An Encoding is Non-Trivial | | no (νx) xv xv x(w) def x S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 4 / 15
  • 13. An Encoding is Non-Trivial | | no (νx) xv xv x(w) def x S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 4 / 15
  • 14. The Encoding of Fournet and Gonthier [Fournet and Gonthier(1996)] First Layer Second Layer S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 5 / 15
  • 15. The Encoding of Fournet and Gonthier [Fournet and Gonthier(1996)] First Layer x v → xo v P |Q → P |Q Second Layer S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 5 / 15
  • 16. The Encoding of Fournet and Gonthier [Fournet and Gonthier(1996)] First Layer x v → xo v P |Q → P |Q x(w).P → def κ P in xi Second Layer S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 5 / 15
  • 17. The Encoding of Fournet and Gonthier [Fournet and Gonthier(1996)] First Layer x v → xo v P |Q → P |Q x(w).P → def κ P in xi (νx)P → def xi | xo κ in P Second Layer S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 5 / 15
  • 18. The Encoding of Fournet and Gonthier [Fournet and Gonthier(1996)] First Layer x v → xo v P |Q → P |Q x(w).P → def κ P in xi (νx)P → def xi | xo κ in P Second Layer Restrict all free names S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 5 / 15
  • 19. The Encoding of Fournet and Gonthier [Fournet and Gonthier(1996)] First Layer x v → xo v P |Q → P |Q x(w).P → def κ P in xi (νx)P → def xi | xo κ in P Second Layer Restrict all free names Is this good? S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 5 / 15
  • 20. Gorla’s Criteria for Good Encodings [Gorla(2010)] . S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 6 / 15
  • 21. Gorla’s Criteria for Good Encodings [Gorla(2010)] I. Compositionality . S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 6 / 15
  • 22. Gorla’s Criteria for Good Encodings [Gorla(2010)] I. Compositionality . II. Name Invariance S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 6 / 15
  • 23. Gorla’s Criteria for Good Encodings [Gorla(2010)] I. Compositionality Syntactic Criteria . II. Name Invariance S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 6 / 15
  • 24. Gorla’s Criteria for Good Encodings [Gorla(2010)] I. Compositionality Syntactic Criteria . II. Name Invariance III. Operational Correspondence S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 6 / 15
  • 25. Gorla’s Criteria for Good Encodings [Gorla(2010)] I. Compositionality Syntactic Criteria . IV. Divergence Reflection II. Name Invariance III. Operational Correspondence S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 6 / 15
  • 26. Gorla’s Criteria for Good Encodings [Gorla(2010)] V. Success Sensitiveness I. Compositionality Syntactic Criteria . IV. Divergence Reflection II. Name Invariance III. Operational Correspondence S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 6 / 15
  • 27. Gorla’s Criteria for Good Encodings [Gorla(2010)] V. Success Sensitiveness I. Compositionality Syntactic Criteria Semantic Criteria . IV. Divergence Reflection II. Name Invariance III. Operational Correspondence S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 6 / 15
  • 28. Fournet and Gonthier’s Encoding Revisited First level encoding is compositional and operationally correspondent for closed terms S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 7 / 15
  • 29. Fournet and Gonthier’s Encoding Revisited First level encoding is compositional and operationally correspondent for closed terms First level encoding is not operationally correspondent for open terms S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 7 / 15
  • 30. Fournet and Gonthier’s Encoding Revisited First level encoding is compositional and operationally correspondent for closed terms First level encoding is not operationally correspondent for open terms First+Second level encoding is not compositional S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 7 / 15
  • 31. Fournet and Gonthier’s Encoding Revisited First level encoding is compositional and operationally correspondent for closed terms First level encoding is not operationally correspondent for open terms First+Second level encoding is not compositional Our Approach S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 7 / 15
  • 32. Fournet and Gonthier’s Encoding Revisited First level encoding is compositional and operationally correspondent for closed terms First level encoding is not operationally correspondent for open terms First+Second level encoding is not compositional Our Approach We introduce send/receive requests carrying the channel names S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 7 / 15
  • 33. Fournet and Gonthier’s Encoding Revisited First level encoding is compositional and operationally correspondent for closed terms First level encoding is not operationally correspondent for open terms First+Second level encoding is not compositional Our Approach We introduce send/receive requests carrying the channel names We keep the main idea of restriction S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 7 / 15
  • 34. Fournet and Gonthier’s Encoding Revisited First level encoding is compositional and operationally correspondent for closed terms First level encoding is not operationally correspondent for open terms First+Second level encoding is not compositional Our Approach We introduce send/receive requests carrying the channel names We keep the main idea of restriction We implement a protocol to handle communication [Peters and Nestmann(2011)] S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 7 / 15
  • 35. Fournet and Gonthier’s Encoding Revisited First level encoding is compositional and operationally correspondent for closed terms First level encoding is not operationally correspondent for open terms First+Second level encoding is not compositional Our Approach We introduce send/receive requests carrying the channel names We keep the main idea of restriction We implement a protocol to handle communication [Peters and Nestmann(2011)] We need matching to decide which requests may cooperate S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 7 / 15
  • 36. The Big Picture π (1) x v j = def lf t, f | f alse f | f alse in (2) def lt t, f | true t | f alse in (3) def l t, f lt t, f | lf t, f in sr x, v, l | true π (4) P |Q j = def rrτ c, k | trans0 m m c, k | trans0 m in (5) def chain trans0 | srτ c, v, l (6) def mup c, k | trans m m c, k | trans m in (7) def m c , k (8) [c = c ]k v, l | mup c , k (9) in trans0 m | chain trans (10) in chain trans0 | (11) def sr c, v, l srup c, v, l | srτ c, v, l in (12) def srup c, v, l sr c, v, l in (13) def rr c, k rrup c, k | rrτ c, k in (14) def rrup c, k rr c, k in (15) P π | Q π j j π (16) x(v).P j = def k v, l | once (17) def t P π in j (18) def f once in l t, f (19) in rr x, k | once π (20) (νx)P j = def x 0 in P π j S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 8 / 15
  • 37. What our Encoding does P = (νx)(y a | x(u).Q) | x b | y(z).R S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 9 / 15
  • 38. What our Encoding does P = (νx)(y a | x(u).Q) | x b | y(z).R | νx | | x y y x S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 9 / 15
  • 39. What our Encoding does P = (νx)(y a | x(u).Q) | x b | y(z).R | νx | | x x y y y y x x S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 9 / 15
  • 40. What our Encoding does P = (νx)(y a | x(u).Q) | x b | y(z).R | νx | | y x x y y y x x S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 9 / 15
  • 41. What our Encoding does P = (νx)(y a | x(u).Q) | x b | y(z).R | y νx | | y x x y y y x x S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 9 / 15
  • 42. What our Encoding does P = (νx)(y a | x(u).Q) | x b | y(z).R | y νx | | y x x x y y y x S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 9 / 15
  • 43. What our Encoding does P = (νx)(y a | x(u).Q) | x b | y(z).R | y x νx | | y x x x y y y x S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 9 / 15
  • 44. What our Encoding does P = (νx)(y a | x(u).Q) | x b | y(z).R | y νx | x | y x x y y y x S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 9 / 15
  • 45. What our Encoding does P = (νx)(y a | x(u).Q) | x b | y(z).R | y νx | x y | y x x y y x S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 9 / 15
  • 46. What our Encoding does P = (νx)(y a | x(u).Q) | x b | y(z).R | y y νx | x y | y x x y y x S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 9 / 15
  • 47. What our Encoding does P = (νx)(y a | x(u).Q) | x b | y(z).R | y y x νx | x y | y x x y y x S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 9 / 15
  • 48. What our Encoding does P = (νx)(y a | x(u).Q) | x b | y(z).R | y y x νx | x y | y x x y y x S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 9 / 15
  • 49. What our Encoding does P = (νx)(y a | x(u).Q) | x b | y(z).R | y y x νx | x y | y x x y y x S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 9 / 15
  • 50. What our Encoding does P = (νx)(y a | x(u).Q) | x b | y(z).R | y y x νx | x y | y x x y y x S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 9 / 15
  • 51. A Receive Requests (x(v).P ) x S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 10 / 15
  • 52. A Receive Requests (x(v).P ) def k rr x, k S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 10 / 15
  • 53. A Receive Requests (x(v).P ) rr x, k def k S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 10 / 15
  • 54. A Receive Requests (x(v).P ) def k S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 10 / 15
  • 55. A Receive Requests (x(v).P ) k v, l def k S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 10 / 15
  • 56. A Receive Requests (x(v).P ) k v, l S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 10 / 15
  • 57. A Receive Requests (x(v).P ) if l then P S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 10 / 15
  • 58. B Send Requests (x v ) x S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 11 / 15
  • 59. B Send Requests (x v ) def l sr x, v, l true S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 11 / 15
  • 60. B Send Requests (x v ) sr x, v, l def l true S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 11 / 15
  • 61. B Send Requests (x v ) def l true S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 11 / 15
  • 62. B Send Requests (x v ) l t, f def l true S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 11 / 15
  • 63. B Send Requests (x v ) t def l S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 11 / 15
  • 64. B Send Requests (x v ) l t, f def l S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 11 / 15
  • 65. B Send Requests (x v ) f def l S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 11 / 15
  • 66. C Restriction (νx) S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 12 / 15
  • 67. C Restriction (νx) ¬x S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 12 / 15
  • 68. D Parallel Composition ( | ) Remember this? π P |Q j = def rrτ c, k | trans0 m m c, k | trans0 m in def chain trans0 | srτ c, v, l def mup c, k | trans m m c, k | trans m in def m c , k [c = c ]k v, l | mup c , k in trans0 m | chain trans in chain trans0 | def sr c, v, l srup c, v, l | srτ c, v, l in def srup c, v, l sr c, v, l in def rr c, k rrup c, k | rrτ c, k in def rrup c, k rr c, k in P π | Q π j j S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 13 / 15
  • 69. D Parallel Composition ( | ) | S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 13 / 15
  • 70. D Parallel Composition ( | ) | sr x1 , v1 , l1 S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 13 / 15
  • 71. D Parallel Composition ( | ) | rr y1 , k1 S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 13 / 15
  • 72. D Parallel Composition ( | ) sr x1 , v1 , l1 , . . . , sr xn , vn , ln rr y1 , k1 , . . . , rr yn , kn S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 13 / 15
  • 73. D Parallel Composition ( | ) sr/rr sr x1 , v1 , l1 , . . . , sr xn , vn , ln rr y1 , k1 , . . . , rr yn , kn S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 13 / 15
  • 74. D Parallel Composition ( | ) sr x1 , v1 , l1 , . . . , sr xn , vn , ln rr y1 , k1 , . . . , rr yn , kn S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 13 / 15
  • 75. D Parallel Composition ( | ) sr x1 , v1 , l1 , . . . , sr xn , vn , ln rr y1 , k1 , . . . , rr yn , kn sr x1 , v1 , l1 S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 13 / 15
  • 76. D Parallel Composition ( | ) sr x1 , v1 , l1 , . . . , sr xn , vn , ln rr y1 , k1 , . . . , rr yn , kn sr x1 , v1 , l1 sr x2 , v2 , l2 S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 13 / 15
  • 77. D Parallel Composition ( | ) rr y1 , k1 , . . . , rr yn , kn sr x1 , v1 , l1 sr x2 , v2 , l2 ... sr xn , vn , ln S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 13 / 15
  • 78. D Parallel Composition ( | ) rr y1 , k1 , . . . , rr yn , kn sr x1 , v1 , l1 rr yi , ki if x1 = yi then ki v1 , l1 sr x2 , v2 , l2 ... sr xn , vn , ln S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 13 / 15
  • 79. D Parallel Composition ( | ) rr y1 , k1 , . . . , rr yn , kn sr x1 , v1 , l1 sr x2 , v2 , l2 rr yi , ki if x2 = yi then ki v2 , l2 ... sr xn , vn , ln S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 13 / 15
  • 80. D Parallel Composition ( | ) k2 v1 , l1 , k9 v42 , l42 sr x1 , v1 , l1 sr x2 , v2 , l2 ... sr xn , vn , ln S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 13 / 15
  • 81. D Parallel Composition ( | ) k9 v42 , l42 sr x1 , v1 , l1 k2 v1 , l1 sr x2 , v2 , l2 ... sr xn , vn , ln S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 13 / 15
  • 82. Take-Home-Points 1 There is a good encoding from πa to Join: ours! S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 14 / 15
  • 83. Take-Home-Points 1 There is a good encoding from πa to Join: ours! 2 It is compositional S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 14 / 15
  • 84. Take-Home-Points 1 There is a good encoding from πa to Join: ours! 2 It is compositional 3 Strong Conjecture: It is operationally correspondent S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 14 / 15
  • 85. Take-Home-Points 1 There is a good encoding from πa to Join: ours! 2 It is compositional 3 Strong Conjecture: It is operationally correspondent Thank you! S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 14 / 15
  • 86. Bibliography Cédric Fournet and Georges Gonthier. The reflexive chemical abstract machine and the join-calculus. pages 372–385, 1996. D. Gorla. Towards a Unified Approach to Encodability and Separation Results for Process Calculi. Information and Computation, 208(9) 1031–1053, 2010. K. Peters and U. Nestmann. Breaking Symmetries. Submitted to Mathematical Structures in Computer Science, 2011. S. Mennicke (TU Braunschweig) Compositional πa ⇒ Join YR-CONCUR 2012 15 / 15