{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T19:33:42Z","timestamp":1774294422092,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540258131","type":"print"},{"value":"9783540322658","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11423348_2","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T06:36:01Z","timestamp":1279089361000},"page":"15-35","source":"Crossref","is-referenced-by-count":17,"title":["Seeing Beyond Divergence"],"prefix":"10.1007","author":[{"given":"A. W.","family":"Roscoe","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/BF01898399","volume":"3","author":"G. Barrett","year":"1991","unstructured":"Barrett, G.: The fixed-point theory of unbounded nondeterminism. Formal Aspects of Computing\u00a03, 110\u2013128 (1991)","journal-title":"Formal Aspects of Computing"},{"issue":"3","key":"2_CR2","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":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-15670-4","volume-title":"Seminar on Concurrency","author":"S.D. Brookes","year":"1985","unstructured":"Brookes, S.D., Roscoe, A.W.: Seminar on Concurrency. LNCS, vol.\u00a0197. Springer, Heidelberg (1985)"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(86)90040-X","volume":"45","author":"M. Broy","year":"1986","unstructured":"Broy, M.: A theory for nondeterminism, parallelism, communication and concurrency. Theoretical Computer Science\u00a045, 1\u201361 (1986)","journal-title":"Theoretical Computer Science"},{"key":"2_CR5","unstructured":"Formal Systems (Europe) Ltd., Failures-Divergence Refinement, User Manual, obtainable from, \n                    \n                      http:\/\/www.fsel.com\/fdr2_manual.html"},{"key":"2_CR6","volume-title":"On the construction of programs","author":"C.A.R. Hoare","year":"1980","unstructured":"Hoare, C.A.R.: A model for communicating sequential processes. In: Keag, M., Naughten, M. (eds.) On the construction of programs, Cambridge University Press, Cambridge (1980)"},{"key":"2_CR7","volume-title":"Communicating sequential processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating sequential processes. Prentice-Hall, Englewood Cliffs (1985)"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1137\/0205033","volume":"5","author":"Z. Manna","year":"1976","unstructured":"Manna, Z., Shamir, A.: The theoretical aspects of the optimal fixed point. SIAM Journal of Computing\u00a05, 14\u2013426 (1976)","journal-title":"SIAM Journal of Computing"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/3-540-45500-0_20","volume-title":"Theoretical Aspects of Computer Software","author":"A. Puhakka","year":"2001","unstructured":"Puhakka, A.: Weakest Congruence Results Concerning \u201cAny-Lock\u201d. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol.\u00a02215, pp. 400\u2013419. Springer, Heidelberg (2001)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1007\/3-540-48320-9_35","volume-title":"CONCUR\u201999. Concurrency Theory","author":"A. Puhakka","year":"1999","unstructured":"Puhakka, A., Valmari, A.: Weakest-Congruence Results for Livelock-Preserving Equivalences. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol.\u00a01664, pp. 510\u2013524. Springer, Heidelberg (1999)"},{"key":"2_CR11","volume-title":"The theory and practice of concurrency","author":"A.W. Roscoe","year":"1998","unstructured":"Roscoe, A.W.: The theory and practice of concurrency. Prentice-Hall International, Englewood Cliffs (1998)"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Roscoe, A.W.: An alternative order for the failures model, in \u201cTwo papers on CSP\u201d, technical monograph PRG-67, Oxford University Computing Laboratory, July 1988. Also Journal of Logic and Computation 2 (5), 557\u2013577 (1992)","DOI":"10.1093\/logcom\/2.5.557"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Roscoe, A.W.: Unbounded nondeterminism in CSP, in \u201cTwo papers on CSP\u201d, technical monograph PRG-67, Oxford University Computing Laboratory, July 1988. Also Journal of Logic and Computation, 3 (2), 131\u2013172 (1993)","DOI":"10.1093\/logcom\/3.2.131"},{"key":"2_CR14","unstructured":"Valmari, A.: A Chaos-Free Failures Divergences Semantics with Applications to Verification. In: Millennial Perspectives in Computer Science: Proceedings of the 1999 Oxford\u2013Microsoft Symposium in honour of Sir Tony Hoare, Palgrave. Cornerstones of Computing series, pp. 365\u2013382 (2000)"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/0020-0190(94)00214-J","volume":"53","author":"A. Valmari","year":"1995","unstructured":"Valmari, A.: The weakest deadlock-preserving congruence. Information Processing Letters\u00a053, 341\u2013346 (1995)","journal-title":"Information Processing Letters"},{"key":"2_CR16","unstructured":"A. Valmari and M. Tienari An improved failures equivalence for finite-state systems with a reduction algorithm, Protocol Specification, Testing and Verification XI, North-Holland, 1991."},{"issue":"1-3","key":"2_CR17","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/S0304-3975(02)00893-9","volume":"308","author":"Y. Chen","year":"2003","unstructured":"Chen, Y.: A fixpoint theory for non-monotonic parallelism. Theoretical Computer Science\u00a0308(1-3), 367\u2013392 (2003)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Communicating Sequential Processes. The First 25 Years"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11423348_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:57Z","timestamp":1619507097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11423348_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540258131","9783540322658"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11423348_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}