{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:18:30Z","timestamp":1725560310341},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540283096"},{"type":"electronic","value":"9783540319344"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11539452_29","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:54:50Z","timestamp":1127829290000},"page":"368-382","source":"Crossref","is-referenced-by-count":10,"title":["A Theory of System Behaviour in the Presence of Node and Link Failures"],"prefix":"10.1007","author":[{"given":"Adrian","family":"Francalanza","sequence":"first","affiliation":[]},{"given":"Matthew","family":"Hennessy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/3-540-63383-9_92","volume-title":"Coordination Languages and Models","author":"R.M. Amadio","year":"1997","unstructured":"Amadio, R.M.: An asynchronous model of locality, failure, and process mobility. In: Garlan, D., Le M\u00e9tayer, D. (eds.) COORDINATION 1997. LNCS, vol.\u00a01282, pp. 374\u2013391. Springer, Heidelberg (1997)"},{"key":"29_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"R.M. Amadio","year":"1994","unstructured":"Amadio, R.M., Prasad, S.: Localities and failures. In: Thiagarajan, P.S. (ed.) FSTTCS 1994. LNCS, vol.\u00a0880. Springer, Heidelberg (1994)"},{"key":"29_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-540-28644-8_8","volume-title":"CONCUR 2004 - Concurrency Theory","author":"M. Berger","year":"2004","unstructured":"Berger, M.: Basic theory of reduction congruence for two timed asynchronous \u03c0-calculi. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 115\u2013130. Springer, Heidelberg (2004)"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-48523-6_2","volume-title":"Automata, Languages and Programming","author":"L. Cardelli","year":"1999","unstructured":"Cardelli, L.: Wide area computation. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 10\u201324. Springer, Heidelberg (1999)"},{"issue":"2","key":"29_CR5","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":"29_CR6","doi-asserted-by":"crossref","unstructured":"De Nicola, R., Gorla, D., Pugliese, R.: Basic observables for a calulus for global computing. Technical report, Universita di Firenze (2004)","DOI":"10.1007\/11523468_99"},{"key":"29_CR7","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., Gonthier, G., Levy, J.J., Didier, R.: A calculus of mobile agents. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 406\u2013421. Springer, Heidelberg (1996)"},{"key":"29_CR8","unstructured":"Francalanza, A., Hennessy, M.: Location and link failure in a distributed \u03c0-calculus. Technical report, 2005:01, University of Sussex (2005)"},{"key":"29_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/3-540-51486-4_71","volume-title":"Mathematical Foundations of Computer Science 1989","author":"R.J. Glabbeek van","year":"1989","unstructured":"van Glabbeek, R.J., Goltz, U.: Equivalence notions for concurrent systems and refinement of actions. In: Kreczmar, A., Mirkowska, G. (eds.) MFCS 1989. LNCS, vol.\u00a0379, pp. 237\u2013248. Springer, Heidelberg (1989)"},{"key":"29_CR10","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":"29_CR11","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":"29_CR12","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"},{"issue":"2","key":"29_CR13","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":"29_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-540-45187-7_26","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, pp. 399\u2013414. Springer, Heidelberg (2003)"},{"key":"29_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":"29_CR16","volume-title":"The \u03c0-calculus","author":"D. Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The \u03c0-calculus. Cambridge University Press, Cambridge (2001)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2005 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11539452_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,4]],"date-time":"2023-05-04T19:40:56Z","timestamp":1683229256000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11539452_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540283096","9783540319344"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11539452_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}