{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:25Z","timestamp":1761611065655},"reference-count":47,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6529,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[1995,9]]},"DOI":"10.1016\/0168-0072(94)00060-g","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T18:40:50Z","timestamp":1052764850000},"page":"107-135","source":"Crossref","is-referenced-by-count":21,"title":["Petri nets, Horn programs, Linear Logic and vector games"],"prefix":"10.1016","volume":"75","author":[{"given":"Max I.","family":"Kanovich","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0168-0072(94)00060-G_BIB1","article-title":"Computational interpretations of linear logic","author":"Abramsky","year":"1990","journal-title":"Imperial College Research Report DOC 90\/20"},{"key":"10.1016\/0168-0072(94)00060-G_BIB2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(93)90181-R","article-title":"Computational interpretations of Linear Logic","volume":"111","author":"Abramsky","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0168-0072(94)00060-G_BIB3","article-title":"Games and full completeness for multiplicative Linear Logic","author":"Abramsky","year":"1992","journal-title":"Imperial College Technical Report DOC 92\/24"},{"key":"10.1016\/0168-0072(94)00060-G_BIB4","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1976"},{"key":"10.1016\/0168-0072(94)00060-G_BIB5","article-title":"A logic for concurrency","author":"Asperti","year":"1987"},{"key":"10.1016\/0168-0072(94)00060-G_BIB6","series-title":"Proc. 17th ACM Symposium on Principles of Programming Languages","first-page":"59","article-title":"Implicative formulae in the \u2018proofs as computations\u2019 analogy","author":"Asperti","year":"1990"},{"key":"10.1016\/0168-0072(94)00060-G_BIB7","series-title":"Language in Action","author":"van Benthem","year":"1991"},{"key":"10.1016\/0168-0072(94)00060-G_BIB8","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0168-0072(92)90073-9","article-title":"A game semantics for linear logic","volume":"56","author":"Blass","year":"1992","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0168-0072(94)00060-G_BIB9","article-title":"Relating Petri nets to formulas of Linear Logic","author":"Brown","year":"1989"},{"key":"10.1016\/0168-0072(94)00060-G_BIB10","series-title":"Proc. 4th Annual IEEE Symposium on Logic in Computer Science","first-page":"175","article-title":"Axiomatizing net computations and processes","author":"Degano","year":"1989"},{"key":"10.1016\/0168-0072(94)00060-G_BIB11","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0168-0072(94)00060-G_BIB12","series-title":"Proc. 5th Annual IEEE Symposium on Logic in Computer Science","article-title":"Normal process representatives","author":"Gehlot","year":"1990"},{"issue":"1","key":"10.1016\/0168-0072(94)00060-G_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","article-title":"Linear logic","volume":"50","author":"Girard","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0168-0072(94)00060-G_BIB14","first-page":"69","article-title":"Towards a geometry of interaction, Categories in Computer Science and Logic","volume":"92","author":"Girard","year":"1989"},{"key":"10.1016\/0168-0072(94)00060-G_BIB15","series-title":"Logic Colloquium 88","article-title":"Geometry of interaction I: interpretation of system F","author":"Girard","year":"1989"},{"key":"10.1016\/0168-0072(94)00060-G_BIB16","doi-asserted-by":"crossref","unstructured":"J.-Y. Girard, Geometry of interaction II: deadlock-free algorithms, in: Martin-L\u00f6f and Mints, eds., Proc. COLOG'88, Springer Lecture Notes in Theoretical Computer Science 417, 76\u201393.","DOI":"10.1007\/3-540-52335-9_49"},{"issue":"3","key":"10.1016\/0168-0072(94)00060-G_BIB17","doi-asserted-by":"crossref","DOI":"10.1017\/S0960129500001328","article-title":"A new constructive logic: classical logic","volume":"1","author":"Girard","year":"1991","journal-title":"Mathematical Structures in Computer Science"},{"issue":"3","key":"10.1016\/0168-0072(94)00060-G_BIB18","doi-asserted-by":"crossref","DOI":"10.1016\/0168-0072(93)90093-S","article-title":"On the unity of logic","volume":"59","author":"Girard","year":"1993","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0168-0072(94)00060-G_BIB19","series-title":"Logic and Algebra of Specification","article-title":"Linear logic: a survey","volume":"94","author":"Girard","year":"1993"},{"key":"10.1016\/0168-0072(94)00060-G_BIB20","unstructured":"J.-Y. Girard, Geometry of interaction III: the general case, Proc. Workshop on Linear Logic (MIT Press, Cambridge, MA) to appear."},{"key":"10.1016\/0168-0072(94)00060-G_BIB21","series-title":"Proc. TAPSOFT 87","first-page":"52","article-title":"Linear logic and lazy computation","volume":"257","author":"Girard","year":"1987"},{"key":"10.1016\/0168-0072(94)00060-G_BIB22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(92)90386-T","article-title":"Bounded Linear Logic: A modular approach to polynomial-time computability","volume":"97","author":"Girard","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0168-0072(94)00060-G_BIB23","series-title":"Proc. 10th Internat. Conf. on Application and Theory of Petri Nets","first-page":"174","article-title":"Nets as tensor theories","author":"Gunter","year":"1989"},{"key":"10.1016\/0168-0072(94)00060-G_BIB24","article-title":"The multiplicative fragment of Linear Logic is NP-complete","author":"Kanovich","year":"1991","journal-title":"Univ. Amsterdam, Institute for Logic, Language and Computation, ILLC Prepublication Series X-91-13"},{"key":"10.1016\/0168-0072(94)00060-G_BIB25","article-title":"The Horn fragment of Linear Logic is NP-complete","author":"Kanovich","year":"1991","journal-title":"Univ. Amsterdam, Institute for Logic, Language and Computation, ILLC Prepublication Series X-91-14"},{"key":"10.1016\/0168-0072(94)00060-G_BIB26","series-title":"Proc. 7th Annual IEEE Symposium on Logic in Computer Science","first-page":"200","article-title":"Horn programming in Linear Logic is NP-complete","author":"Kanovich","year":"1992"},{"key":"10.1016\/0168-0072(94)00060-G_BIB27","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0168-0072(94)90011-6","article-title":"Linear logic as a logic of computations","volume":"67","author":"Kanovich","year":"1994","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0168-0072(94)00060-G_BIB28","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0168-0072(94)90085-X","article-title":"The complexity of Horn fragments of Linear Logic","volume":"69","author":"Kanovich","year":"1994","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0168-0072(94)00060-G_BIB29_1","series-title":"Proc. Internat. Symp. Theoretical Aspects of Computer Software, TACS'94","article-title":"Petri Nets, Horn Programs, Linear Logic and Vector Games","author":"Kanovich","year":"1994"},{"key":"10.1016\/0168-0072(94)00060-G_BIB29_2","first-page":"642","volume":"789","author":"Kanovich","year":"1994"},{"key":"10.1016\/0168-0072(94)00060-G_BIB30","series-title":"Proc. IFIP 13th World Computer Congress","first-page":"336","article-title":"Computational and concurrency aspects of Linear Logic","volume":"Vol. 1","author":"Kanovich","year":"1994"},{"key":"10.1016\/0168-0072(94)00060-G_BIB31","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","article-title":"Parallel program schemata","volume":"3","author":"Karp","year":"1969","journal-title":"J. Comput. and System Sci."},{"key":"10.1016\/0168-0072(94)00060-G_BIB32","series-title":"Proc. 14th Annual Symposium on Theory of Computing","first-page":"267","article-title":"Decidability of reachability in vector addition systems","author":"Kosaraju","year":"1982"},{"key":"10.1016\/0168-0072(94)00060-G_BIB33","series-title":"Proc. 6th Annual IEEE Symp. on Logic in Comput. Sci.","first-page":"43","article-title":"Games semantics for linear logic","author":"Lafont","year":"1991"},{"key":"10.1016\/0168-0072(94)00060-G_BIB34_1","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0168-0072(92)90075-B","article-title":"Decision problems for propositional Linear Logic","volume":"56","author":"Lincoln","year":"1992","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0168-0072(94)00060-G_BIB34_2","author":"Lincoln","year":"1990"},{"key":"10.1016\/0168-0072(94)00060-G_BIB35","series-title":"Proc. 31st IEEE Symp. on Foundations of Computer Science","first-page":"662","article-title":"Decision problems for propositional Linear Logic","author":"Lincoln","year":"1990"},{"key":"10.1016\/0168-0072(94)00060-G_BIB36","series-title":"Proc. 6th Annual IEEE Symp. on Logic in Computer Sci.","first-page":"51","article-title":"Linearizing intuitionistic implication","author":"Lincoln","year":"1991"},{"key":"10.1016\/0168-0072(94)00060-G_BIB37","series-title":"Constant multiplicative Linear Logic is NP-complete, draft","author":"Lincoln","year":"1992"},{"key":"10.1016\/0168-0072(94)00060-G_BIB38","first-page":"313","article-title":"From Petri Nets to Linear Logic","author":"Marti-Oliet","year":"1989"},{"issue":"3","key":"10.1016\/0168-0072(94)00060-G_BIB39","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1137\/0213029","article-title":"An algorithm for the general Petri net reachability problem","volume":"13","author":"Mayr","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0168-0072(94)00060-G_BIB40","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0001-8708(82)90048-2","article-title":"The complexity of the word problems for commutative semigroups and polynomial ideals","volume":"46","author":"Mayr","year":"1982","journal-title":"Adv. Math."},{"key":"10.1016\/0168-0072(94)00060-G_BIB41_1","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0890-5401(90)90013-8","article-title":"Petri nets are monoids","volume":"88","author":"Meseguer","year":"1990","journal-title":"Inform. and Computation"},{"key":"10.1016\/0168-0072(94)00060-G_BIB41_2","author":"Meseguer","year":"1988"},{"issue":"3","key":"10.1016\/0168-0072(94)00060-G_BIB42","doi-asserted-by":"crossref","first-page":"437","DOI":"10.2307\/1970290","article-title":"Recursive unsolvability of Post's problem of \u2018tag\u2019 and other topics in the theory of Turing machines","volume":"74","author":"Minsky","year":"1961","journal-title":"Ann. Math."},{"key":"10.1016\/0168-0072(94)00060-G_BIB43","series-title":"AMAST '91: Algebraic Methodology and Software Technology, Iowa City, 1991, Workshops in Computing","first-page":"1","article-title":"Event spaces and their linear logic","author":"Pratt","year":"1992"},{"key":"10.1016\/0168-0072(94)00060-G_BIB44","article-title":"Lectures on Linear Logic","author":"Troelstra","year":"1992"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800729400060G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800729400060G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,12]],"date-time":"2020-01-12T04:38:20Z","timestamp":1578803900000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016800729400060G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":47,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["016800729400060G"],"URL":"https:\/\/doi.org\/10.1016\/0168-0072(94)00060-g","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}