DiRPOMS: Automatic Checker of Distributed Realizability of POMSets - Coordination Models and Languages Access content directly
Conference Papers Year : 2019

DiRPOMS: Automatic Checker of Distributed Realizability of POMSets


DiRPOMS permits to verify if the specification of a distributed system can be faithfully realised via distributed agents that communicate using asynchronous message passing. A distinguishing feature of DiRPOMS is the usage of set of pomsets to specify the distributed system. This provides two benefits: syntax obliviousness and efficiency. By defining the semantics of a coordination language in term of pomsets, it is possible to use DiRPOMS for several coordination models. Also, DiRPOMS can analyze pomsets extracted by system logs, when the coordination model is unknown, and therefore can support coordination mining activities. Finally, by using sets of pomsets in place of flat languages, DiRPOMS can reduce exponential blows of analysis that is typical in case of multiple threads due to interleaving. (Demo video available at https://youtu.be/ISYdBNMxEDY . Tool available at https://bitbucket.org/guancio/chosem-tools/ ).
Fichier principal
Vignette du fichier
478673_1_En_14_Chapter.pdf (272.96 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02365496 , version 1 (15-11-2019)





Roberto Guanciale. DiRPOMS: Automatic Checker of Distributed Realizability of POMSets. 21th International Conference on Coordination Languages and Models (COORDINATION), Jun 2019, Kongens Lyngby, Denmark. pp.237-249, ⟨10.1007/978-3-030-22397-7_14⟩. ⟨hal-02365496⟩
37 View
22 Download



Gmail Facebook X LinkedIn More