论文标题
CSP实施了定向的BigRaph嵌入问题
A CSP implementation of the directed bigraph embedding problem
论文作者
论文摘要
定向的Bigraphs是一种元模型，它通过考虑到控件和名称之间的请求流，从而概括了Milner的Bigraphs。这些Bigraphs的一个关键问题是Bigraph嵌入，即，在较大图像中找到一个bigraph的嵌入。我们通过减少约束满意度问题来提出一种用于计算定向bigraphs的算法。我们证明了该算法的合理性和完整性，并在Jlibbig（用于操纵Bigraphical Reactive Systems的一般Java库）中提供了实现，并提供了一些实验结果。
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.
