Skip to Main content Skip to Navigation
Conference papers

Distributed Coordination Runtime Assertions for the Peer Model

Abstract : Major challenges in the software development of distributed systems are rooted in the complex nature of coordination. Assertions are a practical programming mechanism to improve the quality of software in general by monitoring it at runtime. Most approaches today limit assertions to statements about local states whereas coordination requires reasoning about distributed states. The Peer Model is an event-based coordination programming model that relies on known foundations like shared tuple spaces, Actor Model, and Petri Nets. We extend it with distributed runtime invariant assertions that are specified and implemented using its own coordination mechanisms. This lifts the concept of runtime assertions to the level of coordination modeling. The concept is demonstrated by means of an example from the railway domain.
Complete list of metadatas

Cited literature [26 references]  Display  Hide  Download

https://hal.inria.fr/hal-01821497
Contributor : Hal Ifip <>
Submitted on : Friday, June 22, 2018 - 2:56:00 PM
Last modification on : Friday, June 22, 2018 - 3:09:24 PM
Long-term archiving on: : Tuesday, September 25, 2018 - 12:11:37 AM

File

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

Please log in to resquest access to the document

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Eva Kühn, Sophie Radschek, Nahla Elaraby. Distributed Coordination Runtime Assertions for the Peer Model. 20th International Conference on Coordination Languages and Models (COORDINATION), Jun 2018, Madrid, Spain. pp.200-219, ⟨10.1007/978-3-319-92408-3_9⟩. ⟨hal-01821497⟩

Share

Metrics

Record views

475