{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:12:02Z","timestamp":1761610322420,"version":"build-2065373602"},"reference-count":24,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"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":3923,"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":[[2002,11]]},"DOI":"10.1016\/s1571-0661(04)80501-2","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"70-85","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"title":["Concrete Process Categories"],"prefix":"10.1016","volume":"68","author":[{"given":"Krzysztof","family":"Worytkiewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80501-2_NEWBIB1","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-60915-6_2","article-title":"Specification structures and propositions-as-types for concurrency","volume":"1043","author":"Abramsky","year":"1996","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/S1571-0661(04)80501-2_NEWBIB2","unstructured":"Samson Abramsky, Simon J. Gay, and Rajagopal Nagarajan. Interaction categories and the foundations of typed concurrent programming. In M. Broy, editor, Deductive Program Design: Proceedings of the 1994 Marktoberdorf Summer School, NATO ASI Series F: Computer and System Sciences. Springer, 1994."},{"key":"10.1016\/S1571-0661(04)80501-2_NEWBIB3","doi-asserted-by":"crossref","unstructured":"Samson Abramsky, Radha Jagadeesan, and Pasquale Malacaria. Full abstraction for PCF (extended abstract). In Proceedings of TACS '94. Springer, 1994.","DOI":"10.1007\/3-540-57887-0_87"},{"key":"10.1016\/S1571-0661(04)80501-2_NEWBIB4","doi-asserted-by":"crossref","DOI":"10.1006\/inco.1996.0057","article-title":"Bisimulation and open maps","author":"Joyal","year":"1996","journal-title":"Information and Computation"},{"year":"1984","series-title":"Toposes, Triples and Theories","author":"Barr","key":"10.1016\/S1571-0661(04)80501-2_NEWBIB5"},{"key":"10.1016\/S1571-0661(04)80501-2_NEWBIB6","doi-asserted-by":"crossref","unstructured":"Jean B\u00e9nabou. Introduction to Bicategories, volume 47 of Lecture Notes in Mathematics. Springer, 1967.","DOI":"10.1007\/BFb0074299"},{"issue":"1","key":"10.1016\/S1571-0661(04)80501-2_NEWBIB7","doi-asserted-by":"crossref","DOI":"10.1145\/942578.807068","article-title":"An algebraic description of programs with assertions, verification and simulation","volume":"7","author":"Burstall","year":"1972","journal-title":"ACM SIGPLAN Notices"},{"key":"10.1016\/S1571-0661(04)80501-2_NEWBIB8","doi-asserted-by":"crossref","unstructured":"J. R. B. Cockett and D. A. Spooner. SPROC categorically. In CONCUR 94: Fifth Internation Conference on Concurrency Theory, Uppsala, Sweden, Lecture Notes in Computer Science. Springer-Verlag, 1994.","DOI":"10.1007\/978-3-540-48654-1_13"},{"issue":"1","key":"10.1016\/S1571-0661(04)80501-2_NEWBIB9","doi-asserted-by":"crossref","DOI":"10.1016\/S0304-3975(97)87171-X","article-title":"Constructing process categories","volume":"177","author":"Cockett","year":"1997","journal-title":"Theoretical Computer Science"},{"year":"1976","series-title":"A Discipline of Programming","author":"Dijkstra","key":"10.1016\/S1571-0661(04)80501-2_NEWBIB10"},{"key":"10.1016\/S1571-0661(04)80501-2_NEWBIB11","unstructured":"Lindsay Erington. Twisted Systems. PhD thesis, Department of Computing, Imperial College, London, 1999."},{"issue":"3","key":"10.1016\/S1571-0661(04)80501-2_NEWBIB12","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1017\/S0960129597002284","article-title":"Structured transition systems with parametric observations: observational congruences and minimal realizations","volume":"7","author":"Ferrari","year":"1997","journal-title":"Mathematical Structures in Computer Science"},{"key":"10.1016\/S1571-0661(04)80501-2_NEWBIB13","doi-asserted-by":"crossref","unstructured":"Marcelo Fiore. Fibred models of processes: Discrete, continuous, and hybrid systems. In Proceedings of the IFIP TCS2000 Conference, pages 457\u2013473. Springer-Verlag, 2000.","DOI":"10.1007\/3-540-44929-9_32"},{"key":"10.1016\/S1571-0661(04)80501-2_NEWBIB14","unstructured":"Simon Gay. Linear Types for Communicating Processes. PhD thesis, University of London, 1995."},{"key":"10.1016\/S1571-0661(04)80501-2_NEWBIB15","unstructured":"J Goguen. A categorial manifesto. Technical Report PRG-72, Programming Research Group, University of Oxford, March 1989."},{"key":"10.1016\/S1571-0661(04)80501-2_NEWBIB16","doi-asserted-by":"crossref","unstructured":"J. W. Gray. Proceedings of the Conference on Categorical Algebra, La Jolla, chapter Fibered and Cofibered Categories, pages 21\u201383. Springer, 1966.","DOI":"10.1007\/978-3-642-99902-4_2"},{"key":"10.1016\/S1571-0661(04)80501-2_NEWBIB17","first-page":"307","article-title":"Span(graph): A categorial algebra of transition systems","author":"Katis","year":"1997","journal-title":"AMAST 1997"},{"issue":"3","key":"10.1016\/S1571-0661(04)80501-2_NEWBIB18","first-page":"219","article-title":"An introduction to Input\/Output automata","volume":"2","author":"Nancy Lynch","year":"1989","journal-title":"CWI-Quarterly"},{"key":"10.1016\/S1571-0661(04)80501-2_NEWBIB19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","article-title":"A calculus of mobile processes (Parts I and II)","volume":"100","author":"Milner","year":"1992","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)80501-2_NEWBIB20","doi-asserted-by":"crossref","DOI":"10.4153\/CJM-1990-038-6","article-title":"Simply connected limits","author":"Par\u00e9","year":"1990","journal-title":"Canad. J. Math"},{"key":"10.1016\/S1571-0661(04)80501-2_NEWBIB21","doi-asserted-by":"crossref","unstructured":"Dusko Pavlovic. Convenient categories of processes and simulations i: modulo strong bisimilarity. In D. Pitt et al., editor, Category Theory and Computer Science '95, volume 953 of Lecture Notes in Computer Science, pages 3\u201324. Springer Verlag, 1995.","DOI":"10.1007\/3-540-60164-3_17"},{"key":"10.1016\/S1571-0661(04)80501-2_NEWBIB22","unstructured":"A. Tarlecki, R. M. Burstall, and J. A. Goguen. Some fundamental algebraic tools for the semantics of computation part 3: Indexed categories. preprint, 1989."},{"key":"10.1016\/S1571-0661(04)80501-2_NEWBIB23","unstructured":"Krzysztof Worytkiewicz. Paths and Simulations. Accepted for publication in the proceedings of CTCS 2002."},{"key":"10.1016\/S1571-0661(04)80501-2_NEWBIB24","unstructured":"Krzysztof Worytkiewicz. Components and Synchronous Communication in Categories of Processes. PhD thesis, Swiss Federal Institute of Technology, Lausanne, 2000."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805012?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805012?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:06:06Z","timestamp":1761609966000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104805012"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S1571066104805012"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80501-2","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2002,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Concrete Process Categories","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(04)80501-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}