In: Annals of pure and applied logic, Vol. 67, No. 1-3, pages 183-212. 1994.
Abstract: The question at issue is to develop a computational interpretation of linear logic and to establish exactly its expressive power. We follow the bottom-up approach. This involves starting with the simplest of the systems we are interested in, and then expanding them step-by-step.
Keywords: Petri nets, linear logic, reachability problem.