A CSP implementation of the directed bigraph embedding problem

TL;DR

This paper introduces a new algorithm for the bigraph embedding problem in directed bigraphs, reducing it to a constraint satisfaction problem, with proven correctness and an implementation demonstrating its effectiveness.

Contribution

It presents the first CSP-based algorithm for directed bigraph embedding, including proof of correctness and a practical Java implementation.

Findings

Algorithm is sound and complete.

Implementation in jLibBig library.

Experimental results validate effectiveness.

Abstract

Directed bigraphs are a meta-model which generalises Milner's bigraphs by taking into account the request flow between controls and names. A key problem about these bigraphs is that of bigraph embedding, i.e., finding the embeddings of a bigraph inside a larger one.We present an algorithm for computing embeddings of directed bigraphs, via a reduction to a constraint satisfaction problem. We prove soundness and completeness of this algorithm, and provide an implementation in jLibBig, a general Java library for manipulating bigraphical reactive systems, together with some experimental results.