{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T08:22:48Z","timestamp":1772785368912,"version":"3.50.1"},"reference-count":34,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1999,12,22]],"date-time":"1999-12-22T00:00:00Z","timestamp":945820800000},"content-version":"vor","delay-in-days":1635,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1995,7]]},"DOI":"10.1016\/0304-3975(94)00152-9","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T06:09:04Z","timestamp":1051250944000},"page":"25-68","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":61,"title":["Structural operational semantics for weak bisimulations"],"prefix":"10.1016","volume":"146","author":[{"given":"Bard","family":"Bloom","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00152-9_bib1","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(87)90065-X","article-title":"Observation equivalence as a testing equivalence","volume":"53","author":"Abramsky","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00152-9_bib2","series-title":"Proc. LICS'92","first-page":"113","article-title":"Turning SOS rules into equations","author":"Aceto","year":"1992"},{"key":"10.1016\/0304-3975(94)00152-9_bib3","doi-asserted-by":"crossref","DOI":"10.1109\/LICS.1992.185526","article-title":"Turning SOS rules into equations","author":"Aceto","year":"1992"},{"key":"10.1016\/0304-3975(94)00152-9_bib4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511624193","article-title":"Process Algebra","author":"Beaten","year":"1990"},{"key":"10.1016\/0304-3975(94)00152-9_bib5","article-title":"Fixed point semantics in process algebras","author":"Bergstra","year":"1982"},{"key":"10.1016\/0304-3975(94)00152-9_bib6","doi-asserted-by":"crossref","DOI":"10.1145\/504136.504153","article-title":"The Isis project: real experinece with a fault tolerant programming system","author":"Birman","year":"1990"},{"key":"10.1016\/0304-3975(94)00152-9_bib7","article-title":"Programming with process groups: group and multicast semantics","author":"Birman","year":"1991"},{"key":"10.1016\/0304-3975(94)00152-9_bib8","article-title":"Ready simulation, bisimulation, and the semantics of CCS-like languages","author":"Bloom","year":"1989"},{"key":"10.1016\/0304-3975(94)00152-9_bib9","author":"Bloom","year":"1990","journal-title":"Strong process equivalence in the presence of hidden moves (preliminary report)"},{"key":"10.1016\/0304-3975(94)00152-9_bib10","unstructured":"B. Bloom, Ready, set, go: structural operational semantics for linear-time process algebras, Tech. Report Cornell TR 93-1372."},{"key":"10.1016\/0304-3975(94)00152-9_bib11","series-title":"Conf. Record 5th Ann. ACM Symp. on Principles of Programming Languages","first-page":"229","author":"Bloom","year":"1988"},{"key":"10.1016\/0304-3975(94)00152-9_bib12","series-title":"Tech. Report TR 90-1150","article-title":"Bisimulation can't be traced","author":"Bloom","year":"1990"},{"key":"10.1016\/0304-3975(94)00152-9_bib13","series-title":"Proc. Internat. BCS-FACS Workshop on Semantics for Concurrency","first-page":"189","article-title":"Experimenting with process equivalence","author":"Bloom","year":"1990"},{"key":"10.1016\/0304-3975(94)00152-9_bib14","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\/0304-3975(94)00152-9_bib15","series-title":"Proc. Workshop on Automated Verification Methods for Finite State Systems","article-title":"The concurrency workbench","volume":"Vol. 407","author":"Cleaveland","year":"1989"},{"key":"10.1016\/0304-3975(94)00152-9_bib16","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0039069","article-title":"Transition system specifications with negative premises","author":"Groote","year":"1990"},{"key":"10.1016\/0304-3975(94)00152-9_bib17","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/0890-5401(92)90013-6","article-title":"Structured operational semantics and bisimulation as a congruence","volume":"100","author":"Groote","year":"1992","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(94)00152-9_bib18","article-title":"Algebraic Theory of Processes","author":"Hennessy","year":"1988"},{"key":"10.1016\/0304-3975(94)00152-9_bib19","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","article-title":"Algebraic laws for nondeterminism and concurrency","volume":"32","author":"Hennessy","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)00152-9_bib20","article-title":"A Calculus of Communicating Systems","volume":"Vol. 92","author":"Milner","year":"1980"},{"key":"10.1016\/0304-3975(94)00152-9_bib21","series-title":"CAAP '81: Trees in Algebra and Programming, 6th Colloquium","first-page":"25","article-title":"A modal characterisation of observable machine-behaviour","volume":"Vol. 112","author":"Milner","year":"1981"},{"key":"10.1016\/0304-3975(94)00152-9_bib22","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","article-title":"Calculi for synchrony and asynchrony","volume":"25","author":"Milner","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00152-9_bib23","article-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/0304-3975(94)00152-9_bib24","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0890-5401(89)90070-9","article-title":"A complete axiomatisation for observational congruence of finite-state behaviours","volume":"81","author":"Milner","year":"1989","journal-title":"Inform. Comput."},{"key":"10.1016\/0304-3975(94)00152-9_bib25","series-title":"Automata, Languages and Programming: 17th Internat. Colloqium","first-page":"752","article-title":"The importance of the left merge operator in process algebras","volume":"Vol. 443","author":"Moller","year":"1990"},{"key":"10.1016\/0304-3975(94)00152-9_bib26","series-title":"Theoretical Computer Science","first-page":"261","article-title":"Concurrency and automata on infinite sequences","author":"Park","year":"1981"},{"key":"10.1016\/0304-3975(94)00152-9_bib27","article-title":"A structural approach to operational semantics","author":"Plotkin","year":"1981"},{"key":"10.1016\/0304-3975(94)00152-9_bib28","series-title":"Proc. 17th Ann. IEEE Symp. on Logic in Computer Science","first-page":"148","article-title":"Equivalences on observable processes","author":"Ulidowski","year":"1992"},{"key":"10.1016\/0304-3975(94)00152-9_bib29","unstructured":"F. Vaandrager, private communication (email discussions) June 1991."},{"key":"10.1016\/0304-3975(94)00152-9_bib30","series-title":"Proc. CONCUR 90","first-page":"278","article-title":"The linear time \u2014 branching time spectrum","volume":"Vol. 458","author":"van Glabbeek","year":"1990"},{"key":"10.1016\/0304-3975(94)00152-9_bib31","series-title":"The linear time \u2014 branching time spectrum II: the semantics of sequential processes with silent moves (preliminary version)","author":"van Glabbeek","year":"1993"},{"key":"10.1016\/0304-3975(94)00152-9_SB0150","series-title":"Information Processing 89: Proc. IFIP 11th World Computer Congress","first-page":"613","article-title":"Branching time and abstraction in bisimulation semantics","author":"van Glabbeek","year":"1989"},{"key":"10.1016\/0304-3975(94)00152-9_CE0015","unstructured":"TUM Report I9052 (SFB-Bericht No. 342\/29\/90 A) and CWI report CS-R9120."},{"key":"10.1016\/0304-3975(94)00152-9_bib33","series-title":"Proc. Advanced Research in VLSI and Parallel Systems Conf.","first-page":"79","article-title":"Compiling Joy to silicon: a verified silicon compilation scheme","author":"Weber","year":"1992"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594001529?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594001529?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:18:01Z","timestamp":1757477881000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594001529"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":34,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["0304397594001529"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00152-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Structural operational semantics for weak bisimulations","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(94)00152-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1995 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}