Skip to Main content Skip to Navigation
Conference papers

DiRPOMS: Automatic Checker of Distributed Realizability of POMSets

Abstract : 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/ ).
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download

https://hal.inria.fr/hal-02365496
Contributor : Hal Ifip <>
Submitted on : Friday, November 15, 2019 - 2:12:52 PM
Last modification on : Friday, November 15, 2019 - 2:30:37 PM
Long-term archiving on: : Sunday, February 16, 2020 - 4:49:26 PM

File

 Restricted access
To satisfy the distribution rights of the publisher, the document is embargoed until : 2022-01-01

Please log in to resquest access to the document

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

77