Advertisement

Distributed Systems and Their Environments

  • Matthew Hennessy
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5532)

Abstract

Process description languages, such as the picalculus [SW01], offer the possibility of formally describing system behaviour at varying levels of abstraction, and applying logical techniques to verify this behaviour.

But system behaviour often depends on environmental considerations. What a system can do depends on the current context in which it finds itself. It is this context which determines what information is available to the system, and therefore affects its future evolution. In a dual manner the current context determines the knowledge of the system which is available to its environment, and thus affects the use which can be made of the system. Moreover this interplay between a system and its environment is dynamic, changing as either or both evolve.

In this talk I will offer a survey of recent work on behavioural theories of systems in which their environments play a crucial role. We will see three instances in which environmental knowledge involves key features of distributed systems.

  • Access control: Capabilities on resources and access rights to sites are determined by a static type system, [HRY05]; only partial knowledge of these types are available to the environment.

  • Network failure: Systems run on a dynamically changing network of inter-connected nodes, where both the nodes and the connections are subject to failure, [FH08]; this network is shared between the system and its environment.

  • Resource cost: Use of resources entail a cost, which must be borne by the processes responsible, [HG08]; the environment determines the overall funds available to processes for access to resources.

The focus will be on a particular process description language called Dpi [Hen07], oriented towards distributed systems.

References

  1. [FH08]
    Francalanza, A., Hennessy, M.: A theory of system behaviour in the presence of node and link failures. Information and Computation 206, 711–759 (2008)zbMATHCrossRefMathSciNetGoogle Scholar
  2. [Hen07]
    Hennessy, M.: A distributed picalculus. Cambridge University Press, Cambridge (2007)Google Scholar
  3. [HG08]
    Hennessy, M., Gaur, M.: Counting the cost in the picalculus (extended abstract). Electr. Notes Theor. Comput. Sci. (to appear) (2008); preliminary version presented at First Interaction and Concurrency Experience (ICE 2008), Reykjavik (July 2008) Google Scholar
  4. [HRY05]
    Hennessy, M., Rathke, J., Yoshida, N.: Safedpi: A language for controlling mobile code. Acta Informatica 42, 227–290 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  5. [SW01]
    Sangiorgi, D., Walker, D.: The π-calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Matthew Hennessy
    • 1
  1. 1.Trinity College DublinIreland

Personalised recommendations