{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T03:11:58Z","timestamp":1775790718459,"version":"3.50.1"},"reference-count":50,"publisher":"Elsevier","isbn-type":[{"value":"9780444828309","type":"print"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"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":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1016\/b978-044482830-9\/50019-9","type":"book-chapter","created":{"date-parts":[[2007,10,10]],"date-time":"2007-10-10T13:58:36Z","timestamp":1192024716000},"page":"3-99","source":"Crossref","is-referenced-by-count":192,"title":["The Linear Time - Branching Time Spectrum I.**This is an extension of [20]. The research reported in this paper has been initiated at CWI in Amsterdam, continued at the Technical University of Munich, and finalized at Stanford University. It has been supported by Sonderforschungsbereich 342 of the TU M\u00fcnchen and by ONR under grant number N00014-92-J-1974. Part of it was carried out in the preparation of a course Comparative Concurrency Semantics, given at the University of Amsterdam, Spring 1988. A coloured version of this paper is available at http:\/\/boole.stanford.edu\/pub\/spectruml.ps.gz. The Semantics of Concrete, Sequential Processes"],"prefix":"10.1016","author":[{"given":"R.J. van","family":"Glabbeek","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/B978-044482830-9\/50019-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\/B978-044482830-9\/50019-9_bib2","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1017\/S0960129500000189","article-title":"Quantales, observational logic and process semantics","volume":"3","author":"Abramsky","year":"1993","journal-title":"Math. Structures Comput. Sci."},{"key":"10.1016\/B978-044482830-9\/50019-9_bib3","series-title":"Handbook of Process Algebra","first-page":"197","article-title":"Structural operational semantics","author":"Aceto","year":"2001"},{"key":"10.1016\/B978-044482830-9\/50019-9_bib4","article-title":"Non-well-founded Sets","author":"Aczel","year":"1988"},{"key":"10.1016\/B978-044482830-9\/50019-9_bib5","series-title":"Applications of Process Algebra","year":"1990"},{"issue":"6","key":"10.1016\/B978-044482830-9\/50019-9_bib6","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\/B978-044482830-9\/50019-9_bib7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511624193","article-title":"Process Algebra","author":"Baeten","year":"1990"},{"key":"10.1016\/B978-044482830-9\/50019-9_bib8","series-title":"Current Trends in Concurrency","first-page":"51","article-title":"Contrasting themes in the semantics of imperative concurrency","author":"de Bakker","year":"1986"},{"issue":"1\/2","key":"10.1016\/B978-044482830-9\/50019-9_bib9","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/S0019-9958(82)91250-5","article-title":"Processes and the denotational semantics of concurrency","volume":"54","author":"de Bakker","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/B978-044482830-9\/50019-9_bib10","article-title":"Failure semantics with fair abstraction","author":"Bergstra","year":"1986","journal-title":"Report CS-R8609, CWI, Amsterdam"},{"issue":"6","key":"10.1016\/B978-044482830-9\/50019-9_bib11","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1137\/0217073","article-title":"Readies and failures in the algebra of communicating processes","volume":"17","author":"Bergstra","year":"1988","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/B978-044482830-9\/50019-9_bib12","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1145\/200836.200876","article-title":"Bisimulation can't be traced","volume":"42","author":"Bloom","year":"1995","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/B978-044482830-9\/50019-9_bib13","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\/B978-044482830-9\/50019-9_bib14","series-title":"Seminar on Concurrency","first-page":"281","article-title":"An improved failures model for communicating processes","author":"Brookes","year":"1985"},{"key":"10.1016\/B978-044482830-9\/50019-9_bib15","series-title":"Proceedings International Symposium on Programming: 5th Colloquium","first-page":"47","article-title":"An enlarged definition and complete axiomatisation of observational congruence of finite processes","author":"Darondeau","year":"1982"},{"key":"10.1016\/B978-044482830-9\/50019-9_bib16","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF00264365","article-title":"Extensional equivalences for transition systems","volume":"24","author":"De Nicola","year":"1987","journal-title":"Acta Inform."},{"key":"10.1016\/B978-044482830-9\/50019-9_bib17","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."},{"issue":"1","key":"10.1016\/B978-044482830-9\/50019-9_bib18","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0304-3975(85)90028-3","article-title":"Determinacy \u2192 (observation equivalence = trace equivalence)","volume":"36","author":"Engelfriet","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/B978-044482830-9\/50019-9_bib19","series-title":"Proceedings IFIP TC2 Working Conference on Programming Concepts and Methods, Sea of Gallilee","first-page":"27","article-title":"The refinement theorem for ST-bisimulation semantics","author":"van Glabbeek","year":"1990"},{"key":"10.1016\/B978-044482830-9\/50019-9_bib20","series-title":"Proceedings CONCUR '90, Theories of Concurrency: Unification and Extension","first-page":"278","article-title":"The linear time \u2013 branching time spectrum","author":"van Glabbeek","year":"1990"},{"key":"10.1016\/B978-044482830-9\/50019-9_bib21","series-title":"Proceedings CONCUR '93, 4th International Conference on Concurrency Theory","first-page":"66","article-title":"The linear time \u2013 branching time spectrum II; The semantics of sequential systems with silent moves","author":"van Glabbeek","year":"1993"},{"key":"10.1016\/B978-044482830-9\/50019-9_bib22","series-title":"25 Jaar Semantiek, Liber Amicorum","first-page":"243","article-title":"The processes of De Bakker and Zucker represent bisimulation equivalence classes","author":"van Glabbeek","year":"1989"},{"key":"10.1016\/B978-044482830-9\/50019-9_bib23","series-title":"Proceedings CONCUR 90","first-page":"314","article-title":"A new strategy for proving \u03c9-completeness with applications in process algebra","author":"Groote","year":"1990"},{"issue":"2","key":"10.1016\/B978-044482830-9\/50019-9_bib24","first-page":"354","article-title":"Undecidable equivalences for basic process algebra","volume":"115","author":"Groote","year":"1994","journal-title":"Inform. and Control"},{"issue":"2","key":"10.1016\/B978-044482830-9\/50019-9_bib25","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."},{"issue":"4","key":"10.1016\/B978-044482830-9\/50019-9_bib26","doi-asserted-by":"crossref","first-page":"896","DOI":"10.1145\/4221.4249","article-title":"Acceptance trees","volume":"32","author":"Hennessy","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/B978-044482830-9\/50019-9_bib27","series-title":"Proceedings 7th ICALP","first-page":"299","article-title":"On observing nondeterminism and concurrency","author":"Hennessy","year":"1980"},{"issue":"1","key":"10.1016\/B978-044482830-9\/50019-9_bib28","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"},{"issue":"8","key":"10.1016\/B978-044482830-9\/50019-9_bib29","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","article-title":"Communicating sequential processes","volume":"21","author":"Hoare","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/B978-044482830-9\/50019-9_bib30","series-title":"On the Construction of Programs \u2013 An Advanced Course","first-page":"229","article-title":"Communicating sequential processes","author":"Hoare","year":"1980"},{"key":"10.1016\/B978-044482830-9\/50019-9_bib31","series-title":"Communicating Sequential Processes","author":"Hoare","year":"1985"},{"key":"10.1016\/B978-044482830-9\/50019-9_bib32","series-title":"Modal Logic and Process Algebra: A Bisimulation Perspective","first-page":"187","article-title":"Hennessy-Milner classes and process algebra","author":"Hollenberg","year":"1995"},{"key":"10.1016\/B978-044482830-9\/50019-9_bib33","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/B978-044482830-9\/50019-9_bib34","article-title":"Formal semantics of nondetermism and parallelism","author":"Kennaway","year":"1981","journal-title":"Ph.D. Thesis, University of Oxford"},{"key":"10.1016\/B978-044482830-9\/50019-9_bib35","doi-asserted-by":"crossref","DOI":"10.1016\/0890-5401(91)90030-6","article-title":"Bisimulation through probabilistic testing","volume":"94","author":"Larsen","year":"1991","journal-title":"Inform. and Comput."},{"key":"10.1016\/B978-044482830-9\/50019-9_bib36","first-page":"83","article-title":"Report on the 5th international workshop on the semantics of programming languages in Bad Honnef","volume":"27","author":"Meyer","year":"1985","journal-title":"Bull. European Assoc. Theoret. Comput. Sci."},{"key":"10.1016\/B978-044482830-9\/50019-9_bib37","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","article-title":"A Calculus of Communicating Systems","author":"Milner","year":"1980"},{"key":"10.1016\/B978-044482830-9\/50019-9_bib38","series-title":"Proceedings CAAP '81","first-page":"25","article-title":"Modal characterisation of observable machine behaviour","author":"Milner","year":"1981"},{"key":"10.1016\/B978-044482830-9\/50019-9_bib39","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\/B978-044482830-9\/50019-9_bib40","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\/B978-044482830-9\/50019-9_bib41","series-title":"Proceedings 5th GI Conference","first-page":"167","article-title":"Concurrency and automata on infinite sequences","author":"Park","year":"1981"},{"key":"10.1016\/B978-044482830-9\/50019-9_bib42","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\/B978-044482830-9\/50019-9_bib43","series-title":"Proceedings 12th ICALP","first-page":"15","article-title":"Linear and branching structures in the semantics and logics of reactive systems","author":"Pnueli","year":"1985"},{"key":"10.1016\/B978-044482830-9\/50019-9_bib44","series-title":"Advances in Petri Nets 1985","first-page":"381","article-title":"Some equivalence notions for concurrent systems \u2013 An overview","author":"Pomello","year":"1986"},{"issue":"2","key":"10.1016\/B978-044482830-9\/50019-9_bib45","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1093\/logcom\/3.2.131","article-title":"Unbounded non-determinism in CSP","volume":"3","author":"Roscoe","year":"1993","journal-title":"J. Logic Comput."},{"key":"10.1016\/B978-044482830-9\/50019-9_bib46","series-title":"Proceedings 22th Annual Symposium on Foundations of Computer Science","first-page":"140","article-title":"Possible futures, acceptances, refusals and communicating processes","author":"Rounds","year":"1981"},{"key":"10.1016\/B978-044482830-9\/50019-9_bib47","series-title":"Proceedings CONCUR '91","first-page":"80","article-title":"Experiments on processes with backtracking","author":"Schnoebelen","year":"1991"},{"key":"10.1016\/B978-044482830-9\/50019-9_bib48","series-title":"Proceedings of the International Workshop on Structures in Concurrency Theory","first-page":"326","article-title":"Failure-based equivalences are faster than many believe","author":"Valmari","year":"1995"},{"key":"10.1016\/B978-044482830-9\/50019-9_bib49","series-title":"Proceedings CONCUR '98","first-page":"179","article-title":"Possible worlds for process algebras","author":"Veglioni","year":"1998"},{"issue":"1\/2","key":"10.1016\/B978-044482830-9\/50019-9_bib50","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0304-3975(84)90112-9","article-title":"Synchronization trees","volume":"34","author":"Winskel","year":"1984","journal-title":"Theoret. Comput. Sci."}],"container-title":["Handbook of Process Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780444828309500199?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780444828309500199?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,3]],"date-time":"2019-01-03T08:51:34Z","timestamp":1546505494000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780444828309500199"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9780444828309"],"references-count":50,"URL":"https:\/\/doi.org\/10.1016\/b978-044482830-9\/50019-9","relation":{},"subject":[],"published":{"date-parts":[[2001]]}}}