A Distributed Pi-Calculus分布式Pi演算

Distributed systems are fast becoming the norm in computer science. Formal mathematical models and theories of distributed behaviour are needed in order to understand them. This book proposes a distributed pi-calculus called Dpi, for describing the behaviour of mobile agents in a distributed world. It is based on an existing formal language, the pi-calculus, to which it adds a network layer and a primitive migration construct.
　　A mathematical theory of the behavior of these distributed systems is developed, in which the presence of types plays a major role. It is also shown how in principle this theory can be used to develop verification techniques for guaranteeing the behavior of distributed agents.
　　The text is accessible to computer scientists with a minimal background in discrete mathematics. It contains an elementary account of the pi-calculus, and the associated theory of bisimulations. It also develops the type theory required by Dpi from first principles.

Preface
Acknowledgements
1　Inductive principles
　1.1 Induction
　1.2 Coinduction
　1.3 Bisimulation equivalence
2 The asynchronous PI-CALCULUS
　2.1 The language API
　2.2 Reduction semantics for API
　2.3 An action semanncs for API
　2.4 A coinductive behavioural equivalence for API
　2.5 Contextual equivalences
2.6 An observational lts for API
2.7 Justifying bisimulation equivalence contextually
2.8 Questions
3 Types for API
3.1 Runtime errors
3.2 Typechecking with simple types
3.3 Properties of typechecking
3.4 Types as capabilities
3.5 Questions
4　Types and behaviour in API
4.1 Actions-in-context for API
4.2 Typed bisimulation equivalence
4.3 Questions
5 A distributed asynchronous PI-CALCULUS
　5.1 The language ADPI
　5.2 Access control types for ADPI
　5.3 Subject reduction for ADPI
　5.4 Type safety for ADPI
　5.5 Distributed consistency of local channels
　5.6 Questions
6 Behavioural equivalences for ADPI
　6.1 Actions-in-context for ADPI
　6.2 Typed bisimulation equivalence for ADPI
　6.3 Describing bisimulations
　6.4 Servers and clients
　6.5 Modelling a firewall
　6.6 Typed contextual equivalences
　6.7 Justifying bisimulation equivalence contextually in ADPI
　6.8 Questions
Sources
List of figures
Notation
Bibliography
Index