Distributed execution of bigraphical reactive systems

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.