{"id":123,"date":"2012-05-16T13:29:17","date_gmt":"2012-05-16T12:29:17","guid":{"rendered":"http:\/\/sites.google.com\/feeds\/content\/site\/tcsunica\/4331995527601404685"},"modified":"2013-11-22T15:37:24","modified_gmt":"2013-11-22T14:37:24","slug":"seminar-differential-interaction-nets-and-true-concurrency","status":"publish","type":"post","link":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/2012\/05\/16\/seminar-differential-interaction-nets-and-true-concurrency\/","title":{"rendered":"Seminar: Differential Interaction Nets and True Concurrency"},"content":{"rendered":"
Upcoming Seminar<\/span>
<\/font><\/div><\/div>
<\/span><\/font>
Differential Interaction Nets and True Concurrency<\/b>
<\/font><\/div><\/div>
<\/span><\/font>
May 24th <\/font>15.00 <\/font>& May 25th 14.00
Aula C, Palazzo delle Scienze - Cagliari
<\/font><\/div><\/div>

<\/span><\/font>
Damiano Mazza
<\/span><\/b><\/font><\/div><\/div>
Laboratoire d'Informatique de Paris Nord, CNRS (France)
<\/font><\/div>

<\/font><\/div>
Abstract.<\/b> <\/font>Differential interaction nets have been introduced by Thomas Ehrhard and Laurent Regnier as an extension of linear logic proof-nets. Their main novelty is the presence of non-determinism in the cut-elimination procedure. This allowed Ehrhard and Laurent to prove that standard process calculi (e.g., pi-calculus, solos calculus) can be encoded into differential nets. However, such techniques exploit an ad-hoc treatment of reduction, which is needed to guarantee the existence of a bisimulation.<\/span>

In the first part of this talk (May 24th) we will introduce interaction nets, and then differential interaction nets as a special case. In the second part (May 25th), we will analyse differential nets from a "true concurrency" point of view (non-interleaving semantics, in particular based on event structures). We will see that differential nets are inherently less expressive than standard process calculi; we will then see how to enhance their expressivity.<\/span>

<\/div><\/td><\/tr><\/tbody><\/table><\/div>","protected":false},"excerpt":{"rendered":"\n\n\n
\n
\n
\n
\n
Upcoming Seminar<\/span><\/div>\n<\/div>\n


<\/span><\/p>\n

\n
Differential Interaction Nets and True Concurrency<\/b><\/div>\n<\/div>\n


<\/span><\/p>\n

May 24th 15.00 & May 25th 14.00
Aula C, Palazzo delle Scienze – Cagliari<\/div>\n<\/div>\n

<\/span><\/p>\n
Damiano Mazza
<\/span><\/b><\/div>\n<\/div>\n
Laboratoire d’Informatique de Paris Nord, CNRS (France)<\/div>\n
<\/div>\n

Abstract.<\/b> Differential interaction nets have been introduced by Thomas Ehrhard and Laurent Regnier as an extension of linear logic proof-nets. Their main novelty is the presence of non-determinism in the cut-elimination procedure. This allowed Ehrhard and Laurent to prove that standard process calculi (e.g., pi-calculus, solos calculus) can be encoded into differential nets. However, such techniques exploit an ad-hoc treatment of reduction, which is needed to guarantee the existence of a bisimulation.<\/span><\/p>\n

In the first part of this talk (May 24th) we will introduce interaction nets, and then differential interaction nets as a special case. In the second part (May 25th), we will analyse differential nets from a “true concurrency” point of view (non-interleaving semantics, in particular based on event structures). We will see that differential nets are inherently less expressive than standard process calculi; we will then see how to enhance their expressivity.<\/span><\/p>\n<\/div>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n","protected":false},"author":1325,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[10,13],"tags":[],"class_list":["post-123","post","type-post","status-publish","format-standard","hentry","category-events","category-httpschemas-google-comsites2008announcement","category-10-id","category-13-id","post-seq-1","post-parity-odd","meta-position-corners","fix"],"_links":{"self":[{"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/posts\/123","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/users\/1325"}],"replies":[{"embeddable":true,"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/comments?post=123"}],"version-history":[{"count":1,"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/posts\/123\/revisions"}],"predecessor-version":[{"id":141,"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/posts\/123\/revisions\/141"}],"wp:attachment":[{"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/media?parent=123"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/categories?post=123"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/tags?post=123"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}