Talks and Poster Presentations (with Proceedings-Entry):

E. Kühn, S. Radschek, N. Elaraby:
"Distributed Coordination Runtime Assertions for the Peer Model";
Talk: 20th IFIP WG 6.1 International Conference on Coordination Models and Languages (COORDINATION 2018), Madrid; 2018-06-18 - 2018-06-21; in: "Coordination Models and Languages", Springer LNCS, 10852 (2018), ISBN: 978-3-319-92408-3; 200 - 219.

English 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.

Coordination model, Runtime assertions, Distributed systems, Tuple space

"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)

Created from the Publication Database of the Vienna University of Technology.