Branching Pomsets for Choreographies

Luc Edixhoven
(Open University (Heerlen) and CWI (Amsterdam), Netherlands)
Sung-Shik Jongmans
(Open University (Heerlen) and CWI (Amsterdam), Netherlands)
José Proença
(CISTER, ISEP, Polytechnic Institute of Porto, Portugal)
Guillermina Cledou
(HASLab, INESC TEC and University of Minho, Portugal)

Choreographic languages describe possible sequences of interactions among a set of agents. Typical models are based on languages or automata over sending and receiving actions. Pomsets provide a more compact alternative by using a partial order over these actions and by not making explicit the possible interleaving of concurrent actions. However, pomsets offer no compact representation of choices. For example, if an agent Alice can send one of two possible messages to Bob three times, one would need a set of 2 * 2 * 2 distinct pomsets to represent all possible branches of Alice's behaviour. This paper proposes an extension of pomsets, named branching pomsets, with a branching structure that can represent Alice's behaviour using 2 + 2 + 2 ordered actions. We encode choreographies as branching pomsets and show that the pomset semantics of the encoded choreographies are bisimilar to their operational semantics.

In Clément Aubert, Cinzia Di Giusto, Larisa Safina and Alceste Scalas: Proceedings 15th Interaction and Concurrency Experience (ICE 2022), Lucca, Italy, 17th June 2022, Electronic Proceedings in Theoretical Computer Science 365, pp. 37–52.
Published: 9th August 2022.

ArXived at: https://dx.doi.org/10.4204/EPTCS.365.3 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org