1 Search Results for "Burns, Kyle"


Document
Practical Bigraphs via Subgraph Isomorphism

Authors: Blair Archibald, Kyle Burns, Ciaran McCreesh, and Michele Sevegnani

Published in: LIPIcs, Volume 210, 27th International Conference on Principles and Practice of Constraint Programming (CP 2021)


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.

Cite as

Blair Archibald, Kyle Burns, Ciaran McCreesh, and Michele Sevegnani. Practical Bigraphs via Subgraph Isomorphism. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 15:1-15:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)


Copy BibTex To Clipboard

@InProceedings{archibald_et_al:LIPIcs.CP.2021.15,
  author =	{Archibald, Blair and Burns, Kyle and McCreesh, Ciaran and Sevegnani, Michele},
  title =	{{Practical Bigraphs via Subgraph Isomorphism}},
  booktitle =	{27th International Conference on Principles and Practice of Constraint Programming (CP 2021)},
  pages =	{15:1--15:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-211-2},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{210},
  editor =	{Michel, Laurent D.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.15},
  URN =		{urn:nbn:de:0030-drops-153068},
  doi =		{10.4230/LIPIcs.CP.2021.15},
  annote =	{Keywords: bigraphs, subgraph isomorphism, constraint programming, rewriting systems}
}
  • Refine by Author
  • 1 Archibald, Blair
  • 1 Burns, Kyle
  • 1 McCreesh, Ciaran
  • 1 Sevegnani, Michele

  • Refine by Classification
  • 1 Mathematics of computing → Graph algorithms
  • 1 Theory of computation → Models of computation

  • Refine by Keyword
  • 1 bigraphs
  • 1 constraint programming
  • 1 rewriting systems
  • 1 subgraph isomorphism

  • Refine by Type
  • 1 document

  • Refine by Publication Year
  • 1 2021

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail