Linear logic for nets with bounded resources

https://doi.org/10.1016/0168-0072(95)00015-1Get rights and content
Under an Elsevier user license
open archive

Abstract

In this paper we introduce a new type of nets with bounded types of distributed resources (BR-nets). Linear Logic to describe the behaviour of BR-nets is defined. It is based on Girard's Linear Logic but captures not only consumption of resources but their presence as well. Theorem of soundness and completeness of the proposed axiomatization is proved and the complexity of the provability problem is established for the general case and some particular ones.

Cited by (0)

This work was accomplished with the financial support of the Russian Foundation of Fundamental Researches (project code: 93-01-00490). The research described in this publication was made possible in part by Grant NYF000 from the International Science Foundation.