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