文章基本信息

标题：Checking Graph-Transformation Systems for Confluence
本地全文：下载
作者：Detlef Plump
期刊名称：Electronic Communications of the EASST
电子版ISSN：1863-2122
出版年度：2010
卷号：26
语种：English
出版社：European Association of Software Science and Technology (EASST)
摘要：In general, it is undecidable whether a terminating graph-transformation system is confluent or not. We introduce the class of coverable hypergraph-transformation systems and show that confluence is decidable for coverable systems that are terminating. Intuitively, a system is coverable if its typing allows to extend each critical pair with a non-deletable context that uniquely identifies the persistent nodes of the pair. The class of coverable systems includes all hypergraph-transformation systems in which hyperedges can connect arbitrary sequences of nodes, and all graph-transformation systems with a sufficient number of unused edge labels.