Distributed execution of bigraphical reactive systems

Alessio Mansutti, Marino Miculan, Marco Peressotti

Research output: Contribution to journalJournal articleResearchpeer-review


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.

Original languageEnglish
JournalElectronic Communications of the EASST
Number of pages21
Publication statusPublished - 1. Jan 2015
Externally publishedYes


  • Concurrent and distributed graph transformations
  • Formal graph languages
  • Models of graph transformation
  • Multi-agent systems
  • Ubiquitous computing
  • Cloud computing
  • Graph transformations


Dive into the research topics of 'Distributed execution of bigraphical reactive systems'. Together they form a unique fingerprint.
  • 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. (eds.). Springer, p. 38-56 (Lecture Notes in Computer Science, Vol. 12150).

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    Open Access

Cite this