Electronic Communication of The European Association of Software Science and Technology最新文献

Analysis of Hypergraph Transformation Systems in AGG based on M -Functors 基于M -函子的AGG超图变换系统分析

Electronic Communication of The European Association of Software Science and Technology Pub Date : 2013-07-19 DOI: 10.14279/TUJ.ECEASST.58.841.836

M. Maximova, H. Ehrig, C. Ermel

{"title":"Analysis of Hypergraph Transformation Systems in AGG based on M -Functors","authors":"M. Maximova, H. Ehrig, C. Ermel","doi":"10.14279/TUJ.ECEASST.58.841.836","DOIUrl":"https://doi.org/10.14279/TUJ.ECEASST.58.841.836","url":null,"abstract":"Hypergraph transformation systems are examples of M-adhesive transformation systems based on M-adhesive categories. For typed attributed graph transformation systems, the tool environment AGG allows the modelling, the simu- lation and the analysis of graph transformations. A corresponding tool for analysis of hypergraph transformation systems does not exist up to now. The purpose of this paper is to establish a formal relationship between the corresponding M-adhesive transformation systems, which allows us the translation of hypergraph transformations into typed attributed graph transformations with equivalent behavior, and, vice versa, the creation of hypergraph transformations from typed attributed graph transformations. This formal relationship is based on the general theory of M-functors between different M-adhesive transformation systems. We construct a functor between the M-adhesive categories of hypergraphs and of typed attributed graphs, and show that our construction yields an M-functor with suitable properties. We then use existing results for M-functors to show that analysis results for hypergraph transformation systems can be obtained using AGG by analysis of the translated typed attributed graph transformation system. This is shown in general and for a concrete example.","PeriodicalId":329764,"journal":{"name":"Electronic Communication of The European Association of Software Science and Technology","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122177961","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

FAMOUSO – Eine adaptierbare Publish/Subscribe Middleware für ressourcenbeschränkte Systeme FAMOUSO是资源有限系统的可适应性广告

Electronic Communication of The European Association of Software Science and Technology Pub Date : 2009-02-27 DOI: 10.14279/TUJ.ECEASST.17.195.213

M. Schulze

引用次数: 1

"InstantSocial" – Implementing a Distributed Mobile Multi-user Application with Adaptation Middleware “InstantSocial”——使用适配中间件实现分布式移动多用户应用

Electronic Communication of The European Association of Software Science and Technology Pub Date : 2008-06-02 DOI: 10.14279/TUJ.ECEASST.11.124.122

Luís Fraga, Svein O. Hallsteinsen, U. Scholz

引用次数: 1

Using Resources as Synchronizers to Manage Mobile Process Adaptation 使用资源作为同步器来管理移动流程适配

Electronic Communication of The European Association of Software Science and Technology Pub Date : 1900-01-01 DOI: 10.14279/TUJ.ECEASST.12.232.266

Paolo Bottoni, F. Rosa, Massimo Mecella

{"title":"Using Resources as Synchronizers to Manage Mobile Process Adaptation","authors":"Paolo Bottoni, F. Rosa, Massimo Mecella","doi":"10.14279/TUJ.ECEASST.12.232.266","DOIUrl":"https://doi.org/10.14279/TUJ.ECEASST.12.232.266","url":null,"abstract":"Process management in Mobile Ad-hoc NETworks (MANETs) has to deal with different types of tasks and resources. Teams can be formed with specific goals, such as recognition of a damaged area for disaster assessment, where each member of a team is assigned some task to be performed according to some policy. However, in real situations, it is possible that task assignments and policies have to be revised due to different causes. In addition to typical causes for dynamic changes in adaptive workflows, mobility introduces some specific problems, e.g. the need for new connectivity-maintaining tasks, or reassignment of tasks originally for members who have become unreachable, or who have no sufficient resources to complete the original plan. As these modifications occur dynamically, it is difficult to manage them through hard-coded programs. Rather, we propose the use of a rule-based formalism, expressed in terms of multi-set rewriting. This supports a resource-centered view, in which both data-dependencies between tasks and plan-dependent ordering of tasks are expressed as production and consumption of resources of different types. In turn, rules are themselves seen as resources, so that they are prone to the same rewriting process, in order to redefine process schemas. The paper illustrates these notions and formalisms, and shows some cases of their application.","PeriodicalId":329764,"journal":{"name":"Electronic Communication of The European Association of Software Science and Technology","volume":"560 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116524189","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1