{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T02:06:07Z","timestamp":1776305167926,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540530480","type":"print"},{"value":"9783540463955","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/bfb0039066","type":"book-chapter","created":{"date-parts":[[2006,1,31]],"date-time":"2006-01-31T09:58:08Z","timestamp":1138701488000},"page":"278-297","source":"Crossref","is-referenced-by-count":204,"title":["The linear time - branching time spectrum"],"prefix":"10.1007","author":[{"given":"R. J.","family":"van Glabbeek","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,16]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(87)90065-X","volume":"53","author":"S. Abramsky","year":"1987","unstructured":"S. Abramsky (1987): Observation equivalence as a testing equivalence. TCS 53, pp. 225\u2013241.","journal-title":"TCS"},{"key":"21_CR2","unstructured":"S. Abramsky & S. Vickers (1990): Quantales, observational logic, and process semantics, unpublished manuscript."},{"key":"21_CR3","unstructured":"P. Aczel (1988): Non-well-founded sets, CSLI Lecture Notes No. 14, Stanford University."},{"issue":"6","key":"21_CR4","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1093\/comjnl\/30.6.498","volume":"30","author":"J.C.M. Baeten","year":"1987","unstructured":"J.C.M. Baeten, J.A. Bergstra & J.W. Klop (1987): Ready-trace semantics for concrete process algebra with the priority operator. The Computer Journal 30(6), pp. 498\u2013506.","journal-title":"The Computer Journal"},{"key":"21_CR5","first-page":"51","volume":"224","author":"J.W. Bakker de","year":"1986","unstructured":"J.W. de Bakker, J.N. Kok, J.-J.Ch. Meyer, E.-R. Olderog & J.I. Zucker (1986): Contrasting themes in the semantics of imperative concurrency. In: Current trends in concurrency (J.W. de Bakker, W.-P. de Roever & G. Rozenberg, eds.), LNCS 224, Springer-Verlag, pp. 51\u2013121.","journal-title":"LNCS"},{"issue":"1\/2","key":"21_CR6","first-page":"70","volume":"54","author":"J.W. Bakker de","year":"1982","unstructured":"J.W. de Bakker & J.I. Zucker (1982): Processes and the denotational semantics of concurrency. I&C 54(1\/2), pp. 70\u2013120.","journal-title":"I&C"},{"issue":"6","key":"21_CR7","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1137\/0217073","volume":"17","author":"J.A. Bergstra","year":"1988","unstructured":"J.A. Bergstra, J.W. Klop & E.-R. Olderog (1988): Readies and failures in the algebra of communicating processes. SIAM Journal on Computing 17(6), pp. 1134\u20131177.","journal-title":"SIAM Journal on Computing"},{"key":"21_CR8","unstructured":"B. Bloom, S. Istrail & A.R. Meyer (1988): Bisimulation can't be traced: preliminary report. In: Conference Record of the 15\n                  th\n                 ACM Symposium on Principles of Programming Languages (POPL), San Diego, California, pp. 229\u2013239."},{"issue":"3","key":"21_CR9","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S.D. Brookes","year":"1984","unstructured":"S.D. Brookes, C.A.R. Hoare & A.W. Roscoe (1984): A theory of communicating sequential processes. JACM 31(3), pp. 560\u2013599.","journal-title":"JACM"},{"key":"21_CR10","first-page":"47","volume":"137","author":"P. Darondeau","year":"1982","unstructured":"Ph. Darondeau (1982): An enlarged definition and complete axiomatisation of observational congruence of finite processes. In: Proceedings international symposium on programming: 5th colloquium, Aarhus (M. Dezani-Ciancaglini & U. Montanari, eds.), LNCS 137, Springer-Verlag, pp. 47\u201362.","journal-title":"LNCS"},{"key":"21_CR11","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF00264365","volume":"24","author":"R. Nicola de","year":"1987","unstructured":"R. de Nicola (1987): Extensional equivalences for transition systems. Acta Informatica 24, pp. 211\u2013237.","journal-title":"Acta Informatica"},{"key":"21_CR12","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola de","year":"1984","unstructured":"R. de Nicola & M. Hennessy (1984): Testing equivalences for processes. TCS 34, pp. 83\u2013133.","journal-title":"TCS"},{"key":"21_CR13","unstructured":"R.J. van Glabbeek & J.J.M.M. Rutten (1989): The processes of De Bakker and Zucker represent bisimulation equivalence classes. In: J.W. de Bakker, 25 jaar semantiek, liber amicorum, pp. 243\u2013246."},{"key":"21_CR14","volume-title":"Proceedings 5 th Annual Symposium on Logic in Computer Science (LICS 90), Philadelphia, USA","author":"R.J. Glabbeek van","year":"1990","unstructured":"R.J. van Glabbeek, S.A. Smolka, B. Steffen & C.M.N. Tofts (1990): Reactive, generative, and stratified models of probabilistic processes, to appear in: Proceedings 5\n                  th\n                 Annual Symposium on Logic in Computer Science (LICS 90), Philadelphia, USA, IEEE Computer Society Press, Washington."},{"key":"21_CR15","first-page":"423","volume":"372","author":"J.F. Groote","year":"1988","unstructured":"J.F. Groote & F.W. Vaandrager (1988): Structured operational semantics and bisimulation as a congruence. Report CS-R8845, Centrum voor Wiskunde en Informatica, Amsterdam, under revision for I&C. An extended abstract appeared in: Proceedings ICALP 89, Stresa (G. Ausiello, M. Dezani-Ciancaglini & S. Ronchi Della Rocca, eds.), LNCS 372, Springer-Verlag, pp. 423\u2013438.","journal-title":"LNCS"},{"issue":"4","key":"21_CR16","doi-asserted-by":"crossref","first-page":"896","DOI":"10.1145\/4221.4249","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"M. Hennessy (1985): Acceptance trees. JACM 32(4), pp. 896\u2013928.","journal-title":"JACM"},{"key":"21_CR17","first-page":"299","volume":"85","author":"M. Hennessy","year":"1980","unstructured":"M. Hennessy & R. Milner (1980): On observing nondeterminism and concurrency. In: Proceedings ICALP 80 (J. de Bakker & J. van Leeuwen, eds.), LNCS 85, Springer-Verlag, pp. 299\u2013309, a preliminary version of:.","journal-title":"LNCS"},{"issue":"1","key":"21_CR18","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"M. Hennessy & R. Milner (1985): Algebraic laws for nondeterminism and concurrency. JACM 32(1), pp. 137\u2013161.","journal-title":"JACM"},{"issue":"8","key":"21_CR19","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"C.A.R. Hoare","year":"1978","unstructured":"C.A.R. Hoare (1978): Communicating sequential processes. Communications of the ACM 21(8), pp. 666\u2013677.","journal-title":"Communications of the ACM"},{"key":"21_CR20","unstructured":"C.A.R. Hoare (1980): Communicating sequential processes. In: On the construction of programs \u2014 an advanced course (R.M. McKeag & A.M. Macnaghten, eds.), Cambridge University Press, pp. 229\u2013254."},{"key":"21_CR21","unstructured":"C.A.R. Hoare (1985): Communicating sequential processes, Prentice-Hall International."},{"key":"21_CR22","unstructured":"J.K. Kennaway (1981): Formal semantics of nondetermism and parallelism. Ph.D. Thesis, University of Oxford."},{"key":"21_CR23","volume-title":"Conference Record of the 16 th Annual ACM Symposium on Principles of Programming Languages (POPL), Austin, Texas","author":"K.G. Larsen","year":"1988","unstructured":"K.G. Larsen & A. Skou (1988): Bisimulation through probabilistic testing. R 88-29, Institut for Elektroniske Systemer, Afdeling for Matematik og Datalogi, Aalborg Universitetscenter, a preliminary report appeared in: Conference Record of the 16\n                  th\n                 Annual ACM Symposium on Principles of Programming Languages (POPL), Austin, Texas, ACM Press, New York 1989."},{"key":"21_CR24","first-page":"83","volume":"27","author":"A.R. Meyer","year":"1985","unstructured":"A.R. Meyer (1985): Report on the 5th international workshop on the semantics of programming languages in Bad Honnef. Bulletin of the EATCS 27, pp. 83\u201384.","journal-title":"Bulletin of the EATCS"},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"R. Milner (1980): A calculus of communicating systems, LNCS 92, Springer-Verlag.","DOI":"10.1007\/3-540-10235-3"},{"key":"21_CR26","first-page":"25","volume":"112","author":"R. Milner","year":"1981","unstructured":"R. Milner (1981): A modal characterisation of observable machine-behaviour. In: Proceedings CAAP 81 (G. Astesiano & C. B\u00f6hm, eds.), LNCS 112, Springer-Verlag, pp. 25\u201334.","journal-title":"LNCS"},{"key":"21_CR27","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"25","author":"R. Milner","year":"1983","unstructured":"R. Milner (1983): Calculi for synchrony and asynchrony. TCS 25, pp. 267\u2013310.","journal-title":"TCS"},{"key":"21_CR28","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF00268075","volume":"23","author":"E.-R. Olderog","year":"1986","unstructured":"E.-R. Olderog & C.A.R. Hoare (1986): Specification-oriented semantics for communicating processes. Acta Informatica 23, pp. 9\u201366.","journal-title":"Acta Informatica"},{"key":"21_CR29","first-page":"167","volume":"104","author":"D.M.R. Park","year":"1981","unstructured":"D.M.R. Park (1981): Concurrency and automata on infinite sequences. In: Proceedings 5\n                  th\n                 GI Conference (P. Deussen, ed.), LNCS 104, Springer-Verlag, pp. 167\u2013183.","journal-title":"LNCS"},{"key":"21_CR30","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0304-3975(87)90117-4","volume":"50","author":"I.C.C. Phillips","year":"1987","unstructured":"I.C.C. Phillips (1987): Refusal testing. TCS 50, pp. 241\u2013284.","journal-title":"TCS"},{"key":"21_CR31","first-page":"15","volume":"194","author":"A. Pnueli","year":"1985","unstructured":"A. Pnueli (1985): Linear and branching structures in the semantics and logics of reactive systems. In: Proceedings ICALP 85, Nafplion (W. Brauer, ed.), LNCS 194, Springer-Verlag, pp. 15\u201332.","journal-title":"LNCS"},{"key":"21_CR32","first-page":"381","volume":"222","author":"L. Pomello","year":"1986","unstructured":"L. Pomello (1986): Some equivalence notions for concurrent systems. An overview. In: Advances in Petri Nets 1985 (G. Rozenberg, ed.), LNCS 222, Springer-Verlag, pp. 381\u2013400.","journal-title":"LNCS"},{"key":"21_CR33","first-page":"140","volume-title":"Possible futures, acceptances, refusals and communicating processes","author":"W.C. Rounds","year":"1981","unstructured":"W.C. Rounds & S.D. Brookes (1981): Possible futures, acceptances, refusals and communicating processes. In: Proceedings 22\n                  th\n                 Annual Symposium on Foundations of Computer Science, Nashville, USA 1981, IEEE, New York, pp. 140\u2013149."}],"container-title":["Lecture Notes in Computer Science","CONCUR '90 Theories of Concurrency: Unification and Extension"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0039066","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,9]],"date-time":"2019-02-09T06:47:31Z","timestamp":1549694851000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0039066"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540530480","9783540463955"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/bfb0039066","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990]]}}}