{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T09:56:53Z","timestamp":1776333413853,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540572084","type":"print"},{"value":"9783540479680","type":"electronic"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57208-2_6","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:19:16Z","timestamp":1330258756000},"page":"66-81","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":222,"title":["The linear time \u2014 Branching time spectrum II"],"prefix":"10.1007","author":[{"given":"R. J.","family":"van Glabbeek","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"6_CR1","volume-title":"Programmatuurkunde","author":"J. C. M. M. Baeten","year":"1986","unstructured":"J.C.M. Baeten (1986): Procesalgebra. Programmatuurkunde. Kluwer, Deventer. In Dutch."},{"issue":"1\/2","key":"6_CR2","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0304-3975(87)90052-1","volume":"51","author":"J. C. M. M. Baeten","year":"1987","unstructured":"J.C.M. Baeten, J.A. Bergstra & J.W. Klop (1987): On the consistency of Koomen's fair abstraction rule. Theoretical Computer Science 51(1\/2), pp. 129\u2013176.","journal-title":"Theoretical Computer Science"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science 267","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/3-540-18088-5_8","volume-title":"Proceedings 14th ICALP","author":"J. C. M. M. Baeten","year":"1987","unstructured":"J.C.M. Baeten & R.J. van Glabbeek (1987): Another look at abstraction in process algebra. In Th. Ottmann, editor: Proceedings 14th ICALP, Karlsruhe, Lecture Notes in Computer Science 267, Springer-Verlag, pp. 84\u201394."},{"key":"6_CR4","volume-title":"Report CS-R9321","author":"J. Benthem van","year":"1993","unstructured":"J. van Benthem, J. van Eijck & V. Stebletsova (1993): Modal logic, transition systems and processes. Report CS-R9321, CWI, Amsterdam."},{"key":"6_CR5","first-page":"77","volume-title":"Formal Description of Programming Concepts \u2014 III, Proceedings of the 3th IFIP WG 2.2 working conference","author":"J. A. Bergstra","year":"1986","unstructured":"J.A. Bergstra, J.W. Klop & E.-R. Olderog (1987): Failures without chaos: a new process semantics for fair abstraction. In M. Wirsing, editor: Formal Description of Programming Concepts \u2014 III, Proceedings of the 3thIFIP WG 2.2 working conference, Ebberup 1986, North-Holland, Amsterdam, pp. 77\u2013103."},{"key":"6_CR6","unstructured":"S.D. Brookes & A.W. Roscoe (1985): An improved failures model for communicating processes. In S.D. Brookes, A.W. Roscoe & G. Winskel, editors: Seminar on Concurrency, Lecture Notes in Computer Science 197, Springer-Verlag, pp. 281\u2013305."},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0304-3975(88)90098-9","volume":"59","author":"M. C. Browne","year":"1988","unstructured":"M.C. Browne, E.M. Clarke & O. Gr\u00fcmberg (1988): Characterizing finite Kripke structures in propositional temporal logic. Theoretical Computer Science 59(1, 2), pp. 115\u2013131.","journal-title":"Theoretical Computer Science"},{"key":"6_CR8","unstructured":"F. Cherief (1992): Contributions \u00e0 la s\u00e9mantique du parall\u00e9lisme: bisimulations pour le raffinement et le vrai parall\u00e9lisme. PhD thesis, Univ. Grenoble."},{"key":"6_CR9","unstructured":"R. De Nicola & F.W. Vaandrager (1990): Three logics for branching bisimulation (extended abstract). In Proceedings 5th Annual Symposium on Logic in Computer Science, Philadelphia, USA, IEEE Computer Society Press, pp. 118\u2013129. Full version available as Rapporto di Ricerca SI-92\/07, Dipartimento di Scienze dell'Informazione, Universit\u00e0 degli Studi di Roma \u201cLa Sapienza\u201d, November 1992."},{"key":"6_CR10","series-title":"Lecture Notes in Computer-Science 458","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/BFb0039066","volume-title":"Proceedings CONCUR 90","author":"R. J. Glabbeek van","year":"1990","unstructured":"R.J. van Glabbeek (1990): The linear time \u2014 branching time spectrum. In J.C.M. Baeten & J.W. Klop, editors: Proceedings CONCUR 90, Amsterdam, Lecture Notes in Computer-Science 458, Springer-Verlag, pp. 278\u2013297."},{"key":"6_CR11","unstructured":"R.J. van Glabbeek & F.W. Vaandrager (1989): Modular specifications in process algebra \u2014 with curious queues (extended abstract). In M. Wirsing & J.A. Bergstra, editors: Algebraic Methods: Theory, Tools and Applications, Workshop Passau 1987, Lecture Notes in Computer Science 394, Springer-Verlag, pp. 465\u2013506."},{"key":"6_CR12","first-page":"613","volume-title":"Technical Report TUM-I9052, SFB-Bericht Nr. 342\/29\/90 A","author":"R. J. Glabbeek van","year":"1990","unstructured":"R.J. van Glabbeek & W.P. Weijland (1990): Branching time and abstraction in bisimulation semantics. Technical Report TUM-I9052, SFB-Bericht Nr. 342\/29\/90 A, Institut f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen, Munich, Germany. Extended abstract in G.X. Ritter, editor: Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Fransisco, USA 1989, Elsevier Science Publishers B.V. (North-Holland), 1989, pp. 613\u2013618."},{"issue":"2","key":"6_CR13","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/0890-5401(92)90013-6","volume":"100","author":"J. F. Groote","year":"1992","unstructured":"J.F. Groote & F.W. Vaandrager (1992): Structured operational semantics and bisimulation as a congruence. Information and Computation 100(2), pp. 202\u2013260.","journal-title":"Information and Computation"},{"key":"6_CR14","unstructured":"M. Hennessy & G.D. Plotkin (1980): A term model for CCS. In P.Dembi\u0144ski, editor: 9th Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 88, Springer-Verlag, pp. 261\u2013274."},{"key":"6_CR15","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1109\/TSE.1977.229904","volume":"3","author":"L. Lamport","year":"1977","unstructured":"L. Lamport (1977): Proving the correctness of multiprocess programs. IEEE Trans. Software Engin. 3, pp. 125\u2013143.","journal-title":"IEEE Trans. Software Engin"},{"key":"6_CR16","unstructured":"R. Langerak (1989): A testing theory for LOTOS using deadlock detection. In E. Brinksma, G. Scollo & C.A. Vissers, editors: Proceedings 9th IFIP WG6.1 International Symposium on Protocol Specification, Testing, and Verification, Enschede, The Netherlands."},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"R. Milner (1981): A modal characterisation of observable machine-behaviour. In G. Astesiano & C. Bohm, editors: Proceedings CAAP 81, Lecture Notes in Computer Science 112, Springer-Verlag, pp. 25\u201334.","DOI":"10.1007\/3-540-10828-9_52"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"R. Milner (1985): Lectures on a calculus for communicating systems. In S.D. Brookes, A.W. Roscoe & G. Winskel, editors: Seminar on Concurrency, Lecture Notes in Computer Science 197, Springer-Verlag, pp. 197\u2013220.","DOI":"10.1007\/3-540-15670-4_10"},{"key":"6_CR19","first-page":"1201","volume-title":"Handbook of Theoretical Computer Science, chapter 19","author":"R. Milner","year":"1990","unstructured":"R. Milner (1990): Operational and algebraic semantics of concurrent processes. In J. van Leeuwen, editor: Handbook of Theoretical Computer Science, chapter 19, Elsevier Science Publishers B.V. (North-Holland), pp. 1201\u20131242. Alternatively see Communication and Concurrency, Prentice-Hall International, Englewood Cliffs, 1989, of which an earlier version appeared as A Calculus of Communicating Systems, LNCS 92, Springer-Verlag, 1980."},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science 630","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1007\/BFb0084813","volume-title":"Proceedings CONCUR 92","author":"J. Parrow","year":"1992","unstructured":"J. Parrow & P. Sj\u00f6din (1992): Multiway synchronization verified with coupled simulation. In W.R. Cleaveland, editor: Proceedings CONCUR 92, Stony Brook, NY, USA, Lecture Notes in Computer Science 630, Springer-Verlag, pp. 518\u2013533."},{"key":"6_CR21","first-page":"27","volume-title":"To papers on CSP, Technical Monograph PRG-67, Programming Research Group","author":"A. W. Roscoe","year":"1988","unstructured":"A.W. Roscoe (1988): Unbounded nondeterminism in CSP. In To papers on CSP, Technical Monograph PRG-67, Programming Research Group, Oxford University Computing Laboratory, Oxford, England, pp. 27\u201380."},{"key":"6_CR22","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0304-3975(87)90012-0","volume":"49","author":"C. Stirling","year":"1987","unstructured":"C. Stirling (1987): Modal logics for communicating systems. Theoretical Computer Science 49, pp. 311\u2013347.","journal-title":"Theoretical Computer Science"},{"key":"6_CR23","first-page":"148","volume-title":"Proceedings 7th Annual Symposium on Logic in Computer Science","author":"I. Ulidowski","year":"1992","unstructured":"I. Ulidowski (1992): Equivalences on observable processes. In Proceedings 7thAnnual Symposium on Logic in Computer Science, Santa Cruz, California, IEEE Computer Society Press, pp. 148\u2013159."},{"issue":"2","key":"6_CR24","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/0890-5401(90)90048-M","volume":"85","author":"D. J. Walker","year":"1990","unstructured":"D.J. Walker (1990): Bisimulation and divergence. Information and Computation 85(2), pp. 202\u2013241.","journal-title":"Information and Computation"},{"key":"6_CR25","unstructured":"W.P. Weijland (1989): Synchrony and asynchrony in process algebra. PhD thesis, University of Amsterdam."}],"container-title":["Lecture Notes in Computer Science","CONCUR'93"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57208-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T00:14:15Z","timestamp":1578528855000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57208-2_6"}},"subtitle":["The semantics of sequential systems with silent moves extended abstract"],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540572084","9783540479680"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-57208-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]},"assertion":[{"value":"27 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}