Davide Sangiorgi – författare

Mobile systems, whose components communicate and change their structure, now pervade the informational world and the wider world of which it is a part. The science of mobile systems is as yet immature, however. This book presents the pi-calculus, a theory of mobile systems. The pi-calculus provides a conceptual framework for understanding mobility, and mathematical tools for expressing systems and reasoning about their behaviours. The book serves both as a reference for the theory and as an extended demonstration of how to use pi-calculus to describe systems and analyse their properties. It covers the basic theory of pi-calculus, typed pi-calculi, higher-order processes, the relationship between pi-calculus and lambda-calculus, and applications of pi-calculus to object-oriented design and programming. The book is written at the graduate level, assuming no prior acquaintance with the subject, and is intended for computer scientists interested in mobile systems.

Induction is a pervasive tool in computer science and mathematics for defining objects and reasoning on them. Coinduction is the dual of induction and as such it brings in quite different tools. Today, it is widely used in computer science, but also in other fields, including artificial intelligence, cognitive science, mathematics, modal logics, philosophy and physics. The best known instance of coinduction is bisimulation, mainly employed to define and prove equalities among potentially infinite objects: processes, streams, non-well-founded sets, etc. This book presents bisimulation and coinduction: the fundamental concepts and techniques and the duality with induction. Each chapter contains exercises and selected solutions, enabling students to connect theory with practice. A special emphasis is placed on bisimulation as a behavioural equivalence for processes. Thus the book serves as an introduction to models for expressing processes (such as process calculi) and to the associated techniques of operational and algebraic analysis.

Coinduction is a method for specifying and reasoning about infinite data types and automata with infinite behaviour. In recent years, it has come to play an ever more important role in the theory of computing. It is studied in many disciplines, including process theory and concurrency, modal logic and automata theory. Typically, coinductive proofs demonstrate the equivalence of two objects by constructing a suitable bisimulation relation between them. This collection of surveys is aimed at both researchers and Master's students in computer science and mathematics and deals with various aspects of bisimulation and coinduction, with an emphasis on process theory. Seven chapters cover the following topics: history, algebra and coalgebra, algorithmics, logic, higher-order languages, enhancements of the bisimulation proof method, and probabilities. Exercises are also included to help the reader master new material.

Computing technology has become ubiquitous, from global applications to - nuscule embedded devices. Trust in computing is vital to help protect public safety,nationalsecurity,andeconomicprosperity.Anewareaofresearch,known as global computing, has recently emerged that aims at de?ning new models of computation based on code and data mobility over wide area networks with highly dynamic topologies, and that aims at providing infrastructures to s- port coordination and control ofcomponents originatig n fromdi?erent,possibly untrusted, sources.Trustworthyglobalcomputing aims at guaranteeingsafe and reliable network usage, also by providing tools and framework for reasoning about behavior and properties of applications. AnInternationalSymposiumonTrustworthyGlobalComputing(TGC2005), was held in Edinburgh, UK, April 7-9, 2005.The symposium contained pres- tations and discussions dealing with issues such as: - resource usage, - language-based security, - theories of trust and authentication, - privacy, reliability and business integrity, - access control and mechanisms for enforcing it, - models of interaction and dynamic components management, - language concepts and abstraction mechanisms, - test generators, symbolic interpreters, type checkers, - ?nite state model checkers, theorem provers, - software principles to support debugging and veri?cation.

This book constitutes the refereed proceedings of the 9th International Conference on Concurrency Theory, CONCUR'98, held in Nice, France, in September 1998.The 35 revised full papers presented were carefully selected from a total of 104 submissions. Also presented are five invited contributions. Among the topics covered are moduls of computation and semantic domains, process algebras, Petri Nets, event structures, real-time systems, hybrid systems, model checking, verification techniques, refinement, rewriting, typing systems and algorithms, etc..