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.

中文翻译：

---

有向双图嵌入问题的 CSP 实现

有向双图是一个元模型，它通过考虑控件和名称之间的请求流来概括米尔纳的双图。关于这些双图的一个关键问题是双图嵌入，即在更大的双图内找到双图的嵌入。我们提出了一种计算有向双图嵌入的算法，通过减少到约束满足问题。我们证明了该算法的稳健性和完整性，并在 jLibBig 中提供了一个实现，jLibBig 是一个用于操作双图反应系统的通用 Java 库，以及一些实验结果。