Archibald, B. , Burns, K. , McCreesh, C. and Sevegnani, M. (2021) Practical Bigraphs via Subgraph Isomorphism. In: 27th International Conference on Principles and Practice of Constraint Programming (CP 2021), 25-29 Oct 2021, 15.1-15.17. ISBN 9783959772112
Text
249051.pdf - Published Version Available under License Creative Commons Attribution. 1MB |
Abstract
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.
Item Type: | Conference Proceedings |
---|---|
Additional Information: | Michele Sevegnani is supported by the EPSRC under PETRAS SRF grant MAGIC (EP/S035362/1). |
Status: | Published |
Refereed: | Yes |
Glasgow Author(s) Enlighten ID: | Archibald, Dr Blair and Burns, Kyle and Sevegnani, Dr Michele and Mccreesh, Dr Ciaran |
Authors: | Archibald, B., Burns, K., McCreesh, C., and Sevegnani, M. |
College/School: | College of Science and Engineering > School of Computing Science |
ISSN: | 1868-8969 |
ISBN: | 9783959772112 |
Copyright Holders: | Copyright © 2021 The Authors |
First Published: | Published in Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming (CP 2021) |
Publisher Policy: | Reproduced under a Creative Commons License |
Related URLs: |
University Staff: Request a correction | Enlighten Editors: Update this record