{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T03:19:06Z","timestamp":1773717546143,"version":"3.50.1"},"reference-count":46,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"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":7351,"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":[[1993,6]]},"DOI":"10.1016\/0304-3975(93)90006-f","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"293-348","source":"Crossref","is-referenced-by-count":15,"title":["Modular specification of process algebras"],"prefix":"10.1016","volume":"113","author":[{"given":"Rob","family":"van Glabbeek","sequence":"first","affiliation":[]},{"given":"Frits","family":"Vaandrager","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90006-F_BIB1","series-title":"Computer Science Report 3\/90","article-title":"A theory of testing for ACP","author":"Aceto","year":"1990"},{"key":"10.1016\/0304-3975(93)90006-F_BIB2","series-title":"ESPRIT project 415, Document no. 91","article-title":"Definition of the programming language POOL-T","author":"America","year":"1985"},{"key":"10.1016\/0304-3975(93)90006-F_BIB3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0304-3975(84)90067-7","article-title":"Alg\u00e8bre de processus et synchronisations","volume":"30","author":"Austry","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90006-F_BIB4","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."},{"key":"10.1016\/0304-3975(93)90006-F_BIB5","first-page":"285","article-title":"Recursive process definitions with the state operator, Report CS-R8920","volume":"82","author":"Baeten","year":"1991"},{"key":"10.1016\/0304-3975(93)90006-F_BIB6","series-title":"Formal Description of Programming Concepts\u2014III","first-page":"53","article-title":"Conditional axions and \u03b1\/\u03b2 calculus in process algebra","author":"Baeten","year":"1987"},{"key":"10.1016\/0304-3975(93)90006-F_BIB7","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\/0304-3975(93)90006-F_BIB8","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1093\/comjnl\/30.6.498","article-title":"Ready-trace semantics for concrete process algebra with the priority operator","volume":"30","author":"Baeten","year":"1987","journal-title":"Comput. J."},{"key":"10.1016\/0304-3975(93)90006-F_BIB9","first-page":"153","article-title":"Merge and termination in process algebra","volume":"287","author":"Baeten","year":"1987"},{"key":"10.1016\/0304-3975(93)90006-F_BIB10","article-title":"Cambridge Tracts in Theoret. Comput. Sci.","volume":"18","author":"Baeten","year":"1990"},{"key":"10.1016\/0304-3975(93)90006-F_BIB11","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1145\/77600.77621","article-title":"Module algebra","volume":"37","author":"Bergstra","year":"1990","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(93)90006-F_BIB12","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(93)90006-F_BIB13","series-title":"Mathematics and Computer Science II","first-page":"61","article-title":"Process algebra: specification and verification in bisimulation semantics","author":"Bergstra","year":"1986"},{"key":"10.1016\/0304-3975(93)90006-F_BIB14","series-title":"Formal Description of Programming Concepts\u2013III","first-page":"77","article-title":"Failures without chaos: a new process semantics for fair abstraction","author":"Bergstra","year":"1987"},{"key":"10.1016\/0304-3975(93)90006-F_BIB15","first-page":"213","article-title":"Process algebra semantics for queues","volume":"10","author":"Bergstra","year":"1987","journal-title":"Fund. Inform."},{"key":"10.1016\/0304-3975(93)90006-F_BIB16","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1017\/S0305004100013463","article-title":"On the structure of abstract algebras","volume":"31","author":"Birkhoff","year":"1935","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"10.1016\/0304-3975(93)90006-F_BIB17","first-page":"281","article-title":"An improved failures model for communicating processes","volume":"197","author":"Brookes","year":"1985"},{"key":"10.1016\/0304-3975(93)90006-F_BIB18","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0167-6423(88)90065-2","article-title":"Views on queues","volume":"11","author":"Broy","year":"1988","journal-title":"Sci. Comput Programming"},{"key":"10.1016\/0304-3975(93)90006-F_BIB19","article-title":"Recommendation Z.200 (CHILL Language Definition)","year":"1980","journal-title":"CCITT Study Group XI"},{"key":"10.1016\/0304-3975(93)90006-F_BIB20","article-title":"The analysis on concurrent systems","volume":"207","author":"Denvir","year":"1985"},{"key":"10.1016\/0304-3975(93)90006-F_BIB21","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\/0304-3975(93)90006-F_BIB22","first-page":"336","article-title":"Bounded nondeterminism and the approximation induction principle in process algebra","volume":"247","author":"van Glabbeeck","year":"1987"},{"key":"10.1016\/0304-3975(93)90006-F_BIB23","first-page":"278","article-title":"The linear time\u2013branching time spectrum","volume":"458","author":"van Glabbeek","year":"1990"},{"key":"10.1016\/0304-3975(93)90006-F_BIB24","series-title":"Ph.D. Thesis","article-title":"Comparative concurrency semantics and refinement of actions","author":"van Glabbeek","year":"1990"},{"key":"10.1016\/0304-3975(93)90006-F_BIB25","first-page":"465","article-title":"Modular specifications in process algebra \u2013 with curious queues (extended abstract)","volume":"394","author":"van Glabbeek","year":"1987-1989"},{"key":"10.1016\/0304-3975(93)90006-F_BIB26","series-title":"Report TUM-I9052","article-title":"Branching time and abstraction in bisimulation semantics","author":"van Glabbeek","year":"1990"},{"key":"10.1016\/0304-3975(93)90006-F_BIB27","series-title":"Algebraic Theory of Processes","author":"Hennessy","year":"1988"},{"key":"10.1016\/0304-3975(93)90006-F_BIB28","series-title":"On the Construction of Programs \u2013an Advanced Course","first-page":"229","article-title":"Communicating sequential processes","author":"Hoare","year":"1980"},{"key":"10.1016\/0304-3975(93)90006-F_BIB29","series-title":"Communicating Sequential Processes","author":"Hoare","year":"1985"},{"key":"10.1016\/0304-3975(93)90006-F_BIB30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01786251","article-title":"Algebraic specification and proof of a distributed recovery algorithm","volume":"2","author":"Jifeng","year":"1987","journal-title":"Distributed Computing"},{"key":"10.1016\/0304-3975(93)90006-F_BIB31","first-page":"126","article-title":"A complete protocol verification using relativized bisimulation","volume":"267","author":"Larsen","year":"1987"},{"key":"10.1016\/0304-3975(93)90006-F_BIB32","series-title":"Report FVI 87-06, Dept. of Computer Science","first-page":"507","article-title":"An algebraic specification of process algebra, including two examples","author":"Mauw","year":"1987"},{"key":"10.1016\/0304-3975(93)90006-F_BIB33","doi-asserted-by":"crossref","first-page":"85","DOI":"10.3233\/FI-1990-13202","article-title":"A process specification formalism","volume":"13","author":"Mauw","year":"1990","journal-title":"Fund. Informa."},{"key":"10.1016\/0304-3975(93)90006-F_BIB34","article-title":"A Calculus of Communicating Systems","volume":"92","author":"Milner","year":"1980"},{"key":"10.1016\/0304-3975(93)90006-F_BIB35","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/0304-3975(93)90006-F_BIB36","series-title":"Mathematical Logic","author":"Monk","year":"1976"},{"key":"10.1016\/0304-3975(93)90006-F_BIB37","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF00268075","article-title":"Specification-oriented semantics for communicating processes","volume":"23","author":"Olderog","year":"1986","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(93)90006-F_BIB38","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0304-3975(87)90117-4","article-title":"Refusal testing","volume":"50","author":"Phillips","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90006-F_BIB39","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF01379149","article-title":"Modeling concurrency with partial orders","volume":"15","author":"Pratt","year":"1986","journal-title":"Internat. J. Parallel Programming"},{"key":"10.1016\/0304-3975(93)90006-F_BIB40","first-page":"47","article-title":"On the mechanization of the theory equations","volume":"9F","author":"Robinson","year":"1960","journal-title":"Bull. Res. Council Israel"},{"key":"10.1016\/0304-3975(93)90006-F_BIB41","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF00283329","article-title":"Toward formal development of programs from algebraic specifications: implementations revisited","volume":"25","author":"Sannella","year":"1988","journal-title":"Acta Informa."},{"key":"10.1016\/0304-3975(93)90006-F_BIB42","first-page":"413","article-title":"A kernel language for algebraic specification and implementation","volume":"158","author":"Sannella","year":"1983"},{"key":"10.1016\/0304-3975(93)90006-F_BIB43","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1007\/BF02945004","article-title":"Completeness of calculii for axiomatically defined classes of algebras","volume":"2","author":"Selman","year":"1972","journal-title":"Algebra Universalis"},{"key":"10.1016\/0304-3975(93)90006-F_BIB44","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(93)90006-F_BIB45","series-title":"Applications of Process Algebra","first-page":"173","article-title":"Process algebra semantics of POOL","author":"Vaandrager","year":"1990"},{"key":"10.1016\/0304-3975(93)90006-F_BIB46","series-title":"Ph.D. Thesis","article-title":"Algebraic techniques for concurrency and their application","author":"Vaandrager","year":"1990"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390006F?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390006F?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,15]],"date-time":"2021-05-15T01:42:46Z","timestamp":1621042966000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390006F"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["030439759390006F"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90006-f","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}