Abstract
This paper is concerned with hierarchical graph models and graph transformation rules, specifically with the problem of transforming a part of graph which may contain subordinated nodes and edges. Meta-rules are proposed as a formal way of representing transformations which remove or duplicate a node along with its contents. The paper discusses the behaviour of meta-rules when applied to different types of hierarchical graphs, possible failure cases, and concludes by introducing a type of hierarchical graphs in which meta-rules can always be successfully expanded.
Highlights
Our research group is interested in computer support systems for the preliminary phase of the design process
Our group has defined over the years several formalized graph models meant for this purpose; experiences gained suggest that the model used should be hierarchical, so that
A generic framework for hierarchical graphs was developed and presented in [1, 2]. It provides a way for constructing graphs where graph atoms can be nested inside any other atom, and extends the well–known double–pushout graph transformation rules so that they can be applied to the hierarchical graphs
Summary
Our research group is interested in computer support systems for the preliminary phase of the design process. A generic framework for hierarchical graphs was developed and presented in [1, 2] It provides a way for constructing graphs where graph atoms M edges, and hyperedges) can be nested inside any other atom, and extends the well–known double–pushout graph transformation rules so that they can be applied to the hierarchical graphs. A double–pushout rule consists of three graphs (known as the left–hand side, the interface, and the right–hand side, usually denoted by L, K, R) and two morphisms. The obtained result graph will contain a new living room on the 1st floor
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.