Archibald, B. , Calder, M. and Sevegnani, M. (2020) Conditional Bigraphs. In: 13th International Conference on Graph Transformation (ICGT 2020), Bergen, Norway, 25-26 Jun 2020, pp. 3-19. ISBN 9783030513719 (doi: 10.1007/978-3-030-51372-6_1)
|
Text
215021.pdf - Accepted Version 758kB |
Abstract
Bigraphs are a universal graph based model, designed for analysing reactive systems that include spatial and non-spatial (e.g. communication) relationships. Bigraphs evolve over time using a rewriting framework that finds instances of a (sub)-bigraph, and substitutes a new bigraph. In standard bigraphs, the applicability of a rewrite rule is determined completely by a local match and does not allow any non-local reasoning, i.e. contextual conditions. We introduce conditional bigraphs that add conditions to rules and show how these fit into the matching framework for standard bigraphs. An implementation is provided, along with a set of examples. Finally, we discuss the limits of application conditions within the existing matching framework and present ways to extend the range of conditions that may be expressed.
Item Type: | Conference Proceedings |
---|---|
Status: | Published |
Refereed: | Yes |
Glasgow Author(s) Enlighten ID: | Calder, Professor Muffy and Sevegnani, Dr Michele and Archibald, Dr Blair |
Authors: | Archibald, B., Calder, M., and Sevegnani, M. |
College/School: | College of Science and Engineering > School of Computing Science |
ISSN: | 0302-9743 |
ISBN: | 9783030513719 |
Published Online: | 23 June 2020 |
Copyright Holders: | Copyright © 2020 Springer Nature Switzerland AG |
First Published: | First published in Graph Transformation: 13th International Conference, ICGT 2020, Held as Part of STAF 2020, Bergen, Norway, June 25–26, 2020, Proceedings: 3-19 |
Publisher Policy: | Reproduced in accordance with the publisher copyright policy |
Related URLs: |
University Staff: Request a correction | Enlighten Editors: Update this record