A theory of system behaviour in the presence of node and link failures

Lecture Notes in Computer Science

Volumn 3653, Issue , 2005, Pages 368-382

  Francalanza, Adrian ^a   Hennessy, Matthew ^a  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION;

DISTRIBUTED NETWORKS; DISTRIBUTED PROGRAMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 27244458244     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11539452_29     Document Type: Conference Paper

References (16)

1. Roberto M. Amadio. An asynchronous model of locality, failure, and process mobility. In Proc. COORDINATION'97, volume 1282, pages 374-391, Berlin, Germany, 1997. Springer-Verlag.
2. Roberto M. Amadio and Sanjiva Prasad. Localities and failures. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, 14, 1994.
3. Martin Berger. Basic theory of reduction congruence for two timed asynchronous π-calculi. In Proc. CONCUR'04, 2004.
4. th ICALP, Lecture Notes in Computer Science, pages 10-24. Springer-Verlag, 1999.
5. Tushar Deepak Chandra and Sam Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225-267, March 1996.
6. Rocco De Nicola, Daniele Gorla, and Rosario Pugliese. Basic observables for a calulus for global computing. Technical report, Universita di Firenze, 2004.
7. Cedric Fournet, Georges Gonthier, Jean Jaques Levy, and Remy Didier. A calculus of mobile agents. CONCUR 96, LNCS 1119:406-421, August 1996.
8. Adrian Francalanza and Matthew Hennessy. Location and link failure in a distributed π-calculus. Technical report, 2005:01, University of Sussex, 2005.
9. R.J. van Glabbeek and U. Goltz. Equivalence notions for concurrent systems and refinement of actions. In Proc. MFCS '89, volume 379 of lncs, pages 237-248. Springer-Verlag, 1989.
10. Matthew Hennessy, Massimo Merro, and Julian Rathke. Towards a behavioural theory of access and mobility control in distributed systems. Theoretical Computer Science, 322:615-669, 2004.
11. Matthew Hennessy and Julian Rathke. Typed behavioural equivalences for processes in the presence of subtyping. Mathematical Structures in Computer Science, 14:651-684, 2004.
12. Matthew Hennessy and James Riely. Resource access control in systems of mobile agents. Information and Computation, 173:82-120, 2002.
13. K. Honda and N. Yoshida. On reduction-based process semantics. Theoretical Computer Science, 152(2):437-486, 1995.
14. Nestmann, Fuzzati, and Merro. Modeling consensus in a process calculus. In CONCUR: 14th International Conference on Concurrency Theory. LNCS, Springer-Verlag, 2003.
15. James Riely and Matthew Hennessy. Distributed processes and location failures. Theoretical Computer Science, 226:693-735, 2001.
16. Davide Sangiorgi and David Walker. The π-calculus. Cambridge University Press, 2001.