English

Branching Pomsets for Choreographies

Programming Languages 2022-08-10 v1 Logic in Computer Science

Abstract

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.

Cite

@article{arxiv.2208.04632,
  title  = {Branching Pomsets for Choreographies},
  author = {Luc Edixhoven and Sung-Shik Jongmans and José Proença and Guillermina Cledou},
  journal= {arXiv preprint arXiv:2208.04632},
  year   = {2022}
}

Comments

In Proceedings ICE 2022, arXiv:2208.04086

R2 v1 2026-06-25T01:35:29.367Z