{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T01:33:25Z","timestamp":1787708005116,"version":"build-2784847793"},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1016\/s0020-0190(01)00217-4","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T13:55:05Z","timestamp":1034603705000},"page":"51-58","source":"Crossref","is-referenced-by-count":25,"title":["Impossible futures and determinism"],"prefix":"10.1016","volume":"80","author":[{"given":"Marc","family":"Voorhoeve","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sjouke","family":"Mauw","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00217-4_BIB001","series-title":"Formal Description Techniques VII","first-page":"340","article-title":"Delayed choice: An operator for joining Message Sequence Charts","author":"Baeten","year":"1995"},{"key":"10.1016\/S0020-0190(01)00217-4_BIB002","first-page":"149","article-title":"Concrete process algebra","volume":"4","author":"Baeten","year":"1995"},{"key":"10.1016\/S0020-0190(01)00217-4_BIB003","series-title":"Process Algebra","volume":"18","author":"Baeten","year":"1990"},{"issue":"1","key":"10.1016\/S0020-0190(01)00217-4_BIB004","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1145\/200836.200876","article-title":"Bisimulation can't be traced","volume":"42","author":"Bloom","year":"1995","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(01)00217-4_BIB005","series-title":"Proc. CONCUR'95","first-page":"311","article-title":"Fair testing","volume":"962","author":"Brinksma","year":"1995"},{"key":"10.1016\/S0020-0190(01)00217-4_BIB006","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","article-title":"Testing equivalences for processes","volume":"34","author":"De Nicola","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(01)00217-4_BIB007","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0304-3975(85)90028-3","article-title":"Determinacy implies observation equivalence = trace equivalence","volume":"36","author":"Engelfriet","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(01)00217-4_BIB008","series-title":"Proc. CONCUR'93","first-page":"66","article-title":"The linear time \u2014 branching time spectrum II","volume":"715","author":"van Glabbeek","year":"1993"},{"key":"10.1016\/S0020-0190(01)00217-4_BIB009","series-title":"Proc. IFIP'89","first-page":"613","article-title":"Branching time and abstraction in bisimulation semantics (extended abstract)","author":"van Glabbeek","year":"1989"},{"issue":"1","key":"10.1016\/S0020-0190(01)00217-4_BIB010","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","article-title":"Algebraic laws for nondeterminism and concurrency","volume":"32","author":"Hennesy","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(01)00217-4_BIB011","series-title":"Proc. ICALP'95","first-page":"648","article-title":"Divergence and fair testing","volume":"944","author":"Natarajan","year":"1995"},{"key":"10.1016\/S0020-0190(01)00217-4_BIB012","series-title":"Proc. CONCUR'92","first-page":"518","article-title":"Multiway synchronization verified with coupled simulation","volume":"630","author":"Parrow","year":"1992"},{"key":"10.1016\/S0020-0190(01)00217-4_BIB013","series-title":"Proc. 22nd Annual Symposium on Foundations of Computer Science","first-page":"140","article-title":"Possible futures, acceptances, refusals and communicating processes","author":"Rounds","year":"1981"},{"key":"10.1016\/S0020-0190(01)00217-4_BIB014","series-title":"Impossible futures and determinism, Technical Report 0014","author":"Voorhoeve","year":"2000"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002174?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002174?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T09:26:44Z","timestamp":1555752404000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001002174"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0020019001002174"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00217-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}