{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:34:11Z","timestamp":1775054051573,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540373766","type":"print"},{"value":"9783540373773","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11817949_9","type":"book-chapter","created":{"date-parts":[[2006,8,2]],"date-time":"2006-08-02T19:59:29Z","timestamp":1154548769000},"page":"126-141","source":"Crossref","is-referenced-by-count":7,"title":["Liveness, Fairness and Impossible Futures"],"prefix":"10.1007","author":[{"given":"Rob","family":"van Glabbeek","sequence":"first","affiliation":[]},{"given":"Marc","family":"Voorhoeve","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Aceto, L.(moderator): Some open problems in Process Algebra (2003), \n                    \n                      http:\/\/www.cs.auc.dk\/luca\/BICI\/open-problems.html"},{"key":"9_CR2","series-title":"Cambridge Tracts in Theoretical Computer Science 17","volume-title":"Applications of Process Algebra","year":"1990","unstructured":"Baeten, J.C.M. (ed.): Applications of Process Algebra. Cambridge Tracts in Theoretical Computer Science 17. Cambridge University Press, Cambridge (1990)"},{"issue":"l\/2","key":"9_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0304-3975(87)90052-1","volume":"51","author":"J.C.M. Baeten","year":"1987","unstructured":"Baeten, J.C.M., Bergstra, J.A., Klop, J.W.: On the consistency of Koomen\u2019s fair abstraction rule. Theoretical Computer Science\u00a051(l\/2), 129\u2013176 (1987)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1145\/200836.200876","volume":"42","author":"B. Bloom","year":"1995","unstructured":"Bloom, B., Istrael, S., Meyer, A.: Bisimulation Can\u2019t Be Traced. Journal of the ACM\u00a042(1), 232\u2013268 (1995)","journal-title":"Journal of the ACM"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Brinksma, E., Rensink, A., Vogler, W.: Fair Testing. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 311\u2013327. Springer, Heidelberg (1995); Journal preprint: \n                    \n                      http:\/\/eprints.eemcs.utwente.nl\/1623\/01\/submitted.pdf","DOI":"10.1007\/3-540-60218-6_23"},{"issue":"3","key":"9_CR6","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S.D. Brookes","year":"1984","unstructured":"Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. Journal of the ACM\u00a031(3), 560\u2013599 (1984)","journal-title":"Journal of the ACM"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0025774","volume-title":"Logics of Programs","author":"E.M. Clarke","year":"1982","unstructured":"Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching-time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol.\u00a0131, pp. 52\u201371. Springer, Heidelberg (1982)"},{"issue":"2","key":"9_CR8","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1145\/201019.201032","volume":"42","author":"R. Nicola De","year":"1995","unstructured":"De Nicola, R., Vaandrager, F.W.: Three logics for branching bisimulation. Journal of the ACM\u00a042(2), 458\u2013487 (1995)","journal-title":"Journal of the ACM"},{"key":"9_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4886-6","volume-title":"Fairness","author":"N. Francez","year":"1986","unstructured":"Francez, N.: Fairness. Springer, Heidelberg (1986)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/3-540-57208-2_6","volume-title":"CONCUR\u201993","author":"R.J. Glabbeek van","year":"1993","unstructured":"van Glabbeek, R.J.: The Linear Time \u2013 Branching Time Spectrum II: The semantics of sequential systems with silent moves (extended abstract). In: Best, E. (ed.) CONCUR 1993. LNCS, vol.\u00a0715, pp. 66\u201381. Springer, Heidelberg (1993)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/11601548_4","volume-title":"Processes, Terms and Cycles: Steps on the Road to Infinity: Essays Dedicated to J.W. Klop, On the Occasion of His 60th Birthday","author":"R.J. Glabbeek van","year":"2005","unstructured":"van Glabbeek, R.J.: A Characterisation of Weak Bisimulation Congruence. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity: Essays Dedicated to J.W. Klop, On the Occasion of His 60th Birthday, LNCS, vol.\u00a03838, pp. 26\u201339. Springer, Heidelberg (2005)"},{"key":"#cr-split#-9_CR12.1","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall International, Englewood Cliffs (1990)"},{"key":"#cr-split#-9_CR12.2","unstructured":"In: Milner, R.(ed.) A Calculus of Communication Systems. LNCS, vol.\u00a092. Springer, Heidelberg (1980) (earlier version appeared)"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-55767-9","volume-title":"Modular Construction and Partial Order Semantics of Petri Nets","author":"W. Vogler","year":"1992","unstructured":"Vogler, W.: Modular Construction and Partial Order Semantics of Petri Nets. LNCS, vol.\u00a0625. Springer, Heidelberg (1992)"},{"issue":"1","key":"9_CR14","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0020-0190(01)00217-4","volume":"80","author":"M. Voorhoeve","year":"2001","unstructured":"Voorhoeve, M., Mauw, S.: Impossible Futures and Determinism. Information Processing Letters\u00a080(1), 51\u201358 (2001)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2006 \u2013 Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11817949_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:16:12Z","timestamp":1558286172000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11817949_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540373766","9783540373773"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11817949_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}