{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:11:54Z","timestamp":1761610314881,"version":"build-2065373602"},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":6053,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1997]]},"DOI":"10.1016\/s1571-0661(05)80475-x","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"227-247","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["Types as Processes, via Chu spaces"],"prefix":"10.1016","volume":"7","author":[{"given":"Vaughan R.","family":"Pratt","sequence":"first","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S1571-0661(05)80475-X_BIB1","doi-asserted-by":"crossref","first-page":"543","DOI":"10.2307\/2275407","article-title":"Games and full completeness for multiplicative linear logic","volume":"59","author":"Abramsky","year":"1994","journal-title":"Journal of Symbolic Logic"},{"year":"1990","series-title":"Process Algebra","author":"Baeten","key":"10.1016\/S1571-0661(05)80475-X_BIB2"},{"key":"10.1016\/S1571-0661(05)80475-X_BIB3","series-title":"volume 752 of Lecture Notes in Mathematics.","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0064579","article-title":"\u2217-Autonomous categories","author":"Barr","year":"1979"},{"key":"10.1016\/S1571-0661(05)80475-X_BIB4","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0168-0072(95)00017-8","article-title":"Linear L\u00e4uchli semantics","volume":"77","author":"Blute","year":"1996","journal-title":"Annals of Pure and Applied Logic"},{"key":"10.1016\/S1571-0661(05)80475-X_BIB5","article-title":"The shuffle Hopf algebra and noncommutative full completeness","author":"Blute","year":"1996","journal-title":"Submitted to J. Symbolic Logic"},{"key":"10.1016\/S1571-0661(05)80475-X_BIB6","series-title":"Logic in Computer Science","first-page":"208","article-title":"A categorical linear framework for Petri nets","author":"Brown","year":"1990"},{"key":"10.1016\/S1571-0661(05)80475-X_BIB7","doi-asserted-by":"crossref","unstructured":"C. Brown, D. Gurr, and V. de Paiva. A linear specification language for Petri nets. Technical Report DAIMI PB-363, Computer Science Department, Aarhus University, October 1991.","DOI":"10.7146\/dpb.v20i363.6594"},{"issue":"2","key":"10.1016\/S1571-0661(05)80475-X_BIB8","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1017\/S0960129500001286","article-title":"Temporal structures","volume":"1","author":"Casley","year":"1991","journal-title":"Math. Structures in Comp. Sci"},{"key":"10.1016\/S1571-0661(05)80475-X_BIB9","unstructured":"V. Gupta. Chu Spaces: A Model of Concurrency. PhD thesis, Stanford University, September 1994. Tech. Report, available as ftp:\/\/boole.stanford.edu\/pub\/gupthes.ps.Z."},{"key":"10.1016\/S1571-0661(05)80475-X_BIB10","doi-asserted-by":"crossref","unstructured":"V. Gupta and V.R. Pratt. Gates accept concurrent behavior. In Proc. 34th Ann. IEEE Symp. on Foundations of Comp. Sci., pages 62-71, November 1993.","DOI":"10.1109\/SFCS.1993.366881"},{"key":"10.1016\/S1571-0661(05)80475-X_BIB11","article-title":"Fair games and full completeness for multiplicative linear logic without the mix-rule","author":"Hyland","year":"1993","journal-title":"Available by ftp from ftp.comlab.ox.ac.uk as fcomplete.ps.gz in\/pub\/Documents\/techpapers\/Luke.Ong"},{"issue":"80","key":"10.1016\/S1571-0661(05)80475-X_BIB12","first-page":"1192","article-title":"Representation problems for relation algebras","volume":"54","author":"J\u00f3nsson","year":"1948","journal-title":"Bull. Amer. Math. Soc"},{"key":"10.1016\/S1571-0661(05)80475-X_BIB13","doi-asserted-by":"crossref","first-page":"127","DOI":"10.2307\/2372074","article-title":"Boolean algebras with operators., Part II","volume":"74","author":"J\u00f3nsson","year":"1952","journal-title":"Amer. J. Math"},{"key":"10.1016\/S1571-0661(05)80475-X_BIB14","doi-asserted-by":"crossref","unstructured":"Y. Lafont and T. Streicher. Games semantics for linear logic. In Proc. 6th Annual IEEE Symp. on Logic in Computer Science, pages 43-49, Amsterdam, July 1991.","DOI":"10.1109\/LICS.1991.151629"},{"key":"10.1016\/S1571-0661(05)80475-X_BIB15","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1090\/S0002-9947-1945-0012204-1","article-title":"On infinite dimensional vector spaces","volume":"57","author":"Mackey","year":"1945","journal-title":"Trans. Amer. Math. Soc"},{"key":"10.1016\/S1571-0661(05)80475-X_BIB16","doi-asserted-by":"crossref","unstructured":"A. Mazurkiewicz. Concurrent program schemas and their interpretation. In Proc. Aarhus Workshop on Verification of Parallel Programs, 1977.","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"10.1016\/S1571-0661(05)80475-X_BIB17","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","article-title":"Petri nets, event structures, and domains, part I","volume":"13","author":"Nielsen","year":"1981","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80475-X_BIB18","unstructured":"C. A. Petri. Fundamentals of a theory of asynchronous information flow. In Proc. IFIP Congress 62, pages 386-390, Munich, 1962. North-Holland, Amsterdam."},{"key":"10.1016\/S1571-0661(05)80475-X_BIB19","doi-asserted-by":"crossref","unstructured":"V.R. Pratt. On the composition of processes. In Proceedings of the Ninth Annual ACM Symposium on Principles of Programming Languages, January 1982.","DOI":"10.1145\/582153.582177"},{"key":"10.1016\/S1571-0661(05)80475-X_BIB20","doi-asserted-by":"crossref","unstructured":"V.R. Pratt. Some constructions for order-theoretic models of concurrency. In Proc. Conf. on Logics of Programs, volume 193 of Lecture Notes in Computer Science, pages 269-283, Brooklyn, 1985. Springer-Verlag.","DOI":"10.1007\/3-540-15648-8_22"},{"issue":"1","key":"10.1016\/S1571-0661(05)80475-X_BIB21","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF01379149","article-title":"Modeling concurrency with partial orders","volume":"15","author":"Pratt","year":"1986","journal-title":"Int. J. of Parallel Programming"},{"key":"10.1016\/S1571-0661(05)80475-X_BIB22","doi-asserted-by":"crossref","unstructured":"V.R. Pratt. Modeling concurrency with geometry. In Proc. 18th Ann. ACM Symposium on Principles of Programming Languages, pages 311-322, January 1991.","DOI":"10.1145\/99583.99625"},{"key":"10.1016\/S1571-0661(05)80475-X_BIB23","doi-asserted-by":"crossref","unstructured":"V.R. Pratt. The second calculus of binary relations. In Proceedings of MFCS'93, volume 711 of Lecture Notes in Computer Science, pages 142-155, Gdansk, Poland, 1993. Springer-Verlag.","DOI":"10.1007\/3-540-57182-5_9"},{"key":"10.1016\/S1571-0661(05)80475-X_BIB24","series-title":"Logic in Computer Science","first-page":"444","article-title":"The Stone gamut: A coordinatization of mathematics","author":"Pratt","year":"1995"},{"key":"10.1016\/S1571-0661(05)80475-X_BIB25","series-title":"Special Issue on Linear Logic 96, volume 3 of ENTCS (Electronic Notes of Theoretical Computer Science), Tokyo","article-title":"Broadening the denotational semantics of linear logic","author":"Pratt","year":"1996"},{"key":"10.1016\/S1571-0661(05)80475-X_BIB26","series-title":"Electronic Notes in Theoretical Computer Science, volume 6, Pittsburgh","first-page":"18","article-title":"Towards full completeness of the linear logic of chu spaces","author":"Pratt","year":"1997"},{"key":"10.1016\/S1571-0661(05)80475-X_BIB27","series-title":"Logic in Computer Science","first-page":"199","article-title":"Configuration structures","author":"Van Glabbeek","year":"1995"},{"key":"10.1016\/S1571-0661(05)80475-X_BIB28","series-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, REX'88, volume 354 of Lecture Notes in Computer Science","article-title":"An introduction to event structures","author":"Winskel","year":"1988"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610580475X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610580475X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:07:02Z","timestamp":1761610022000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S157106610580475X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"references-count":28,"alternative-id":["S157106610580475X"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80475-x","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Types as Processes, via Chu spaces","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80475-X","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1997 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}