An EMOF-Compliant Abstract Syntax for Bigraphs

Bigraphs are an emerging modeling formalism for structures in ubiquitous computing. Besides an algebraic notation, which can be adopted to provide an algebraic syntax for bigraphs, the bigraphical theory introduces a visual concrete syntax which is intuitive and unambiguous at the same time; the sta...

Full description

Bibliographic Details
Main Authors: Timo Kehrer, Christos Tsigkanos, Carlo Ghezzi
Format: Article
Language:English
Published: Open Publishing Association 2016-12-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/1612.01638v1
_version_ 1817990530777219072
author Timo Kehrer
Christos Tsigkanos
Carlo Ghezzi
author_facet Timo Kehrer
Christos Tsigkanos
Carlo Ghezzi
author_sort Timo Kehrer
collection DOAJ
description Bigraphs are an emerging modeling formalism for structures in ubiquitous computing. Besides an algebraic notation, which can be adopted to provide an algebraic syntax for bigraphs, the bigraphical theory introduces a visual concrete syntax which is intuitive and unambiguous at the same time; the standard visual notation can be customized and thus tailored to domain-specific requirements. However, in contrast to modeling standards based on the Meta-Object Facility (MOF) and domain-specific languages typically used in model-driven engineering (MDE), the bigraphical theory lacks a precise definition of an abstract syntax for bigraphical modeling languages. As a consequence, available modeling and analysis tools use proprietary formats for representing bigraphs internally and persistently, which hampers the exchange of models across tool boundaries. Moreover, tools can be hardly integrated with standard MDE technologies in order to build sophisticated tool chains and modeling environments, as required for systematic engineering of large systems or fostering experimental work to evaluate the bigraphical theory in real-world applications. To overcome this situation, we propose an abstract syntax for bigraphs which is compliant to the Essential MOF (EMOF) standard defined by the Object Management Group (OMG). We use typed graphs as a formal underpinning of EMOF-based models and present a canonical mapping which maps bigraphs to typed graphs in a natural way. We also discuss application-specific variation points in the graph-based representation of bigraphs. Following standard techniques from software product line engineering, we present a framework to customize the graph-based representation to support a variety of application scenarios.
first_indexed 2024-04-14T01:01:17Z
format Article
id doaj.art-39e008fb5050483683be13268b041e0f
institution Directory Open Access Journal
issn 2075-2180
language English
last_indexed 2024-04-14T01:01:17Z
publishDate 2016-12-01
publisher Open Publishing Association
record_format Article
series Electronic Proceedings in Theoretical Computer Science
spelling doaj.art-39e008fb5050483683be13268b041e0f2022-12-22T02:21:25ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802016-12-01231Proc. GaM 2016163010.4204/EPTCS.231.2:6An EMOF-Compliant Abstract Syntax for BigraphsTimo Kehrer0Christos Tsigkanos1Carlo Ghezzi2 Politecnico di Milano Politecnico di Milano Politecnico di Milano Bigraphs are an emerging modeling formalism for structures in ubiquitous computing. Besides an algebraic notation, which can be adopted to provide an algebraic syntax for bigraphs, the bigraphical theory introduces a visual concrete syntax which is intuitive and unambiguous at the same time; the standard visual notation can be customized and thus tailored to domain-specific requirements. However, in contrast to modeling standards based on the Meta-Object Facility (MOF) and domain-specific languages typically used in model-driven engineering (MDE), the bigraphical theory lacks a precise definition of an abstract syntax for bigraphical modeling languages. As a consequence, available modeling and analysis tools use proprietary formats for representing bigraphs internally and persistently, which hampers the exchange of models across tool boundaries. Moreover, tools can be hardly integrated with standard MDE technologies in order to build sophisticated tool chains and modeling environments, as required for systematic engineering of large systems or fostering experimental work to evaluate the bigraphical theory in real-world applications. To overcome this situation, we propose an abstract syntax for bigraphs which is compliant to the Essential MOF (EMOF) standard defined by the Object Management Group (OMG). We use typed graphs as a formal underpinning of EMOF-based models and present a canonical mapping which maps bigraphs to typed graphs in a natural way. We also discuss application-specific variation points in the graph-based representation of bigraphs. Following standard techniques from software product line engineering, we present a framework to customize the graph-based representation to support a variety of application scenarios.http://arxiv.org/pdf/1612.01638v1
spellingShingle Timo Kehrer
Christos Tsigkanos
Carlo Ghezzi
An EMOF-Compliant Abstract Syntax for Bigraphs
Electronic Proceedings in Theoretical Computer Science
title An EMOF-Compliant Abstract Syntax for Bigraphs
title_full An EMOF-Compliant Abstract Syntax for Bigraphs
title_fullStr An EMOF-Compliant Abstract Syntax for Bigraphs
title_full_unstemmed An EMOF-Compliant Abstract Syntax for Bigraphs
title_short An EMOF-Compliant Abstract Syntax for Bigraphs
title_sort emof compliant abstract syntax for bigraphs
url http://arxiv.org/pdf/1612.01638v1
work_keys_str_mv AT timokehrer anemofcompliantabstractsyntaxforbigraphs
AT christostsigkanos anemofcompliantabstractsyntaxforbigraphs
AT carloghezzi anemofcompliantabstractsyntaxforbigraphs
AT timokehrer emofcompliantabstractsyntaxforbigraphs
AT christostsigkanos emofcompliantabstractsyntaxforbigraphs
AT carloghezzi emofcompliantabstractsyntaxforbigraphs