{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:12:29Z","timestamp":1761610349010,"version":"build-2065373602"},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":5323,"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":[[1999]]},"DOI":"10.1016\/s1571-0661(05)80311-1","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"102-126","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["A Fully Abstract Presheaf Semantics of SCCS with Finite Delay"],"prefix":"10.1016","volume":"29","author":[{"given":"Thomas T.","family":"Hildebrandt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80311-1_BIB1","article-title":"A semantic universe for fairness","author":"Aczel","year":"1996","journal-title":"Preliminary Draft"},{"year":"1990","series-title":"Category Theory for Computing Science","author":"Barr","key":"10.1016\/S1571-0661(05)80311-1_BIB2"},{"key":"10.1016\/S1571-0661(05)80311-1_BIB3","series-title":"PhD thesis, Aarhus University","article-title":"Presheaf models for concurrency","author":"Cattani","year":"1999"},{"key":"10.1016\/S1571-0661(05)80311-1_BIB4","doi-asserted-by":"crossref","unstructured":"G. L. Cattani, A. J. Power, and G. Winskel. A categorical axiomatics for bisimulation. In Proceedings of the 9th International Conference on Concurrency Theory, CONCUR '98, volume 1466 of LNCS, pages 581-596. Springer-Verlag, 1998.","DOI":"10.1007\/BFb0055649"},{"key":"10.1016\/S1571-0661(05)80311-1_BIB5","series-title":"CTCS'97, volume 1290 of LNCS","first-page":"106","article-title":"Presheaf models for the pi-calculu","author":"Cattani","year":"1997"},{"key":"10.1016\/S1571-0661(05)80311-1_BIB6","series-title":"CSL'96, volume 1258 of LNCS","first-page":"58","article-title":"Presheaf models for concurrency","author":"Cattani","year":"1997"},{"key":"10.1016\/S1571-0661(05)80311-1_BIB7","article-title":"Modelling finite delay operators","author":"Hennessy","year":"1983","journal-title":"Technical report, University of Edinburgh"},{"key":"10.1016\/S1571-0661(05)80311-1_BIB8","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0019-9958(85)80025-5","article-title":"The power of the future perfect in program logics","author":"Hennessy","year":"1985","journal-title":"Information and Control"},{"key":"10.1016\/S1571-0661(05)80311-1_BIB9","series-title":"CONCUR'98, volume 1466 of LNCS","first-page":"613","article-title":"A relational model of non-deterministic dataflow","author":"Hildebrandt","year":"1998"},{"key":"10.1016\/S1571-0661(05)80311-1_BIB10","unstructured":"M. Huth and M. Kwiatkowska. The semantics of fair recursion with divergence. Submitted. Technical report CSR-96-7."},{"key":"10.1016\/S1571-0661(05)80311-1_BIB11","unstructured":"M. Huth and M. Kwiatkowska. Finite but unbounded delay in synchronous CCS. In A. Edalat, S. Jourdan, and G. McCusker, editors, Advanced methods in theory and formal methods of computing: Proceedings of the third Imperial College workshop April 1996, pages 312-323. Imperial College Press, 1996."},{"issue":"2","key":"10.1016\/S1571-0661(05)80311-1_BIB12","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1006\/inco.1996.0057","article-title":"Bisimulation from open maps","volume":"127","author":"Joyal","year":"1996","journal-title":"LICS '93 special issue of Information and Computation"},{"key":"10.1016\/S1571-0661(05)80311-1_BIB13","series-title":"Springer","article-title":"Categories for the Working Mathematician","author":"Mac Lane","year":"1971"},{"key":"10.1016\/S1571-0661(05)80311-1_BIB14","series-title":"Springer","article-title":"Sheaves in Geometry and Logic: A First Introduction to Topos Theory","author":"Mac Lane","year":"1992"},{"year":"1980","series-title":"A calculus of communicating systems","author":"Milner","key":"10.1016\/S1571-0661(05)80311-1_BIB15"},{"key":"10.1016\/S1571-0661(05)80311-1_BIB16","article-title":"A finite delay operator in synchronous ccs","author":"Milner","year":"1982","journal-title":"Technical report, University of Edinburgh, Dept. of Computer Science, Kings Buildings"},{"key":"10.1016\/S1571-0661(05)80311-1_BIB17","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","article-title":"Calculi for synchrony and asynchrony","volume":"25","author":"Milner","year":"1983","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80311-1_BIB18","article-title":"The expressive power of indeterminate primitives in asynchronous computations","author":"Panangaden","year":"1995","journal-title":"Technical Report SOCS\ue4f895.8, School of CS, McGill"},{"key":"10.1016\/S1571-0661(05)80311-1_BIB19","series-title":"Automata, Languages and Programming (ICALP), Ninth Colloquium, volume 140 of LNCS","first-page":"418","article-title":"A powerdomain for countable non-determinism","author":"Plotkin","year":"1982"},{"key":"10.1016\/S1571-0661(05)80311-1_BIB20","article-title":"Generalised synchronisation trees","author":"Winskel","year":"1983","journal-title":"Handwritten notes"},{"key":"10.1016\/S1571-0661(05)80311-1_BIB21","series-title":"InAMAST '98, volume 1548 of LNCS","first-page":"42","article-title":"A linear metalanguage for concurrency","author":"Winskel","year":"1998"},{"key":"10.1016\/S1571-0661(05)80311-1_BIB22","series-title":"volume IV, chapter Models for concurrency. OUP","article-title":"Handbook of Logic in Computer Science","author":"Winskel","year":"1995"},{"key":"10.1016\/S1571-0661(05)80311-1_BIB23","unstructured":"G. Winskel and M. Nielsen. Presheaves as transition systems. In D. Peled, V Pratt, and G. Holzmann, editors, POMIV'96, volume 29 of DIMACS. AMS, july 1996."},{"key":"10.1016\/S1571-0661(05)80311-1_BIB24","series-title":"World Scientific","article-title":"Lecture Notes on Topoi and Quasitopoi","author":"Wyler","year":"1991"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105803111?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105803111?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:50Z","timestamp":1761610070000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105803111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"references-count":24,"alternative-id":["S1571066105803111"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80311-1","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A Fully Abstract Presheaf Semantics of SCCS with Finite Delay","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)80311-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}