{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T03:18:20Z","timestamp":1773717500762,"version":"3.50.1"},"reference-count":29,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"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":9694,"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":[[1987]]},"DOI":"10.1016\/0304-3975(87)90052-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"129-176","source":"Crossref","is-referenced-by-count":93,"title":["On the consistency of Koomen's Fair Abstraction Rule"],"prefix":"10.1016","volume":"51","author":[{"given":"J.C.M.","family":"Baeten","sequence":"first","affiliation":[]},{"given":"J.A.","family":"Bergstra","sequence":"additional","affiliation":[]},{"given":"J.W.","family":"Klop","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(87)90052-1_BIB1","series-title":"Procesalgebra","author":"Baeten","year":"1986"},{"key":"10.1016\/0304-3975(87)90052-1_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."},{"key":"10.1016\/0304-3975(87)90052-1_BIB3","series-title":"IFIP Conf. on Formal Description of Programming Concepts","article-title":"Conditional axioms and \u03b1\/\u03b2 calculus in process algebra","author":"Baeten","year":"1987"},{"key":"10.1016\/0304-3975(87)90052-1_BIB4","series-title":"Proc. Workshop Logics of Programs","first-page":"18","article-title":"Compactness in semantics for merge and fair merge","volume":"164","author":"de Bakker","year":"1983"},{"key":"10.1016\/0304-3975(87)90052-1_BIB5","series-title":"Proc. 10th ICALP","first-page":"52","article-title":"Processes and a fair semantics for the ADA rendez-vous","volume":"154","author":"de Bakker","year":"1983"},{"key":"10.1016\/0304-3975(87)90052-1_BIB6","series-title":"Report IW-231\/83","article-title":"An abstraction mechanism for process algebras","author":"Bergstra","year":"1983"},{"issue":"1","key":"10.1016\/0304-3975(87)90052-1_BIB7","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\/0304-3975(87)90052-1_BIB8","series-title":"Mathematical Research","first-page":"9","article-title":"Verification of an alternating bit protocol by means of process algebra","volume":"31","author":"Bergstra","year":"1986"},{"key":"10.1016\/0304-3975(87)90052-1_BIB9","series-title":"Report CS-R 8405","article-title":"Fair FIFO queues satisfy an algebraic criterion for protocol correctness","author":"Bergstra","year":"1984"},{"key":"10.1016\/0304-3975(87)90052-1_BIB10","series-title":"Report CS-R 8420","article-title":"A complete inference system for regular processes with silent moves","author":"Bergstra","year":"1984"},{"key":"10.1016\/0304-3975(87)90052-1_BIB11","series-title":"Proc. CWI Symp. on Mathematics and Computer Science","first-page":"89","article-title":"Algebra of communicating processes","author":"Bergstra","year":"1986"},{"issue":"2","key":"10.1016\/0304-3975(87)90052-1_BIB12","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0167-6423(85)90010-3","article-title":"Top-down design and the algebra of communicating processes","volume":"5","author":"Bergstra","year":"1985","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0304-3975(87)90052-1_BIB13","series-title":"Report CSR-137-83","article-title":"A fair calculus of communicating systems","author":"Costa","year":"1983"},{"key":"10.1016\/0304-3975(87)90052-1_BIB14","article-title":"Infinitary languages and fully abstract models for fair asynchrony","author":"Darondeau","year":"1984","journal-title":"Report CNRS-IRISA"},{"key":"10.1016\/0304-3975(87)90052-1_BIB15","series-title":"Proc. STACS","first-page":"336","article-title":"Bounded nondeterminism and the Approximation Induction Principle in process algebra","volume":"247","author":"Van Glabbeek","year":"1987"},{"key":"10.1016\/0304-3975(87)90052-1_BIB16","article-title":"Modelling fair processes","author":"Hennessy","year":"1984","journal-title":"Proc. 16th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(87)90052-1_BIB17","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF00289140","article-title":"Axiomatising finite delay operators","volume":"21","author":"Hennessy","year":"1984","journal-title":"Acta Inform"},{"key":"10.1016\/0304-3975(87)90052-1_BIB18","series-title":"Proc. 12th ICALP","first-page":"260","article-title":"An algebraic theory of fair asynchronous communicating processes","volume":"194","author":"Hennessy","year":"1985"},{"key":"10.1016\/0304-3975(87)90052-1_BIB19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6423(85)90002-4","article-title":"Algebraic specification and verification of communication protocols","volume":"5","author":"Koomen","year":"1985","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0304-3975(87)90052-1_BIB20","series-title":"Report LGPS 6","article-title":"A modular approach to protocol verification using process algebra","author":"Koymans","year":"1986"},{"key":"10.1016\/0304-3975(87)90052-1_BIB21","series-title":"Report CS-R8606","article-title":"Fixed-point equations with parameters in the projective model","author":"Kranakis","year":"1986"},{"key":"10.1016\/0304-3975(87)90052-1_BIB22","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0304-3975(86)90045-9","article-title":"Merging regular processes by means of fixed-point theory","volume":"45","author":"Meyer","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(87)90052-1_BIB23","article-title":"A Calculus of Communicating Systems","volume":"92","author":"Milner","year":"1980"},{"key":"10.1016\/0304-3975(87)90052-1_BIB24","series-title":"Proc. 5th GI Conf.","first-page":"167","article-title":"Concurrency and automata on infinite sequences","volume":"104","author":"Park","year":"1981"},{"key":"10.1016\/0304-3975(87)90052-1_BIB25","series-title":"Ph.D. Thesis","article-title":"Fairness properties in process algebra","author":"Parrow","year":"1985"},{"key":"10.1016\/0304-3975(87)90052-1_BIB26","series-title":"Report CS-R8608","article-title":"Verification of two communication protocols by means of process algebra","author":"Vaandrager","year":"1986"},{"key":"10.1016\/0304-3975(87)90052-1_BIB27","series-title":"Report FVI 86-01","article-title":"The algebra of communicating processes with empty process","author":"Vrancken","year":"1986"},{"key":"10.1016\/0304-3975(87)90052-1_BIB28","series-title":"Report CS-R8701","article-title":"Another look at abstraction in process algebras","author":"Baeten","year":"1987"},{"key":"10.1016\/0304-3975(87)90052-1_BIB29","series-title":"Report CS-R8721","article-title":"Abstraction and empty process in process algebra","author":"Baeten","year":"1987"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397587900521?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397587900521?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:52:03Z","timestamp":1555127523000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397587900521"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"references-count":29,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1987]]}},"alternative-id":["0304397587900521"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(87)90052-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1987]]}}}