Practical Bigraphs via Subgraph Isomorphism

Bigraphs simultaneously model the spatial and non-spatial relationships between entities, and have been used for systems modelling in areas including biology, networking, and sensors. Temporal evolution can be modelled through a rewriting system, driven by a matching algorithm that identifies instances of bigraphs to be rewritten. The previous state-of-the-art matching algorithm for bigraphs with sharing is based on Boolean satisfiability (SAT), and suffers from a large encoding that limits scalability and makes it hard to support extensions. This work instead adapts a subgraph isomorphism solver that is based upon constraint programming to solve the bigraph matching problem. This approach continues to support bigraphs with sharing, is more open to other extensions and side constraints, and improves performance by over two orders of magnitude on a range of problem instances drawn from real-world mixed-reality, protocol, and conference models.

[1]  Julie A. McCann,et al.  Modelling and Verification of Large-Scale Sensor Network Infrastructures , 2018, 2018 23rd International Conference on Engineering of Complex Computer Systems (ICECCS).

[2]  Michele Sevegnani,et al.  BigraphTalk: Verified Design of IoT Applications , 2020, IEEE Internet of Things Journal.

[3]  Lars Birkedal,et al.  An Implementation of Bigraph Matching , 2008 .

[4]  Christine Solnon,et al.  When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases , 2018, J. Artif. Intell. Res..

[5]  Muffy Calder,et al.  BigraphER: Rewriting and Analysis Engine for Bigraphs , 2016, CAV.

[6]  Ciaran McCreesh,et al.  The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants , 2020, ICGT.

[7]  Marino Miculan,et al.  Directed Bigraphs , 2007, MFPS.

[8]  Robin Milner,et al.  The Space and Motion of Communicating Agents , 2009 .

[9]  Christine Solnon,et al.  Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms , 2018, CPAIOR.

[10]  Mark H. Liffiton,et al.  A Cardinality Solver: More Expressive Constraints for Free - (Poster Presentation) , 2012, SAT.

[11]  Yves Deville,et al.  Solving subgraph isomorphism problems with constraint programming , 2009, Constraints.

[12]  Ciaran McCreesh,et al.  Sequential and Parallel Solution-Biased Search for Subgraph Algorithms , 2019, CPAIOR.

[13]  Robin Milner,et al.  Local Bigraphs and Confluence: Two Conjectures: (Extended Abstract) , 2007, EXPRESS.

[14]  Mohamed Jmaiel,et al.  Executing bigraphical reactive systems , 2019, Discret. Appl. Math..

[15]  Ciaran McCreesh,et al.  A Parallel, Backjumping Subgraph Isomorphism Algorithm Using Supplemental Graphs , 2015, CP.

[16]  Muffy Calder,et al.  Bigraphs with sharing , 2015, Theor. Comput. Sci..

[17]  Giorgio Bacci,et al.  DBtk: A Toolkit for Directed Bigraphs , 2009, CALCO.

[18]  Marino Miculan,et al.  Computing Embeddings of Directed Bigraphs , 2020, ICGT.

[19]  Muffy Calder,et al.  Conditional Bigraphs , 2020, ICGT.

[20]  Muffy Calder,et al.  Real-time verification of wireless home networks using bigraphs with sharing , 2014, Sci. Comput. Program..

[21]  Bashar Nuseibeh,et al.  On the Automated Management of Security Incidents in Smart Spaces , 2019, IEEE Access.

[22]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[23]  Gilles Audemard,et al.  Scoring-Based Neighborhood Dominance for the Subgraph Isomorphism Problem , 2014, CP.

[24]  Muffy Calder,et al.  Modelling IEEE 802.11 CSMA/CA RTS/CTS with stochastic bigraphs with sharing , 2012, Formal Aspects of Computing.

[25]  Christine Solnon,et al.  AllDifferent-based filtering for subgraph isomorphism , 2010, Artif. Intell..

[26]  Steve Benford,et al.  On Lions, Impala, and Bigraphs , 2016, ACM Trans. Comput. Hum. Interact..

[27]  Robin Milner,et al.  Stochastic Bigraphs , 2008, MFPS.