Distributed execution of bigraphical reactive systems

Alessio Mansutti, Marino Miculan, Marco Peressotti

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

Abstract

The bigraph embedding problem is crucial for many results and tools about bigraphs and bigraphical reactive systems (BRS). Current algorithms for computing bigraphical embeddings are centralized, i.e. designed to run locally with a complete view of the guest and host bigraphs. In order to deal with large bigraphs, and to parallelize reactions, we present a decentralized algorithm, which distributes both state and computation over several concurrent processes. This allows for distributed, parallel simulations where non-interfering reactions can be carried out concurrently; nevertheless, even in the worst case, the complexity of this distributed algorithm is no worse than that of a centralized algorithm.

OriginalsprogEngelsk
TidsskriftElectronic Communications of the EASST
Vol/bind71
Antal sider21
DOI
StatusUdgivet - 1. jan. 2015
Udgivet eksterntJa

Fingeraftryk

Dyk ned i forskningsemnerne om 'Distributed execution of bigraphical reactive systems'. Sammen danner de et unikt fingeraftryk.
  • Computing Embeddings of Directed Bigraphs

    Chiapperini, A., Miculan, M. & Peressotti, M., 2020, Graph Transformation - 13th International Conference, ICGT 2020, Held as Part of STAF 2020, Proceedings. Gadducci, F. & Kehrer, T. (red.). Springer, s. 38-56 (Lecture Notes in Computer Science, Bind 12150).

    Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

    Åben adgang

Citationsformater