Realisability of Pomsets via Communicating Automata

Roberto Guanciale Dr
(KTH Royal Institute of Technology)
Emilio Tuosto Dr
(University of Leicester)

Pomsets are a model of concurrent computations introduced by Pratt. They can provide a syntax-oblivious description of semantics of coordination models based on asynchronous message-passing, such as Message Sequence Charts (MSCs). In this paper, we study conditions that ensure a specification expressed as a set of pomsets can be faithfully realised via communicating automata. Our main contributions are (i) the definition of a realisability condition accounting for termination soundness, (ii) conditions for global specifications with "multi-threaded" participants, and (iii) the definition of realisability conditions that can be decided directly over pomsets. A positive by-product of our approach is the efficiency gain in the verification of the realisability conditions obtained when restricting to specific classes of choreographies characterisable in term of behavioural types.

In Massimo Bartoletti and Sophia Knight: Proceedings 11th Interaction and Concurrency Experience (ICE 2018), Madrid, Spain, June 20-21, 2018, Electronic Proceedings in Theoretical Computer Science 279, pp. 37–51.
Published: 4th October 2018.

ArXived at: bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to:
For website issues: