{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T17:51:19Z","timestamp":1767117079895},"reference-count":17,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1988,6,1]],"date-time":"1988-06-01T00:00:00Z","timestamp":581126400000},"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":9177,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1988,6]]},"DOI":"10.1016\/0304-3975(88)90030-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"249-261","source":"Crossref","is-referenced-by-count":197,"title":["A timed model for communicating sequential processes"],"prefix":"10.1016","volume":"58","author":[{"given":"G.M.","family":"Reed","sequence":"first","affiliation":[]},{"given":"A.W.","family":"Roscoe","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(88)90030-8_BIB1","series-title":"Ph.D. Thesis","article-title":"A model for communicating sequential processes","author":"Brookes","year":"1983"},{"key":"10.1016\/0304-3975(88)90030-8_BIB2","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","article-title":"A theory of communicating sequential processes","volume":"31","author":"Brookes","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(88)90030-8_BIB3","first-page":"173","article-title":"A fully abstract concurrent model and its temporal logic","author":"Barringer","year":"1986","journal-title":"Proc. 18th POPL"},{"key":"10.1016\/0304-3975(88)90030-8_BIB4","series-title":"Proc. Pittsburgh Seminar on Concurrency","first-page":"281","article-title":"An improved failures model for communicating processes","volume":"197","author":"Brookes","year":"1985"},{"key":"10.1016\/0304-3975(88)90030-8_BIB5","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/S0019-9958(82)91250-5","article-title":"Processes and the denotational semantics of concurrency","volume":"54","author":"de Bakker","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(88)90030-8_BIB6","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/S0019-9958(83)80039-4","article-title":"Connections between two theories of concurrency: metric spaces and synchronisation trees","volume":"57","author":"Golson","year":"1983","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(88)90030-8_BIB7","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","article-title":"Communicating sequential processes","volume":"21","author":"Hoare","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(88)90030-8_BIB8","series-title":"On the Construction of Programs","first-page":"229","article-title":"A model for communicating sequential processes","author":"Hoare","year":"1980"},{"key":"10.1016\/0304-3975(88)90030-8_BIB9","series-title":"Communicating Sequential Processes","author":"Hoare","year":"1985"},{"key":"10.1016\/0304-3975(88)90030-8_BIB10","series-title":"Tech. Monograph PRG-16","article-title":"A theory of communicating sequential processes","author":"Hoare","year":"1981"},{"key":"10.1016\/0304-3975(88)90030-8_BIB11","series-title":"Ph.D. Thesis","article-title":"A timed model for communicating processes","author":"Jones","year":"1982"},{"key":"10.1016\/0304-3975(88)90030-8_BIB12","series-title":"Tech. Rept. 68","article-title":"Compositional semantics for real-time distributed computing","author":"Koymans","year":"1985"},{"key":"10.1016\/0304-3975(88)90030-8_BIB13","series-title":"Foundations of Computer Science III","first-page":"3","article-title":"Infinite words, infinite trees, infinite computations","volume":"109","author":"Nivat","year":"1979"},{"key":"10.1016\/0304-3975(88)90030-8_BIB14","first-page":"561","article-title":"Specification-oriented semantics for communicating processes","volume":"154","author":"Olderog","year":"1983"},{"key":"10.1016\/0304-3975(88)90030-8_BIB15","series-title":"Ph.D. Thesis","article-title":"A mathematical theory of communicating processes","author":"Roscoe","year":"1982"},{"key":"10.1016\/0304-3975(88)90030-8_BIB16","series-title":"Proc. Pittsburgh Seminar on Concurrency","first-page":"360","article-title":"Applications of topology to the semantics of communicating processes","volume":"197","author":"Rounds","year":"1985"},{"key":"10.1016\/0304-3975(88)90030-8_BIB17","series-title":"Proc. Third Workshop on the Mathematical Foundations of Programming Language Semantics","first-page":"331","article-title":"Metric spaces as models for real-time concurrency","volume":"298","author":"Reed","year":"1987-1988"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588900308?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588900308?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:53:46Z","timestamp":1555113226000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397588900308"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,6]]},"references-count":17,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1988,6]]}},"alternative-id":["0304397588900308"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(88)90030-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1988,6]]}}}