Petri Nets, Horn Programs, Linear Logic and Vector Games

Abstract Linear Logic was introduced by Girard as a resource-sensitive refinement of classical logic. In this paper we establish strong connections between natural fragments of Linear Logic and a number of basic concepts related to different branches of Computer Science such as Concurrency Theory, Theory of Computations, Horn Programming and Game Theory. In particular, such complete correlations allow us to introduce several new semantics for Linear Logic and to clarify many results on the complexity of natural fragments of Linear Logic. As a main corollary, any non-deterministic and concurrent computation (e.g., computations performed by non-deterministic Minsky machines) is proved to be simulated directly within the framework of each of these systems.

[1]  José Meseguer,et al.  Petri Nets Are Monoids , 1990, Inf. Comput..

[2]  Jean-Yves Girard,et al.  Linear Logic and Lazy Computation , 1987, TAPSOFT, Vol.2.

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Ugo Montanari,et al.  Axiomatizing net computations and processes , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[5]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[6]  Jean-Yves Girard,et al.  A new constructive logic: classic logic , 1991, Mathematical Structures in Computer Science.

[7]  Richard M. Karp,et al.  Parallel Program Schemata , 1969, J. Comput. Syst. Sci..

[8]  Carl A. Gunter,et al.  Normal process representatives , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[9]  A. Troelstra.  Lectures on linear logic , 1992 .

[10]  Natarajan Shankar,et al.  Linearizing intuitionistic implication , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[11]  Radha Jagadeesan,et al.  Games and Full Completeness for Multiplicative Linear Logic , 1994, J. Symb. Log..

[12]  Max I. Kanovich,et al.  Petri Nets, Horn Programs, Linear Logic, and Vector Games , 1994, TACS.

[13]  Simon L. Peyton Jones,et al.  Imperative functional programming , 1993, POPL '93.

[14]  A. Meyer,et al.  The complexity of the word problems for commutative semigroups and polynomial ideals , 1982 .

[15]  Johan van Benthem,et al.  Language in action , 1991, J. Philos. Log..

[16]  Jean-Yves Girard,et al.  Linear Logic: A Survey , 1993 .

[17]  Jean-Yves Girard,et al.  On the Unity of Logic , 1993, Ann. Pure Appl. Log..

[18]  Vaughan R. Pratt,et al.  Event Spaces and their Linear Logic , 1991, AMAST.

[19]  Andreas Blass,et al.  A Game Semantics for Linear Logic , 1992, Ann. Pure Appl. Log..

[20]  Samson Abramsky,et al.  Computational Interpretations of Linear Logic , 1993, Theor. Comput. Sci..

[21]  Max I. Kanovich.  Horn programming in linear logic is NP-complete , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[22]  Carl A. Gunter,et al.  Nets as Tensor Theories , 1989 .

[23]  M. Minsky.  Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines , 1961 .

[24]  AbramskySamson,et al.  Games and full completeness for multiplicative linear logic , 1994 .

[25]  Max I. Kanovich,et al.  The Complexity of Horn Fragments of Linear Logic , 1994, Ann. Pure Appl. Log..

[26]  Thomas Streicher,et al.  Games semantics for linear logic , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[27]  John W. Gray,et al.  Categories in Computer Science and Logic , 1989 .

[28]  Ernst W. Mayr.  An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..

[29]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[30]  Narciso Martí-Oliet,et al.  From Petri nets to linear logic , 1989, Mathematical Structures in Computer Science.

[31]  Roberto Gorrieri,et al.  Implicative formulae in the proofs of computations' analogy , 1989, POPL '90.

[32]  Max I. Kanovich,et al.  Linear Logic as a Logic of Computations , 1994, Ann. Pure Appl. Log..

[33]  M. Nivat.  Fiftieth volume of theoretical computer science , 1988 .

[34]  S. Rao Kosaraju,et al.  Decidability of reachability in vector addition systems (Preliminary Version) , 1982, STOC '82.

[35]  Max I. Kanovich.  Computational and Concurrency Aspects of Linear Logic , 1994, IFIP Congress.

[36]  Andre Scedrov,et al.  Bounded Linear Logic: A Modular Approach to Polynomial-Time Computability , 1992, Theor. Comput. Sci..