Issues in the practical use of graph rewriting

Blostein, Dorothea; Fahmy, Hoda; Grbavec, Ann

doi:10.1007/3-540-61228-9_78

Cited by 36 publications

(27 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The use of a model (in the form of a graph grammar) of graph transformations has some advantages over an implicit representation (embedding the transformation computation in a program) [4]:…”

Section: Graph Grammarsmentioning

confidence: 99%

AToM3: A Tool for Multi-formalism and Meta-modelling

Lara

Vangheluwe

2002

Lecture Notes in Computer Science

278

170

View full text Add to dashboard Cite

Abstract. This article introduces the combined use of multi-formalism modelling and meta-modelling to facilitate computer assisted modelling of complex systems. The approach allows one to model different parts of a system using different formalisms. Models can be automatically converted between formalisms thanks to information found in a Formalism Transformation Graph (FTG), proposed by the authors. To aid in the automatic generation of multi-formalism modelling tools, formalisms are modelled in their own right (at a meta-level) within an appropriate formalism. This has been implemented in the interactive tool AToM 3 . This tool is used to describe formalisms commonly used in the simulation of dynamical systems, as well as to generate custom tools to process (create, edit, transform, simulate, optimise, ...) models expressed in the corresponding formalism. AToM 3 relies on graph rewriting techniques and graph grammars to perform the transformations between formalisms as well as for other tasks, such as code generation and operational semantics specification.

show abstract

Section: Graph Grammarsmentioning

confidence: 99%

AToM3: A Tool for Multi-formalism and Meta-modelling

Lara

Vangheluwe

2002

Lecture Notes in Computer Science

278

170

View full text Add to dashboard Cite

show abstract

“…Our work is also motivated by [4,6,20,27] where the focus is on representing provenance as a directed graph structure. We also found previous work related to the efficiency of a graph rewriting system in [12,13,2]. In the general case, graph pattern matching, which finds a homomorphic (or isomorphic) image of a given graph in another graph is a NP-complete problem.…”

Section: Related Workmentioning

confidence: 60%

“…In the general case, graph pattern matching, which finds a homomorphic (or isomorphic) image of a given graph in another graph is a NP-complete problem. However, various factors make it tractable in a graph rewriting system [2]. In summary and to the best of our knowledge, our work, therefore, extends these previous approaches so that graph transformation, security and provenance can be combined to address redaction of provenance information before sharing it.…”

Section: Related Workmentioning

confidence: 74%

Architecture for an Inference Controller

2014

Secure Data Provenance and Inference Control With Semantic Web

View full text Add to dashboard Cite

Ongoing mutual relationships among entities rely on sharing quality information while preventing release of sensitive content. Provenance records the history of a document for ensuring both, the quality and trustworthiness; while redaction identifies and removes sensitive information from a document. Traditional redaction techniques do not extend to the directed graph representation of provenance. In this paper, we propose a graph grammar approach for rewriting redaction policies over provenance. Our rewriting procedure converts a high level specification of a redaction policy into a graph grammar rule that transforms a provenance graph into a redacted provenance graph. Our prototype shows that this approach can be effectively implemented using Semantic Web technologies.

show abstract

“…It uses two main approaches: graph-matching [6], and graph-grammar [2]. The first one matches extracted graphs with model graphs.…”

Section: Structural Recognition Of Symbolsmentioning

confidence: 99%

Symbols Recognition System for Graphic Documents Combining Global Structural Approaches and Using a XML Representation of Data

Delalandre

Trupin

Ogier

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In this paper we present a symbols recognition system for graphic documents, based on a combination of global structural approaches. Our system allows to extract components and their loops, with their inclusion and neighboring links. So, it is possible to construct different graph types according to the considered recognition problem. Our system uses an XML representation of data, which allows an easy manipulation of these ones. We present some results on a symbols set of GREC2003's recognition contest.

show abstract

Issues in the practical use of graph rewriting

Cited by 36 publications

References 39 publications

AToM3: A Tool for Multi-formalism and Meta-modelling

AToM3: A Tool for Multi-formalism and Meta-modelling

Architecture for an Inference Controller

Symbols Recognition System for Graphic Documents Combining Global Structural Approaches and Using a XML Representation of Data

Contact Info

Product

Resources

About