Towards distributed bigraphical reactive systems


The bigraph embedding problem is crucial for many results and tools about bigraphs and bigraphical reactive systems (BRS). There are algorithms for computing bigraphical embedding but these are designed to be run locally and assume a complete view of the guest and host bigraphs, putting large bigraphs and BRS out of their reach. To overcome these limitations we present a decentralized algorithm for computing bigraph embeddings that allows us to distribute both state and computation over several concurrent processes. Among various applications, this algorithm offers the basis for distributed BRS simulations where non-interfering reactions are carried out concurrently.