{"id":107,"date":"2013-04-15T16:43:22","date_gmt":"2013-04-15T15:43:22","guid":{"rendered":"http:\/\/sites.google.com\/feeds\/content\/site\/tcsunica\/5379059179544433496"},"modified":"2013-11-22T15:37:23","modified_gmt":"2013-11-22T14:37:23","slug":"seminar-lending-petri-nets-and-contracts","status":"publish","type":"post","link":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/2013\/04\/15\/seminar-lending-petri-nets-and-contracts\/","title":{"rendered":"Seminar: Lending Petri Nets (and contracts)"},"content":{"rendered":"
Upcoming Seminar<\/span>
<\/span><\/font><\/span><\/div><\/div>

Lending Petri Nets (and contracts)<\/b><\/font>

April 16, 15.00 (Aula F)
April 17, 11.00 (Lab. 5)<\/font>
Palazzo delle Scienze - Cagliari
<\/span><\/font><\/span><\/div><\/div>

<\/span><\/span><\/font><\/span>
G. Michele Pinna<\/b><\/font>
<\/span><\/b><\/span><\/font><\/span><\/div><\/div>
Dipartimento di Matematica e Informatica - Universit\u00e0 degli Studi di Cagliari<\/span><\/font>
<\/span><\/div><\/div>

Abstract.<\/b> In the first part of this seminar, we give a brief introduction to Petri nets, one of the <\/font>classical<\/font> models of distributed systems<\/font>. Petri nets have been applied in various<\/font> areas, among which the description and analysis of business processes.

In the second part, w<\/font><\/font><\/font><\/font><\/font><\/font><\/font><\/span><\/font><\/span>e present <\/span><\/font><\/span><\/font>Lending Petri n<\/b>ets<\/b>, <\/font><\/span><\/font><\/span><\/font>a variant of Petri nets which allows places to <\/font>"lend" tokens under the guarantee that credits will be honoured - <\/font>that is, lent tokens are eventually returned.<\/font><\/font>

Lending Petri nets are then exploited to model contracts<\/b> for business processes. <\/font>In particular, we show how they can be used to formalise contracts which <\/font><\/font><\/font><\/font><\/font><\/font>p<\/font><\/b><\/font>rotect<\/b> themselves while\nstill realizing the desired choreography. We relate Lending Petri nets with Propositional\nContract Logic<\/b>, by showing a translation of formulae into our Petri nets which\npreserves the logical notion of agreement, and allows for compositional\nverification.<\/span><\/font>
<\/span><\/font><\/div><\/td><\/tr><\/tbody><\/table><\/div>","protected":false},"excerpt":{"rendered":"\n\n\n
\n
\n
\n
\n
Upcoming Seminar<\/span>
<\/span><\/span><\/div>\n<\/div>\n

Lending Petri Nets (and contracts)<\/b><\/p>\n

April 16, 15.00 (Aula F)
April 17, 11.00 (Lab. 5)
Palazzo delle Scienze – Cagliari
<\/span><\/span><\/div>\n<\/div>\n


<\/span><\/span><\/span><\/p>\n
G. Michele Pinna<\/b>
<\/span><\/b><\/span><\/span><\/div>\n<\/div>\n
\n
Dipartimento di Matematica e Informatica – Università degli Studi di Cagliari<\/span>
<\/span><\/div>\n<\/div>\n



Abstract.<\/b> In the first part of this seminar, we give a brief introduction to Petri nets, one of the classical models of distributed systems. Petri nets have been applied in various areas, among which the description and analysis of business processes. <\/p>\n

In the second part, w<\/span><\/span>e present <\/span><\/span>Lending Petri n<\/b>ets<\/b>, <\/span><\/span>a variant of Petri nets which allows places to “lend” tokens under the guarantee that credits will be honoured – that is, lent tokens are eventually returned.<\/p>\n

Lending Petri nets are then exploited to model contracts<\/b> for business processes. In particular, we show how they can be used to formalise contracts which p<\/b>rotect<\/b> themselves while
\nstill realizing the desired choreography. We relate Lending Petri nets with Propositional
\nContract Logic<\/b>, by showing a translation of formulae into our Petri nets which
\npreserves the logical notion of agreement, and allows for compositional
\nverification.<\/span>
<\/span><\/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-107","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\/107","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=107"}],"version-history":[{"count":2,"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/posts\/107\/revisions"}],"predecessor-version":[{"id":135,"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/posts\/107\/revisions\/135"}],"wp:attachment":[{"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/media?parent=107"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/categories?post=107"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/dottorati.unica.it\/matematicaeinformatica\/wp-json\/wp\/v2\/tags?post=107"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}