Vis enkel innførsel

dc.contributor.authorAlwidian, Sanaa
dc.contributor.authorAmyot, Daniel
dc.contributor.authorLamo, Yngve
dc.date.accessioned2023-09-08T07:40:30Z
dc.date.available2023-09-08T07:40:30Z
dc.date.created2023-05-16T14:50:03Z
dc.date.issued2023
dc.identifier.citationAlgorithms. 2023, 16 (2), .en_US
dc.identifier.issn1999-4893
dc.identifier.urihttps://hdl.handle.net/11250/3088103
dc.description.abstractA model family is a set of related models in a given language, with commonalities and variabilities that result from evolution of models over time and/or variation over intended usage (the spatial dimension). As the family size increases, it becomes cumbersome to analyze models individually. One solution is to represent a family using one global model that supports analysis. In this paper, we propose the concept of union model as a complete and concise representation of all members of a model family. We use graph theory to formalize a model family as a set of attributed typed graphs in which all models are typed over the same metamodel. The union model is formalized as the union of all graph elements in the family. These graph elements are annotated with their corresponding model versions and configurations. This formalization is independent from the modeling language used. We also demonstrate how union models can be used to perform reasoning tasks on model families, e.g., trend analysis and property checking. Empirical results suggest potential time-saving benefits when using union models for analysis and reasoning over a set of models all at once as opposed to separately analyzing single models one at a time.en_US
dc.language.isoengen_US
dc.publisherMDPIen_US
dc.rightsNavngivelse 4.0 Internasjonal*
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/deed.no*
dc.titleUnion Models for Model Families: Efficient Reasoning over Space and Timeen_US
dc.typePeer revieweden_US
dc.typeJournal articleen_US
dc.description.versionpublishedVersionen_US
dc.rights.holder© 2023 by the authorsen_US
dc.source.pagenumber34en_US
dc.source.volume16en_US
dc.source.journalAlgorithmsen_US
dc.source.issue2en_US
dc.identifier.doi10.3390/a16020105
dc.identifier.cristin2147888
dc.source.articlenumber105en_US
cristin.ispublishedtrue
cristin.fulltextoriginal
cristin.qualitycode1


Tilhørende fil(er)

Thumbnail

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel

Navngivelse 4.0 Internasjonal
Med mindre annet er angitt, så er denne innførselen lisensiert som Navngivelse 4.0 Internasjonal