{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:08Z","timestamp":1760202488033},"reference-count":14,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":10424,"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":[[1985]]},"DOI":"10.1016\/0304-3975(85)90129-x","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:04:58Z","timestamp":1052784298000},"page":"27-45","source":"Crossref","is-referenced-by-count":13,"special_numbering":"C","title":["A proof-theoretic characterization of observational equivalence"],"prefix":"10.1016","volume":"39","author":[{"given":"Colin","family":"Stirling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(85)90129-X_BIB1","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-16047-7_45","article-title":"Towards the hierarchical, temporal logic, specification of concurrent systems","author":"Barringer","year":"1983"},{"key":"10.1016\/0304-3975(85)90129-X_BIB2","first-page":"97","article-title":"Behaviour equivalence relations induced by programming logics","volume":"154","author":"Brookes","year":"1983"},{"key":"10.1016\/0304-3975(85)90129-X_BIB3","series-title":"Res. Rept., Dept. of Computer Science, Edinburgh Univ., CSR-123-82","first-page":"548","article-title":"Testing equivalences for processes","volume":"154","author":"de Nicola","year":"1982"},{"key":"10.1016\/0304-3975(85)90129-X_BIB4","series-title":"The Collected Works of Gerhard Gentzen","article-title":"Investigations into logical deduction","author":"Gentzen","year":"1969"},{"key":"10.1016\/0304-3975(85)90129-X_BIB5","article-title":"Synchronous and asynchronous experiments on processes","author":"Hennessy","year":"1982","journal-title":"Res. Rept., Dept. of Computer Science, Edinburgh Univ., CSR-125-82"},{"key":"10.1016\/0304-3975(85)90129-X_BIB6","article-title":"Axiomatizing finite delay operators","author":"Hennessy","year":"1982","journal-title":"Res. Rept., Dept. of Computer Science, Edinburgh Univ., CSR-124-82"},{"key":"10.1016\/0304-3975(85)90129-X_BIB7","article-title":"A model for nondeterministic machines","author":"Hennessy","year":"1983"},{"key":"10.1016\/0304-3975(85)90129-X_BIB8","first-page":"255","article-title":"On observing nondeterminism and concurrency","volume":"85","author":"Hennessy","year":"1980"},{"key":"10.1016\/0304-3975(85)90129-X_BIB9","article-title":"A theory of communicating sequential processes","author":"Hoare","year":"1981"},{"key":"10.1016\/0304-3975(85)90129-X_BIB10","article-title":"The power of the future perfect in program logics","author":"Hennessy","year":"1983","journal-title":"Res. Rept., Dept. of Computer Science, Edinburgh Univ., CSR-156-83"},{"key":"10.1016\/0304-3975(85)90129-X_BIB11","article-title":"A Calculus of Communicating Systems","volume":"92","author":"Milner","year":"1980"},{"key":"10.1016\/0304-3975(85)90129-X_BIB12","article-title":"A modal characterization of observable machine-behaviour","volume":"112","author":"Milner","year":"1981"},{"issue":"3","key":"10.1016\/0304-3975(85)90129-X_BIB13","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":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90129-X_BIB14","series-title":"Proc. 22nd Annual Symp. on Foundations of Computer Science","first-page":"140","article-title":"Possible futures, acceptances, refusals, and communicating processes","author":"Rounds","year":"1981"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758590129X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758590129X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T08:52:57Z","timestamp":1553158377000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439758590129X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":14,"alternative-id":["030439758590129X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90129-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}