Affordable Access

Publisher Website

Linear logic for nets with bounded resources

Authors
Journal
Annals of Pure and Applied Logic
0168-0072
Publisher
Elsevier
Publication Date
Volume
78
Identifiers
DOI: 10.1016/0168-0072(95)00015-1

Abstract

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.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Interaction nets for linear logic

on Theoretical Computer Science Jan 01, 2000

Linear logic with fixed resources

on Annals of Pure and Applied Log... Jan 01, 1994

Petri nets, Horn programs, Linear Logic and vector...

on Annals of Pure and Applied Log... Jan 01, 1995
More articles like this..