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.
15th Interaction and Concurrency Experience, ICE 2022
Centrum Wiskunde & Informatica, Amsterdam (CWI), The Netherlands

Edixhoven, L.J, Jongmans, S.-S.T.Q, Proença, J.M.P, & Cledou, G. (2022). Branching pomsets for choreographies. In Electronic Proceedings in Theoretical Computer Science (pp. 37–52). doi:10.4204/EPTCS.365.3