Abstract
A communication protocol is realisable if it can be faithfully
implemented in a distributed fashion by communicating agents. Pomsets
offer a way to compactly represent concurrency in communication protocols and have been recently used for the purpose of realisability analysis.
In this paper we focus on the recently introduced branching pomsets,
which also compactly represent choices. We define well-formedness conditions on branching pomsets, inspired by multiparty session types, and
we prove that the well-formedness of a branching pomset is a sufficient
condition for the realisability of the represented communication protoco
implemented in a distributed fashion by communicating agents. Pomsets
offer a way to compactly represent concurrency in communication protocols and have been recently used for the purpose of realisability analysis.
In this paper we focus on the recently introduced branching pomsets,
which also compactly represent choices. We define well-formedness conditions on branching pomsets, inspired by multiparty session types, and
we prove that the well-formedness of a branching pomset is a sufficient
condition for the realisability of the represented communication protoco
| Original language | English |
|---|---|
| Place of Publication | Heerlen |
| Publisher | Open Universiteit Nederland |
| Number of pages | 28 |
| Publication status | Published - 2022 |
Publication series
| Series | OUNL-CS (Technical Reports) |
|---|---|
| Number | 05 |
| Volume | 2022 |