{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,23]],"date-time":"2024-01-23T22:59:57Z","timestamp":1706050797385},"reference-count":36,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,4,1]],"date-time":"1996-04-01T00:00:00Z","timestamp":828316800000},"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":6316,"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":[[1996,4]]},"DOI":"10.1016\/0168-0072(95)00035-6","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T17:18:06Z","timestamp":1051723086000},"page":"147-188","source":"Crossref","is-referenced-by-count":3,"title":["Linear logic automata"],"prefix":"10.1016","volume":"78","author":[{"given":"Max I.","family":"Kanovich","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0168-0072(95)00035-6_BIB1","article-title":"omputational interpretation of linear logic","author":"Abramsky","year":"1990","journal-title":"Imperial College Research Report DOC 90\/20"},{"key":"10.1016\/0168-0072(95)00035-6_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(95)00035-6_BIB3","article-title":"A logic for concurrency","author":"Asperti","year":"1987"},{"key":"10.1016\/0168-0072(95)00035-6_BIB4","series-title":"Proc. 17th ACM Symp. on Principles of Programming Languages","first-page":"59","article-title":"Implicative formulae in the proofs as computations' analogy","author":"Asperti","year":"1990"},{"key":"10.1016\/0168-0072(95)00035-6_BIB5","article-title":"Relating Petri nets to formulas of linear logic","author":"Brown","year":"1989"},{"key":"10.1016\/0168-0072(95)00035-6_BIB6","series-title":"A Discipline of Programming","author":"Dijkstra","year":"1976"},{"key":"10.1016\/0168-0072(95)00035-6_BIB7","series-title":"Current Trends in Programming Methodology","first-page":"233","article-title":"Guarded commands, nondeterminacy and formal derivation of programs","volume":"Vol. 1","author":"Dijkstra","year":"1977"},{"key":"10.1016\/0168-0072(95)00035-6_BIB8","series-title":"Proc. 5th Ann. IEEE Symp. on Logic in Computer Science","article-title":"Normal process representatives","author":"Gehlot","year":"1990"},{"issue":"1","key":"10.1016\/0168-0072(95)00035-6_BIB9","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(95)00035-6_BIB10","series-title":"Logic and Algebra of Specification","article-title":"Linear logic: a survey","volume":"F 94","author":"Girard","year":"1993"},{"key":"10.1016\/0168-0072(95)00035-6_BIB11","series-title":"Proc. of TAPSOFT 87","first-page":"52","article-title":"Linear logic and lazy computation","volume":"257","author":"Girard","year":"1987"},{"key":"10.1016\/0168-0072(95)00035-6_BIB12","article-title":"Proofs and types","volume":"7","author":"Girard","year":"1989"},{"key":"10.1016\/0168-0072(95)00035-6_BIB13","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(95)00035-6_BIB14","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"},{"issue":"10","key":"10.1016\/0168-0072(95)00035-6_BIB15","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","article-title":"An axiomatic approach to computer programming","volume":"12","author":"Hoare","year":"1969","journal-title":"CACM"},{"key":"10.1016\/0168-0072(95)00035-6_BIB16","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0304-3975(79)90041-0","article-title":"On the reachability problem for 5-dimensional vector addition systems","volume":"8","author":"Hopcroft","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0168-0072(95)00035-6_BIB17","series-title":"Proc. 7th Annual IEEE Symp. 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(95)00035-6_BIB18","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(95)00035-6_BIB19","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0168-0072(94)90085-X","volume":"69","author":"Kanovich","year":"1994","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0168-0072(95)00035-6_BIB20","series-title":"Proc. Internat. Symp. Theoretical Aspects of Computer Software, TACS'94","first-page":"642","article-title":"Petri nets, Horn programs, linear logic, and vector games","volume":"789","author":"Kanovich","year":"1994"},{"key":"10.1016\/0168-0072(95)00035-6_BIB21","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(95)00035-6_BIB22","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. System Sci."},{"key":"10.1016\/0168-0072(95)00035-6_BIB23","series-title":"Proc. 14th Annual Symp. 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(95)00035-6_BIB24","doi-asserted-by":"crossref","first-page":"295","DOI":"10.4153\/CMB-1961-032-6","article-title":"How to program an infinite abacus","volume":"4","author":"Lambek","year":"1961","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/0168-0072(95)00035-6_BIB25","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(95)00035-6_BIB26","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(95)00035-6_BIB27","first-page":"313","article-title":"From Petri nets to linear logic","volume":"389","author":"Marti-Oliet","year":"1989"},{"issue":"3","key":"10.1016\/0168-0072(95)00035-6_BIB28","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(95)00035-6_BIB29","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. in Math."},{"issue":"4","key":"10.1016\/0168-0072(95)00035-6_BIB30","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1145\/367177.367199","article-title":"Recursive functions of symbolic expressions and their computation by machine","volume":"3","author":"McCarthy","year":"1960","journal-title":"CACM"},{"issue":"3","key":"10.1016\/0168-0072(95)00035-6_BIB31","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(95)00035-6_BIB32","first-page":"541","article-title":"Petri Nets: Properties, analysis, and applications","volume":"77","author":"Murata","year":"1989"},{"key":"10.1016\/0168-0072(95)00035-6_BIB33","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(95)00035-6_BIB34","series-title":"Current Trends in Theoretical Computer Science","first-page":"377","article-title":"A brief guide to linear logic","author":"Scedrov","year":"1993"},{"key":"10.1016\/0168-0072(95)00035-6_BIB35","series-title":"Senkei Ronri Nyuumon","author":"Takeuti","year":"1995"},{"key":"10.1016\/0168-0072(95)00035-6_BIB36","article-title":"Lectures on Linear Logic","volume":"29","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:0168007295000356?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0168007295000356?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T04:29:12Z","timestamp":1555561752000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0168007295000356"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,4]]},"references-count":36,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,4]]}},"alternative-id":["0168007295000356"],"URL":"https:\/\/doi.org\/10.1016\/0168-0072(95)00035-6","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1996,4]]}}}