Book contents
- Frontmatter
- Contents
- List of Illustrations
- List of Notations
- Introduction: Alice, Bob, Concurrency, and Distribution
- This Book
- Part I Foundations
- Part II Computation
- 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
- Solutions to Selected Exercises
- References
- Index
8 - Properties of Choreographies and Endpoint Projection
from Part II - Computation
Published online by Cambridge University Press: 11 May 2023
- Frontmatter
- Contents
- List of Illustrations
- List of Notations
- Introduction: Alice, Bob, Concurrency, and Distribution
- This Book
- Part I Foundations
- Part II Computation
- 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
- Solutions to Selected Exercises
- References
- Index
Summary
We study the properties of Recursive Choreographies and its related notion of EPP in depth. Endpoint projection is proven to guarantee choreography compliance and communication safety in this setting. Starvation-freedom does not hold anymore in general, due to the possibilities opened by general recursion in Recursive Choreographies, but it holds for the tail-recursive fragment of the language. Under some reasonable assumptions, the weaker property of deadlock-freedom holds for any implementation returned by EPP. That is, the EPP of a choreography never gets stuck.
Keywords
- Type
- Chapter
- Information
- Introduction to Choreographies , pp. 156 - 176Publisher: Cambridge University PressPrint publication year: 2023