Linear Constraint Systems as High-level Nets (1996)
Cached
Download Links
- [www.disi.unige.it]
- [theoretica.informatik.uni-oldenburg.de]
- DBLP
Other Repositories/Bibliography
| Venue: | Proc. CONCUR'96. Springer LNCS 1119 |
| Citations: | 2 - 1 self |
BibTeX
@INPROCEEDINGS{Best96linearconstraint,
author = {Eike Best and Catuscia Palamidessi},
title = {Linear Constraint Systems as High-level Nets},
booktitle = {Proc. CONCUR'96. Springer LNCS 1119},
year = {1996},
pages = {498--513}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Linear constraint systems are simple deductive systems based on the main underlying idea of linear logic: hypotheses represent physical resources which are consumed by the entailment relation. For such systems, we define back-and-forth translations into a class of high-level Petri nets. Using the specific properties of that class of nets, and previous results about the complexity of the reachability problem for such nets, we examine the complexity of the entailment problem for finitely generated linear constraint systems and we show that it is NP-complete.
