A Distributed Pi-Calculus
Cambridge University Press, 8 de mar de 2007
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 behaviour 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.
O que estão dizendo - Escrever uma resenha
Não encontramos nenhuma resenha nos lugares comuns.
Outras edições - Visualizar todos
Actions-in-context adapted ADISTRIBUTED pi-calculus aDpi systems agents API Chapter associated with bisimulation behaviour in aPi behavioural descriptions behavioural equivalence behavioural theory bisimulation equivalence contextually calculus called aDpi capabilities capability-based type system coinductive proof principle collection of domains communication channels computer science connection topology Contextual equivalences deﬁned discrete mathematics distributed asynchronous PI-CALCULUS Distributed pi-calculus distributed systems domain may wish equivalence between processes equivalences for ADPI extension ﬁrst principles formal calculi formal language framework give a detailed interactive systems James Riely Julian Rathke Justifying bisimulation equivalence language aDpi lts for aPi migrate between domains Nobuko Yoshida number of colleagues parameterised version process description language programming languages reduction barbed congruence reduction semantics runtime errors Samuel Hym satisﬁes semantics for aPi signiﬁcance tagged-aDpi technical results theory of bisimulations Type safety type theory typechecking typed aPi Typed bisimulation equivalence typed version Types and behaviour Types for API version of aDpi version of bisimulation
Página i - Luca Cardelli and Andrew D. Gordon. Types for mobile ambients. In POPL '99: Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on principles of programming languages, pp.
Advances in Computer Science - ASIAN 2007. Computer and Network Security ...
Visualização parcial - 2007
Advances in Intelligent and Distributed Computing: Proceedings of the 1st ...
Costin Badica,Marcin Paprzycki
Visualização parcial - 2007