An Implementation of Bigraph Matching

We describe a provably sound and complete matching algorithm for bigraphical reactive systems. The algorithm has been im- plemented in our BPL Tool, a first implementation of bigraphical reactive systems. We describe the tool and present a concrete example of how it can be used to simulate a model of a mobile phone system in a bigraphical representation of the polyadic p calculus.