Debits and Credits in Petri Nets and Linear Logic

Exchanging resources often involves situations where a participant gives a resource without obtaining immediately the expected reward. For instance, one can buy an item without paying it in advance, but contracting a debt which must be eventually honoured. Resources, credits and debits can be represented, either implicitly or explicitly, in several formal models, among which Petri nets and linear logic. In this paper we study the relations between two of these models, namely intuitionistic linear logic with mix and Debit Petri nets. In particular, we establish a natural correspondence between provability in the logic, and marking reachability in nets.

[1]  M. Nivat Fiftieth volume of theoretical computer science , 1988 .

[2]  Max I. Kanovich,et al.  Phase semantics for light linear logic , 2003, Theor. Comput. Sci..

[3]  Mahesh Viswanathan,et al.  Foundations for Circular Compositional Reasoning , 2001, ICALP.

[4]  Jean-Yves Girard,et al.  Linear Logic , 1987, Theor. Comput. Sci..

[5]  A. W. Roscoe,et al.  Topology and category theory in computer science , 1991 .

[6]  José Meseguer,et al.  An algebraic axiomatization of linear logic models , 1991 .

[7]  G. Michele Pinna,et al.  Contracts as games on event structures , 2016, J. Log. Algebraic Methods Program..

[8]  Massimo Bartoletti,et al.  A Calculus of Contracting Processes , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[9]  Glynn Winskel,et al.  Completeness Results for Linear Logic on Petri Nets , 1993, Ann. Pure Appl. Log..

[10]  G. Michele Pinna,et al.  Circular Causality in Event Structures , 2014, Fundam. Informaticae.

[11]  G. Michele Pinna,et al.  Lending Petri nets , 2015, Sci. Comput. Program..

[12]  Wolfgang Reisig Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[13]  Max I. Kanovich,et al.  Petri Nets, Horn Programs, Linear Logic and Vector Games , 1995, Ann. Pure Appl. Log..

[14]  Keiko Ishihara,et al.  The Completeness of Linear Logic for Petri Net Models , 1998, Log. J. IGPL.

[15]  Christian Retoré,et al.  The mix rule , 1994, Mathematical Structures in Computer Science.

[16]  Narciso Martí-Oliet,et al.  From Petri nets to linear logic , 1989, Mathematical Structures in Computer Science.

[17]  Roberto Gorrieri,et al.  Implicative formulae in the proofs of computations' analogy , 1989, POPL '90.

[18]  Patrick Maier Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete , 2003, FoSSaCS.

[19]  Massimo Bartoletti,et al.  Vicious circles in contracts and in logic , 2015, Sci. Comput. Program..

[20]  Glynn Winskel,et al.  Completeness Results for Linear Logic on Petri Nets , 1997, Ann. Pure Appl. Log..

[21]  Max I. Kanovich,et al.  Linear Logic as a Logic of Computations , 1994, Ann. Pure Appl. Log..

[22]  José Meseguer,et al.  From Petri Nets to Linear Logic , 1989, Category Theory and Computer Science.

[23]  P. David Stotts,et al.  Place/Transition Nets with Debit Arcs , 1992, Inf. Process. Lett..

[24]  G. Michele Pinna,et al.  Lending Petri nets , 2012, Sci. Comput. Program..

[25]  Norihiro Kamide Linear Logics with Communication-merge , 2005, J. Log. Comput..