GRAPE – A Graph Rewriting and Persistence Engine

Weber, Jens H.

doi:10.1007/978-3-319-61470-0_13

Cited by 8 publications

(4 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The inherent complexity related to stateful computation and non-deterministic choice between possible derivations complicates the implementation of execution engines for GT programs. To the best of our knowledge, PROGRES [17], Grape [19], and GP [12] are the only GT tools that implement backtracking mechanisms, capable of reconstructing graphs at non-deterministic choice points. The PROGRES project has been discontinued since its platform is no longer available.…”

Section: Related Workmentioning

confidence: 99%

“…GrapeVine is implemented on top of the Neo4J graph database and derives much of its scalability from that architecture. The tool is a fundamentally new revision of the earlier tools Grape [19] and Grape Press [20]. Compared to these earlier tools, the main novelty in GrapeVine is its functional computational model, where graphs are considered immutable and programs can be deterministic.…”

Section: Grapevine: a Short Overviewmentioning

confidence: 99%

“…In that case, the goat would be moved and the ferryman would travel empty forever. [19] provides a modified program that uses bounded depth-first search (by giving the ferryman a maximum budget of seven moves). That program takes approximately 50 seconds to find a solution on the same machine as above.…”

Section: Efficiency Considerationsmentioning

confidence: 99%

See 2 more Smart Citations

A Foundation for Functional Graph Programs: The Graph Transformation Control Algebra (GTA)

Weber

2022

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

Applications of graph transformation (GT) systems often require control structures that can be used to direct GT processes. Most existing GT tools follow a stateful computational model, where a single graph is repeatedly modified in-place when GT rules are applied. The implementation of control structures in such tools is not trivial. Common challenges include dealing with the non-determinism inherent to rule application and transactional constraints when executing compositions of GTs, in particular atomicity and isolation. The complexity of associated transaction mechanisms and rule application search algorithms (e.g., backtracking) complicates the definition of a formal foundation for these control structures. Compared to these stateful approaches, functional graph rewriting presents a simpler (stateless) computational model, which simplifies the definition of a formal basis for (functional) GT control structures. In this paper, we propose the Graph Transformation control Algebra (GTA) as such a foundation. The GTA has been used as the formal basis for implementing the control structures in the (functional) GT tool GrapeVine.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Grapevine: a Short Overviewmentioning

confidence: 99%

See 1 more Smart Citation

A Foundation for Functional Graph Programs: The Graph Transformation Control Algebra (GTA)

Weber

2022

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Da Costa Cavalheiro et al (2017) presented theoretical foundation to verify graph grammar using negative application condition and attributes by generating an event-B model useful in modeling and verification. Weber (2017) described persistent, programmed transaction, graph rewriting and persistence engine which is a hybrid, embedded domain-specific language for graph transformation. Vilgertshofer and Borrmann (2017) suggested semi-automated parametric infrastructure model based on graph transformation and graph rewriting method to achieve scalability and flexibility.…”

Section: Introductionmentioning

confidence: 99%

Formalization of business workflow with typed attributed graph

Tripathi

Banerjee

Sarkar

2018

IJWIS

View full text Add to dashboard Cite

Purpose Business process workflow is a design conceptualization to automate the sequence of activities to achieve a business goal with involved participants and a predefined set of rules. Regarding this, a formal business workflow model is a prime requisite to implement a consistent and rigorous business process. In this context, majority of the existing research works are formalized structural features and have not focused on functional and behavioral design aspects of business processes. To address this problem, this paper aims to propose a formal model of business process workflow called as business process workflow using typed attributed graph (BPWATG) enriched with structural, functional and behavioral characteristics of business processes. Design/methodology/approach Typed attributed graph (ATG) and first-order logic have been used to formalize proposed BPWATG to provide rigorous syntax and semantics towards business process workflows. This is an effort to execute a business workflow on an automated machine. Further, the proposed BPWATG is illustrated using a case study to show the expressiveness of proposed model. Besides, the proposed graph is initially validated using generic modelling environment (GME) case tool. Moreover, a comparative study is performed with existing formal approaches based on several crucial features to exhibit the effectiveness of proposed BPWATG. Findings The proposed model is capable of facilitating structural, functional and behavioral aspects of business process workflows using several crucial features such as dependency conceptualization, timer concepts, exception handling and deadlock detection. These features are used to handle real-world problems and ensure the consistency and correctness of business workflows. Originality/value BPWATG is proposed to formalize a business workflow that is required to make a model of business process machine-readable. Besides, formalizations of dependency conceptualization, exception handling, deadlock detection and time-out concepts are specified. Moreover, several non-functional properties (reusability, scalability, flexibility, dynamicity, reliability and robustness) are supported by the proposed model.

show abstract

Model Based Development of Data Integration in Graph Databases Using Triple Graph Grammars

Alqahtani

Heckel

2018

Software Technologies: Applications and Foundations

View full text Add to dashboard Cite

GRAPE – A Graph Rewriting and Persistence Engine

Cited by 8 publications

References 18 publications

A Foundation for Functional Graph Programs: The Graph Transformation Control Algebra (GTA)

A Foundation for Functional Graph Programs: The Graph Transformation Control Algebra (GTA)

Formalization of business workflow with typed attributed graph

Model Based Development of Data Integration in Graph Databases Using Triple Graph Grammars

Contact Info

Product

Resources

About