By Fabrizio Montesi.
Created on 2023-05-26.
Last updated on 2023-06-07.
See also: Introduction to Choreographies
For the past few years I have been experimenting with a different way of teaching concurrency theory, and even the integration of communicating participants in a concurrent or distributed system. I call it the choreography-first approach. It's the soul behind the book that I've recently written about theory of choreographic languages.
Disclaimer: I am not claiming that everybody should teach like this, or that choreographies should always come first. Rather, my hope is to raise awareness that formal choreographic languages can have an important role to play in understanding concurrency based on message passing. What you find below is what worked well for me. If you use choreographies in this or other ways in your courses, I'd be thrilled to hear about it!
The idea is to start with high-level languages for expressing what communication behaviour we wish for, rather than immediately diving into languages for expressing how this behaviour should be implemented. In other words, I teach formal languages for expressing choreographies before those for modelling local behaviours (e.g., process calculi).
Choreographies represent the plans that we are trying to implement when we program a system based on message passing. So it can make sense to teach them as soon as possible, just like we typically start teaching programming with high-level languages instead of low-level bytecode or assembly. Intention and design over implementation details.
However, many people keep choreographies as informal and vague objects in their heads instead of writing them down. This makes concurrency harder than it needs to be in a lot of cases. This is also why I start right away by equipping students with a formal language to write (very simple) choreographies. I call this language Simple Choreographies.
The name says it all: Simple Choreographies is really straightforward. It can just express a finite list of point-to-point communications. Here is its grammar, where
q range over process names.
C, can have one of two forms:
p -> q; C, read 'process
p communicates a message to process
q, and then the choreography proceeds as
0, which is the terminated choreography.
For example, we can write a choreography where a
client communicates a message to a
proxy, which then forwards it to a
client -> proxy; proxy -> server; 0
This corresponds to the following sequence diagram.
sequenceDiagram client->>proxy: - proxy->>server: -
Simple Choreographies is so simple that all choreographies express finite protocols, there are no ways of expressing alternative behaviour, and there is no state. In fact, we are not even writing what the payloads of messages are! However, Simple Choreographies is interesting enough that it can be given a concurrent semantics by using out-of-order execution. This semantics corresponds to parallelism at the process level [Montesi 2023].
More interesting things happen once we introduce the language for implementing Simple Choreographies, described next.
Simple Processes is the process calculus counterpart to Simple Choreographies. That is, we use it to describe implementations of these choreographies. The syntax is, again, rather simple:
A process can be either:
p!;P, read 'send a message to
p and then do
p?;P, read 'receive a message from
p and then do
0, the terminated process.
You can put processes together in networks, ranged over by
N, which are written
p[P] | q[Q] | ....
For example, the implementation of our previous choreography:
client[proxy!; 0] | proxy[client?; server!; 0] | server[proxy?; 0]
Simple Choreographies and Simple Processes are simple, but not trivial. In particular, given appropriate operational semantics, they suffice for discussing the notions of parallelism and interleaving.
More importantly, there are some interesting differences between the two languages for (high-level) choreographies and (low-level) processes. For example, using Simple Processes, we can:
In Simple Choreographies, these issues do not really present themselves. The syntax of communications in choreographies always pairs correctly the intended send and receive actions. This means that all correct implementations of a choreography in Simple Processes can never reach an unsafe state or get stuck, which is one of the cornerstone results of the choreographic method.
Showing Simple Choreographies, Simple Processes, their differences, and their relationship establishes a mental framework that comprises how to define intentions (choreographies) and the challenges that await us in the implementation of these intentions (as processes).
From there, I start extending these languages with more features that make them more realistic, like message payloads, memory, conditionals, nondeterminism, recursion, etc. The two layers, choreographies and processes, are kept in sync with respect to features. This is important because some features present their own unique challenges. A prime example is knowledge of choice: introduce choices, and suddenly you have to deal with agreement.
The choreography-first approach is the result of years of teaching both concurrency theory (MSc level) and concurrent programming (BSc level) in higher education. (There's a lot to be said also about research and professional work, but let's stick to teaching here.) My admittedly personal experience is that putting choreographies at the forefront in the beginning and then keeping them side to side with processes gives students a clearer sense of what we are doing and why. After seeing mechanical methods for translating choreographies into processes for a while (endpoint projection), they start applying the same principles in their heads while looking at examples. How do I know? Sometimes they correct me when I write processes on the blackboard, citing blatantly that 'Hey, the choreography said ...' ;-)
How do students feel about it? Here are some of the comments that my students left in the evaluation of the first course I taught by using the book. (DM861: Concurrency Theory, University of Southern Denmark, Spring 2023.)
Students also left a kind 100% score for the teacher's pedagogical competences. Take it with a grain of salt: I really like teaching concurrency!
Montesi, F. , 'Introduction to Choreographies', Cambridge University Press. https://doi.org/10.1017/9781108981491