An Operable Matching Algorithm for Bigraphs
We use bigraph to represent each state in the bigraphical reactive systems (BRS) in which the problem of matching for bigraphs is extremely important. This problem has been referred in many papers, but in these papers only bigraphs with simple structure (i.e. a bigraph has no sites, outer names or inner names) were given as example, what's more, they gave no a specific algorithm. So, they do not make it clear how to match a general bigraph. In order to solve this problem and get a generally applicable algorithm for matching, we should get the appropriate algebraic expression of bigraph first. Then, we make some improvements on the algebraic expression of bigraph so as to model a general bigraph and propose an operative matching algorithm for bigraph. Moreover a specific instance of matching is presented to illustrate this algorithm is effective in this paper.