{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T06:53:42Z","timestamp":1747810422361},"reference-count":9,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"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":[[1995,3]]},"DOI":"10.1016\/0020-0190(94)00214-j","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:53:20Z","timestamp":1027612400000},"page":"341-346","source":"Crossref","is-referenced-by-count":25,"title":["The weakest deadlock-preserving congruence"],"prefix":"10.1016","volume":"53","author":[{"given":"Antti","family":"Valmari","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00214-J_BIB1","series-title":"Formal Description of Programming Concepts III","first-page":"77","article-title":"Failures without chaos: a new process semantics for fair abstraction","author":"Bergstra","year":"1987"},{"key":"10.1016\/0020-0190(94)00214-J_BIB2_1","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0169-7552(87)90085-7","article-title":"Introduction to the ISO Specification Language LOTOS","volume":"14","author":"Bolognesi","year":"1987","journal-title":"Computer Networks and ISDN Systems"},{"key":"10.1016\/0020-0190(94)00214-J_BIB2_2","series-title":"The Formal Description Technique LOTOS","first-page":"23","author":"Bolognesi","year":"1989"},{"key":"10.1016\/0020-0190(94)00214-J_BIB3","series-title":"Proc. NSF-SERC Seminar on Concurrency","first-page":"281","article-title":"An improved failures model for communicating sequential processes","volume":"197","author":"Brookes","year":"1985"},{"key":"10.1016\/0020-0190(94)00214-J_BIB4","series-title":"Communicating Sequential Processes","author":"Hoare","year":"1985"},{"key":"10.1016\/0020-0190(94)00214-J_BIB5","series-title":"Proc. CONCUR '92","first-page":"207","article-title":"The weakest compositional semantic equivalence preserving nexttime-less linear temporal logic","volume":"630","author":"Kaivola","year":"1992"},{"key":"10.1016\/0020-0190(94)00214-J_BIB6","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/0020-0190(94)00214-J_BIB7","series-title":"Protocol Specification, Testing and Verification XI","first-page":"3","article-title":"An improved failures equivalence for finite-state systems with a reduction algorithm","author":"Valmari","year":"1991"},{"key":"10.1016\/0020-0190(94)00214-J_BIB8","article-title":"Compositional failure-based semantic models for basic LOTOS","author":"Valmari","year":"1993","journal-title":"Tampere University of Technology, Software Systems Laboratory, Report 16"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909400214J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909400214J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T17:51:37Z","timestamp":1556301097000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909400214J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":9,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["002001909400214J"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00214-j","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}