License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.OPODIS.2020.21
URN: urn:nbn:de:0030-drops-135069
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/13506/
Go to the corresponding LIPIcs Volume Portal

Samadi, Mahboubeh ; Ghassemi, Fatemeh ; Khosravi, Ramtin

Decentralized Runtime Enforcement of Message Sequences in Message-Based Systems

pdf-format:
LIPIcs-OPODIS-2020-21.pdf (0.7 MB)

Abstract

In the new generation of message-based systems such as network-based smart systems, distributed components collaborate via asynchronous message passing. In some cases, particular ordering among the messages may lead to violation of the desired properties such as data confidentiality. Due to the absence of a global clock and usage of off-the-shelf components, there is no control over the order of messages at design time. To make such systems safe, we propose a choreography-based runtime enforcement algorithm that given an automata-based specification of unwanted message sequences, prevents certain messages to be sent, and assures that the unwanted sequences are not formed. Our algorithm is fully decentralized in the sense that each component is equipped with a monitor, as opposed to having a centralized monitor. As there is no global clock in message-based systems, the order of messages cannot be determined exactly. In this way, the monitors behave conservatively in the sense that they prevent a message from being sent, even when the sequence may not be formed. We aim to minimize conservative prevention in our algorithm when the message sequence has not been formed. The efficiency and scalability of our algorithm are evaluated in terms of the communication overhead and the blocking duration through simulation.

BibTeX - Entry

@InProceedings{samadi_et_al:LIPIcs:2021:13506,
  author =	{Mahboubeh Samadi and Fatemeh Ghassemi and Ramtin Khosravi},
  title =	{{Decentralized Runtime Enforcement of Message Sequences in Message-Based Systems}},
  booktitle =	{24th International Conference on Principles of Distributed Systems (OPODIS 2020)},
  pages =	{21:1--21:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-176-4},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{184},
  editor =	{Quentin Bramas and Rotem Oshman and Paolo Romano},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2021/13506},
  URN =		{urn:nbn:de:0030-drops-135069},
  doi =		{10.4230/LIPIcs.OPODIS.2020.21},
  annote =	{Keywords: Asynchronous Message Passing, Choreography-Based, Runtime Enforcement, Runtime Prevention, Message Ordering}
}

Keywords: Asynchronous Message Passing, Choreography-Based, Runtime Enforcement, Runtime Prevention, Message Ordering
Collection: 24th International Conference on Principles of Distributed Systems (OPODIS 2020)
Issue Date: 2021
Date of publication: 25.01.2021

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI