Introduction to Choreographies
Published on 17. May 2023
978-1-108-99215-2 (ISBN)
Description
In concurrent and distributed systems, processes can complete tasks together by playing their parts in a joint plan. The plan, or protocol, can be written as a choreography: a formal description of overall behaviour that processes should collaborate to implement, like authenticating a user or purchasing an item online. Formality brings clarity, but not only that. Choreographies can contribute to important safety and liveness properties. This book is an ideal introduction to theory of choreographies for students, researchers, and professionals in computer science and applied mathematics. It covers languages for writing choreographies and their semantics, and principles for implementing choreographies correctly. The text treats the study of choreographies as a discipline in its own right, following a systematic approach that starts from simple foundations and proceeds to more advanced features in incremental steps. Each chapter includes examples and exercises aimed at helping with understanding the theory and its relation to practice.
Reviews / Votes
'Distributed Systems have a large number and variety of Computing infrastructure parts. One of the main challenges lies in the solid definition of concurrency and protocols. This excellent and timely book addresses these issues in a convincing way by taking the reader on a journey of dealing with and reasoning on choreographies by providing many examples.' Schahram Dustdar, TU Wien, Austria 'A mass of dancers dance individually and concurrently following a choreography, creating a masterpiece collaboratively. Choreographies are a framework to promote a protocol-guided programming for no single point of failure. Montesi's book starts from a friendly introduction to formal methods for beginners and covers comprehensive choreography theories-from the simple choreographies to the advanced extensions. Highly recommended for the undergraduate and graduate computer science students as well as developers of web services.' Nobuko Yoshida, Christopher Strachey Chair of Computing, University of Oxford 'Distributed systems are the norm today. Choreographies govern how autonomous parts of distributed systems that operate concurrently may communicate with each other. However, it is not always clear whether all communication participants comply with a given choreography design. This book comes to the remedy. Fabrizio Montesi, pioneer of choreographic programming with the Jolie language and microservices community leader, establishes a uniform theory and a notation for choreographies - not only to specify their protocols, but also to check participant conformance and prove desired properties including communication safety and freedom from starvation. Read this book if you want to learn or teach these concepts en route to more robust and more understandable Distributed Systems, and apply its concepts in practice if you want to prove that your language, middleware, and tool creations work as designed.' Olaf Zimmermann, Eastern Switzerland University of Applied Sciences, School of Computer Science, Author of Patterns for API Design - Simplifying Integration with Loosely Coupled Message ExchangesMore details
Language
English
Place of publication
Cambridge
United Kingdom
Target group
College/higher education
Illustrations
Worked examples or Exercises
File size
22,88 MB
ISBN-13
978-1-108-99215-2 (9781108992152)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
Fabrizio Montesi
Introduction to Choreographies
Book
05/2023
Cambridge University Press
€63.50
Shipment within 15-20 days
Person
Content
Introduction: Alice, Bob, concurrency, and distribution; This book; Part I. Foundations: Introduction to Part I; 1. Inference systems; 2. Simple choreographies; 3. Simple processes; 4. Endpoint projection; Part II. Computation: Introduction to Part II; 5. Memory and local computation; 6. Conditionals and knowledge of choice; 7. Recursion; 8. Properties of choreographies and endpoint projection; Part III. Extensions and Variations: Introduction to Part III; 9. Conservative extensions; 10. Choreographic choice; 11. Asynchronous communication; 12. Discussion and further reading; Solutions to selected exercises; Bibliography; Index.
