Branching Pomsets for Choreographies

Luc Edixhoven, Sung-Shik Jongmans, José Proença, Guillermina Cledou

Research output: Chapter in Book/Report/Conference proceedingConference Article in proceedingAcademicpeer-review

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.
Original languageEnglish
Title of host publicationProceedings 15th Interaction and Concurrency Experience
Subtitle of host publicationICE'22
EditorsClément Aubert , Cinzia Di Giusto , Larisa Safina and Alceste Scalas
PublisherElectronic Proceedings in Theoretical Computer Science (EPTCS)
Pages37-52
Number of pages16
Volume365
DOIs
Publication statusPublished - 9 Aug 2022
Event15th Interaction and Concurrency Experience - Lucca, Italy
Duration: 17 Jun 202217 Jun 2022
https://www.discotec.org/2022/ice

Publication series

SeriesElectronic proceedings in theoretical computer science
Volume356
ISSN2075-2180

Workshop

Workshop15th Interaction and Concurrency Experience
Abbreviated titleICE 2022
Country/TerritoryItaly
CityLucca
Period17/06/2217/06/22
Internet address

Fingerprint

Dive into the research topics of 'Branching Pomsets for Choreographies'. Together they form a unique fingerprint.

Cite this