Computing Embeddings of Directed Bigraphs

Directed bigraphs are a meta-model which generalises Milner’s bigraphs by taking into account the request flow between controls and names. A key problem about these bigraphs is that of bigraph embedding, i.e., finding the embeddings of a bigraph inside a larger one. We present an algorithm for compu...

Descripción completa

Detalles Bibliográficos
Autores principales: Chiapperini, Alessio, Miculan, Marino, Peressotti, Marco
Formato: Online Artículo Texto
Lenguaje:English
Publicado: 2020
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7314702/
http://dx.doi.org/10.1007/978-3-030-51372-6_3
_version_ 1783550113783742464
author Chiapperini, Alessio
Miculan, Marino
Peressotti, Marco
author_facet Chiapperini, Alessio
Miculan, Marino
Peressotti, Marco
author_sort Chiapperini, Alessio
collection PubMed
description Directed bigraphs are a meta-model which generalises Milner’s bigraphs by taking into account the request flow between controls and names. A key problem about these bigraphs is that of bigraph embedding, i.e., finding the embeddings of a bigraph inside a larger one. We present an algorithm for computing embeddings of directed bigraphs, via a reduction to a constraint satisfaction problem. We prove soundness and completeness of this algorithm, and provide an implementation in jLibBig, a general Java library for manipulating bigraphical reactive systems, together with some experimental results.
format Online
Article
Text
id pubmed-7314702
institution National Center for Biotechnology Information
language English
publishDate 2020
record_format MEDLINE/PubMed
spelling pubmed-73147022020-06-25 Computing Embeddings of Directed Bigraphs Chiapperini, Alessio Miculan, Marino Peressotti, Marco Graph Transformation Article Directed bigraphs are a meta-model which generalises Milner’s bigraphs by taking into account the request flow between controls and names. A key problem about these bigraphs is that of bigraph embedding, i.e., finding the embeddings of a bigraph inside a larger one. We present an algorithm for computing embeddings of directed bigraphs, via a reduction to a constraint satisfaction problem. We prove soundness and completeness of this algorithm, and provide an implementation in jLibBig, a general Java library for manipulating bigraphical reactive systems, together with some experimental results. 2020-05-31 /pmc/articles/PMC7314702/ http://dx.doi.org/10.1007/978-3-030-51372-6_3 Text en © Springer Nature Switzerland AG 2020 This article is made available via the PMC Open Access Subset for unrestricted research re-use and secondary analysis in any form or by any means with acknowledgement of the original source. These permissions are granted for the duration of the World Health Organization (WHO) declaration of COVID-19 as a global pandemic.
spellingShingle Article
Chiapperini, Alessio
Miculan, Marino
Peressotti, Marco
Computing Embeddings of Directed Bigraphs
title Computing Embeddings of Directed Bigraphs
title_full Computing Embeddings of Directed Bigraphs
title_fullStr Computing Embeddings of Directed Bigraphs
title_full_unstemmed Computing Embeddings of Directed Bigraphs
title_short Computing Embeddings of Directed Bigraphs
title_sort computing embeddings of directed bigraphs
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7314702/
http://dx.doi.org/10.1007/978-3-030-51372-6_3
work_keys_str_mv AT chiapperinialessio computingembeddingsofdirectedbigraphs
AT miculanmarino computingembeddingsofdirectedbigraphs
AT peressottimarco computingembeddingsofdirectedbigraphs

Ejemplares similares