{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:51:20Z","timestamp":1725511880995},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540713142"},{"type":"electronic","value":"9783540713166"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-71316-6_27","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:58:28Z","timestamp":1184590708000},"page":"395-410","source":"Crossref","is-referenced-by-count":10,"title":["A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Adrian","family":"Francalanza","sequence":"first","affiliation":[]},{"given":"Matthew","family":"Hennessy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Berger, M., Honda, K.: The two-phase commitment protocol in an extended pi-calculus. Electr. Notes Theor. Comput. Sci.\u00a039(1) (2000)","DOI":"10.1016\/S1571-0661(05)82502-2"},{"issue":"2","key":"27_CR2","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM\u00a043(2), 225\u2013267 (1996)","journal-title":"Journal of the ACM"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Deng, Y., Sangiorgi, D.: Ensuring termination by typability. In: IFIP TCS, pp. 619\u2013632 (2004)","DOI":"10.1007\/1-4020-8141-3_47"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/3-540-12689-9_99","volume-title":"Foundations of Computation Theory","author":"M.J. Fischer","year":"1983","unstructured":"Fischer, M.J.: The consensus problem in unreliable distributed systems (a brief survey). In: Karpinski, M. (ed.) FCT 1983. LNCS, vol.\u00a0158, pp. 127\u2013140. Springer, Heidelberg (1983)"},{"key":"27_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1007\/3-540-61604-7_67","volume-title":"CONCUR \u201996: Concurrency Theory","author":"C. Fournet","year":"1996","unstructured":"Fournet, C., et al.: A calculus of mobile agents. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 406\u2013421. Springer, Heidelberg (1996)"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/11539452_29","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"A. Francalanza","year":"2005","unstructured":"Francalanza, A., Hennessy, M.: A theory of system behaviour in the presence of node and link failures. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 368\u2013382. Springer, Heidelberg (2005)"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11690634_2","volume-title":"Foundations of Software Science and Computation Structures","author":"A. Francalanza","year":"2006","unstructured":"Francalanza, A., Hennessy, M.: A theory of system fault tolerance. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FOSSACS 2006 and ETAPS 2006. LNCS, vol.\u00a03921, Springer, Heidelberg (2006)"},{"issue":"1-2","key":"27_CR8","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0304-3975(96)80702-X","volume":"170","author":"J.F. Groote","year":"1996","unstructured":"Groote, J.F., Sellink, M.P.A.: Confluence for process verification. Theor. Comput. Sci.\u00a0170(1-2), 47\u201381 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Groote, J.F., van de Pol, J.: State space reduction using partial tau-confluence. In: Mathematical Foundations of Computer Science, pp. 383\u2013393 (2000)","DOI":"10.1007\/3-540-44612-5_34"},{"issue":"2","key":"27_CR10","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/0304-3975(95)00074-7","volume":"152","author":"K. Honda","year":"1995","unstructured":"Honda, K., Yoshida, N.: On reduction-based process semantics. Theoretical Computer Science\u00a0152(2), 437\u2013486 (1995)","journal-title":"Theoretical Computer Science"},{"key":"27_CR11","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)"},{"key":"27_CR12","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/978-3-540-40965-6_5","volume-title":"Advances in Computing Science \u2013 ASIAN 2003","author":"U. Nestmann","year":"2003","unstructured":"Nestmann, U., Fuzzati, R.: Unreliable Failure Detectors via Operational Semantics. In: Saraswat, V.A. (ed.) ASIAN 2003. LNCS, vol.\u00a02896, pp. 54\u201371. Springer, Heidelberg (2003)"},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"CONCUR 2003 - Concurrency Theory","author":"U. Nestmann","year":"2003","unstructured":"Nestmann, U., Fuzzati, R., Merro, M.: Modeling consensus in a process calculus. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, Springer, Heidelberg (2003)"},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1016\/S0304-3975(00)00326-1","volume":"226","author":"J. Riely","year":"2001","unstructured":"Riely, J., Hennessy, M.: Distributed processes and location failures. Theoretical Computer Science\u00a0226, 693\u2013735 (2001)","journal-title":"Theoretical Computer Science"},{"key":"27_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0020419","volume-title":"Introduction to distributed algorithms","author":"G. Tel","year":"1994","unstructured":"Tel, G.: Introduction to distributed algorithms. Cambridge University Press, New York (1994)"},{"issue":"2","key":"27_CR17","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.ic.2003.08.004","volume":"191","author":"N. Yoshida","year":"2004","unstructured":"Yoshida, N., Berger, M., Honda, K.: Strong normalisation in the pi-calculus. Inf. Comput.\u00a0191(2), 145\u2013202 (2004)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71316-6_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:49:42Z","timestamp":1556668182000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71316-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540713142","9783540713166"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71316-6_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}