News‎ > ‎

Lending Petri Nets

posted May 14, 2015, 12:11 PM by Massimo Bartoletti
Upcoming paper (to appear in Science of Computer Programming)

M. Bartoletti, T. Cimoli, G. M. Pinna

Abstract. We study Lending Petri nets, an extension of Petri nets where places may carry a negative number of tokens. This allows for modeling contracts where a participant may promise to give some of her resources under the guarantee that some other resources will eventually be obtained in exchange. We then propose an interpretation of the Horn fragment of Propositional Contract Logic in Lending Petri nets. In particular, we show that provability in the logic corresponds to reachability of certain markings in nets, and that proof traces correspond to “honored” firing sequences in nets.