{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:54Z","timestamp":1725544074509},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540330455"},{"type":"electronic","value":"9783540330462"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","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\/11690634_2","type":"book-chapter","created":{"date-parts":[[2006,3,28]],"date-time":"2006-03-28T14:15:28Z","timestamp":1143555328000},"page":"16-31","source":"Crossref","is-referenced-by-count":3,"title":["A Theory for Observational Fault Tolerance"],"prefix":"10.1007","author":[{"given":"Adrian","family":"Francalanza","sequence":"first","affiliation":[]},{"given":"Matthew","family":"Hennessy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"Amadio, R.M., Prasad, S.: Localities and failures. FSTTCS: Foundations of Software Technology and Theoretical Computer Science\u00a014 (1994)"},{"issue":"2","key":"2_CR2","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/102792.102801","volume":"34","author":"F. Christian","year":"1991","unstructured":"Christian, F.: Understanding fault tolerant distributed systems. Communications of the ACM\u00a034(2), 56\u201378 (1991)","journal-title":"Communications of the ACM"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Ciaffaglione, A., Hennessy, M., Rathke, J.: Proof methodologies for behavioural equivalence in D\u03c0. Technical Report 03\/2005, University of Sussex (2005)","DOI":"10.1007\/11562436_25"},{"key":"2_CR4","unstructured":"Francalanza, A., Hennessy, M.: A theory for observational fault tolerance, www.cs.um.edu.mt\/~afran\/"},{"key":"2_CR5","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":"2_CR6","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1016\/j.tcs.2003.12.024","volume":"322","author":"M. Hennessy","year":"2004","unstructured":"Hennessy, M., Merro, M., Rathke, J.: Towards a behavioural theory of access and mobility control in distributed systems. Theoretical Computer Science\u00a0322, 615\u2013669 (2004)","journal-title":"Theoretical Computer Science"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1017\/S0960129504004281","volume":"14","author":"M. Hennessy","year":"2004","unstructured":"Hennessy, M., Rathke, J.: Typed behavioural equivalences for processes in the presence of subtyping. Mathematical Structures in Computer Science\u00a014, 651\u2013684 (2004)","journal-title":"Mathematical Structures in Computer Science"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1006\/inco.2001.3089","volume":"173","author":"M. Hennessy","year":"2002","unstructured":"Hennessy, M., Riely, J.: Resource access control in systems of mobile agents. Information and Computation\u00a0173, 82\u2013120 (2002)","journal-title":"Information and Computation"},{"key":"2_CR9","unstructured":"Prasad, K.V.S.: Combinators and Bisimulation Proofs for Restartable Systems. PhD thesis, Department of Computer Science, University of Edinburgh (December 1987)"},{"key":"2_CR10","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":"2_CR11","volume-title":"The \u03c0-calculus","author":"D. Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The \u03c0-calculus. Cambridge University Press, Cambridge (2001)"},{"issue":"3","key":"2_CR12","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1145\/357369.357371","volume":"1","author":"R.D. Schlichting","year":"1983","unstructured":"Schlichting, R.D., Schneider, F.B.: Fail-stop processors: An approach to designing fault-tolerant computing systems. Computer Systems\u00a01(3), 222\u2013238 (1983)","journal-title":"Computer Systems"},{"key":"2_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-1663-7","volume-title":"Distributed Systems for System Architects","author":"P. Verissimo","year":"2001","unstructured":"Verissimo, P., Rodrigues, L.: Distributed Systems for System Architects. Kluwer Academic Publishers, Dordrecht (2001)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11690634_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T17:19:07Z","timestamp":1555521547000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11690634_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540330455","9783540330462"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11690634_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}