Computing Embeddings of Directed Bigraphs

Alessio Chiapperini, Marino Miculan*, Marco Peressotti

*Kontaktforfatter for dette arbejde

Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Abstrakt

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.

OriginalsprogEngelsk
TitelGraph Transformation - 13th International Conference, ICGT 2020, Held as Part of STAF 2020, Proceedings
RedaktørerFabio Gadducci, Timo Kehrer
ForlagSpringer
Publikationsdato2020
Sider38-56
ISBN (Trykt)9783030513719
DOI
StatusUdgivet - 2020
Begivenhed13th International Conference on Graph Transformation, ICGT 2020 held as part of Software Technologies: Applications and Foundations, STAF 2020 - Bergen, Norge
Varighed: 25. jun. 202026. jun. 2020

Konference

Konference13th International Conference on Graph Transformation, ICGT 2020 held as part of Software Technologies: Applications and Foundations, STAF 2020
LandNorge
ByBergen
Periode25/06/202026/06/2020
NavnLecture Notes in Computer Science
Vol/bind12150
ISSN0302-9743

Fingeraftryk Dyk ned i forskningsemnerne om 'Computing Embeddings of Directed Bigraphs'. Sammen danner de et unikt fingeraftryk.

Citationsformater