{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T15:13:16Z","timestamp":1723821196205},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"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":5921,"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":[[1997,5]]},"DOI":"10.1016\/s0304-3975(96)00250-2","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:53:40Z","timestamp":1051127620000},"page":"287-328","source":"Crossref","is-referenced-by-count":28,"title":["The algebra of communicating processes with empty process"],"prefix":"10.1016","volume":"177","author":[{"given":"J.L.M.","family":"Vrancken","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0304-3975(96)00250-2_BIB1","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0890-5401(88)90027-2","article-title":"Global renaming operators in concrete process algebra","volume":"78","author":"Baeten","year":"1988","journal-title":"Inform. and Comput."},{"issue":"2","key":"10.1016\/S0304-3975(96)00250-2_BIB2","first-page":"127","article-title":"Syntax and defining equations for an interrupt mechanism in process algebra","volume":"IX","author":"Baeten","year":"1986","journal-title":"Fund. Inform."},{"issue":"1\/2","key":"10.1016\/S0304-3975(96)00250-2_BIB3","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0304-3975(87)90052-1","article-title":"On the consistency of Koomen's fair abstraction rule","volume":"51","author":"Baeten","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00250-2_BIB4","series-title":"Proc. 7th Conf. on Foundations of Software Technology and Theoretical Computer Science","first-page":"153","article-title":"Merge and termination in process algebra","volume":"vol. 287","author":"Baeten","year":"1987"},{"issue":"1\/3","key":"10.1016\/S0304-3975(96)00250-2_BIB5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","article-title":"Process algebra for synchronous communication","volume":"60","author":"Bergstra","year":"1984","journal-title":"Inform. and Control"},{"issue":"1","key":"10.1016\/S0304-3975(96)00250-2_BIB6","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","article-title":"Algebra of communicating processes with abstraction","volume":"37","author":"Bergstra","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00250-2_BIB7","article-title":"Process Algebra","volume":"vol. 18","author":"Baeten","year":"1990"},{"issue":"3","key":"10.1016\/S0304-3975(96)00250-2_BIB8","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\/S0304-3975(96)00250-2_BIB9_1","article-title":"Specification and verification of real time systems in ACP","author":"Groote","year":"1990"},{"key":"10.1016\/S0304-3975(96)00250-2_BIB9_2","series-title":"Protocol Specification, Testing and Verification, X","first-page":"261","year":"1990"},{"issue":"2","key":"10.1016\/S0304-3975(96)00250-2_BIB10","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF01221097","article-title":"Process algebra with guards: combining Hoare logic and process algebra","volume":"6","author":"Groote","year":"1994","journal-title":"Formal Aspects Comput."},{"key":"10.1016\/S0304-3975(96)00250-2_BIB11","article-title":"Extending process algebra with the empty process \u03b5","author":"Koymans","year":"1985"},{"key":"10.1016\/S0304-3975(96)00250-2_BIB12","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S0304-3975(96)00250-2_BIB13","article-title":"Verification of two communication protocols by means of process algebra","author":"Vaandrager","year":"1986"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002502?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002502?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T08:57:51Z","timestamp":1555405071000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596002502"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,5]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,5]]}},"alternative-id":["S0304397596002502"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00250-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,5]]}}}