First account of new theory of communication in computing which describes networks, as well as parts of computer systems.

Graduate text on the p-calculus, a mathematical model of mobile computing systems.

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.

Process Algebra is a formal description technique for complex computer systems, especially those involving communicating, concurrently executing components. It is a subject that concurrently touches many topic areas of computer science and discrete math, including system design notations, logic, concurrency theory, specification and verification, operational semantics, algorithms, complexity theory, and, of course, algebra.This Handbook documents the fate of process algebra since its inception in the late 1970's to the present. It is intended to serve as a reference source for researchers, students, and system designers and engineers interested in either the theory of process algebra or in learning what process algebra brings to the table as a formal system description and verification technique. The Handbook is divided into six parts spanning a total of 19 self-contained Chapters. The organization is as follows. Part 1, consisting of four chapters, covers a broad swath of the basic theory of process algebra. Part 2 contains two chapters devoted to the sub-specialization of process algebra known as finite-state processes, while the three chapters of Part 3 look at infinite-state processes, value-passing processes and mobile processes in particular. Part 4, also three chapters in length, explores several extensions to process algebra including real-time, probability and priority. The four chapters of Part 5 examine non-interleaving process algebras, while Part 6's three chapters address process-algebra tools and applications.

Our intention in this collection is to provide, largely through original writings, an ex tended account of pi from the dawn of mathematical time to the present. The story of pi reflects the most seminal, the most serious, and sometimes the most whimsical aspects of mathematics. A surprising amount of the most important mathematics and a signifi cant number of the most important mathematicians have contributed to its unfolding directly or otherwise. Pi is one of the few mathematical concepts whose mention evokes a response of recog nition and interest in those not concerned professionally with the subject. It has been a part of human culture and the educated imagination for more than twenty-five hundred years. The computation of pi is virtually the only topic from the most ancient stratum of mathematics that is still of serious interest to modern mathematical research. To pursue this topic as it developed throughout the millennia is to follow a thread through the history of mathematics that winds through geometry, analysis and special functions, numerical analysis, algebra, and number theory. It offers a subject that provides mathe maticians with examples of many current mathematical techniques as weIl as a palpable sense of their historical development. Why a Source Book? Few books serve wider potential audiences than does a source book. To our knowledge, there is at present no easy access to the bulk of the material we have collected.

For some years, specification of software and hardware systems has been influenced not only by algebraic methods but also by new developments in logic. These new developments in logic are partly based on the use of algorithmic techniques in deduction and proving methods, but are alsodue to new theoretical advances, to a great extent stimulated by computer science, which have led to new types of logic and new logical calculi. The new techniques, methods and tools from logic, combined with algebra-based ones, offer very powerful and useful tools for the computer scientist, which may soon become practical for commercial use, where, in particular, more powerful specification tools are needed for concurrent and distributed systems. This volume contains papers based on lectures by leading researchers which were originally given at an international summer school held in Marktoberdorf in 1991. The papers aim to give a foundation for combining logic and algebra for the purposes of specification under the aspects of automated deduction, proving techniques, concurrency and logic, abstract data types and operational semantics, and constructive methods.

Modeling is fast becoming fundamental to understanding the processes that define biological systems. High-throughput technologies are producing increasing quantities of data that require an ever-expanding toolset for their effective analysis and interpretation. Analysis of high-throughput data in the context of a molecular interaction network is particularly informative as it has the potential to reveal the most relevant network modules with respect to a phenotype or biological process of interest.Analysis of Biological Systems collects classical material on analysis, modeling and simulation, thereby acting as a unique point of reference. The joint application of statistical techniques to extract knowledge from big data and map it into mechanistic models is a current challenge of the field, and the reader will learn how to build and use models even if they have no computing or math background. An in-depth analysis of the currently available technologies, and a comparison between them, is also included. Unlike other reference books, this in-depth analysis is extended even to the field of language-based modeling. The overall result is an indispensable, self-contained and systematic approach to a rapidly expanding field of science.