From Graph Transformation Units via MiniSat to GrGen.NET

Ermler, Marcus; Kreowski, Hans‐Jörg; Kuske, Sabine; Totth, Caroline von

doi:10.1007/978-3-642-34176-2_14

Cited by 5 publications

(3 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For all considered graphs the considered problem can be solved in very short run-time. In [26], the authors describe how a SAT solver can be integrated into the analysis of graph transformation units to facilitate the search for solutions to NP-hard problems. They have designed and implemented the prototypical tool SATa-GraT (SAT solver assists graph transformation engine) and tested it on various problems including the job-shop problem.…”

Section: Model Checkingmentioning

confidence: 99%

Analysis of Graph Transformation Systems: Native vs Translation-based Techniques

Heckel¹,

Lambers²,

Saadat³

2019

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

The paper summarises the contributions in a session at GCM 2019 presenting and discussing the use of native and translation-based solutions to common analysis problems for Graph Transformation Systems (GTSs). In addition to a comparison of native and translation-based techniques in this area, we explore design choices for the latter, s.a. choice of logic and encoding method, which have a considerable impact on the overall quality and complexity of the analysis. We substantiate our arguments by citing literature on application of theorem provers, model checkers, and SAT/SMT solver in GTSs, and conclude with a general discussion from a software engineering perspective, including comments from the workshop participants, and recommendations on how to investigate important design choices in the future.

show abstract

Section: Model Checkingmentioning

confidence: 99%

Analysis of Graph Transformation Systems: Native vs Translation-based Techniques

Heckel¹,

Lambers²,

Saadat³

2019

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…Control conditions can be given by regular expressions, describing in which order and how often the rules and imported units are to be applied. A large body of results has been developed since then [18]- [21], see also [22]. Net transformation units are the transfer of graph transformation units to reconfigurable Petri nets.…”

Section: Net Transformation Unitsmentioning

confidence: 99%

A Survey of Control Structures for Reconfigurable Petri Nets

Padberg¹,

Hoffmann²

2015

JCC

View full text Add to dashboard Cite

Software systems are increasingly executed in dynamic infrastructures. These infrastructures are dynamic as they are themselves subject to change as they support various applications that may or may not share some of the resources. Dynamic software systems become more and more important, but are difficult to handle. Modeling and simulating dynamic systems requires the representation of their processes and the system changes within one model. To that effect, reconfigurable Petri nets consist of a Petri net and a set of rules that can modify the Petri net. Their main feature is the capability to model complex coordination behavior in dynamically adapting infrastructures. The interplay of both levels of dynamic behavior requires a very precise description, so the specification when and which rules are to be applied plays a crucial role for the convenient use of reconfigurable nets. We differentiate several types of reconfigurable Petri nets and present a survey of control structure for these types, reconfigurable Petri nets. These control structures either concern the infrastructure, i.e., the rules and transformations or the system part, i.e., the firing behavior, or both. They are introduced by a short characterization and illustrated by examples. We state the results for various Petri net types and the tools supporting the different control structures.

show abstract

“…Since graph transformation units are based on graph transformation rules, the stepwise execution of the algorithms may illustrate basic ideas of these algorithms which in turn may be helpful for their understanding, their verification and their teaching. For this purpuse existing graph transformation tools for testing, simulating, visualizing, and verifying the algorithms could be employed (see for example (Taentzer 2003;Ermler et al 2012;Jakumeit et al 2010;Plump 2012;Ghamarian et al 2012…”

Section: Introductionmentioning

confidence: 99%

Modeling and Analyzing Graph Algorithms by Means of Graph Transformation Units.

Kreowski¹,

Kuske²

2020

JOT

Self Cite

View full text Add to dashboard Cite

Graph transformation units are rule-based devices to specify processes on graphs and the dynamics of informationprocessing systems with graphs as states. In this article, we propose graph transformation units as a framework to model graph algorithms, to prove their correctness and to analyze their complexity. A specific emphasis is laid on the improvement of the efficiency of graph algorithms by massive parallelism.

show abstract

From Graph Transformation Units via MiniSat to GrGen.NET

Cited by 5 publications

References 11 publications

Analysis of Graph Transformation Systems: Native vs Translation-based Techniques

Analysis of Graph Transformation Systems: Native vs Translation-based Techniques

A Survey of Control Structures for Reconfigurable Petri Nets

Modeling and Analyzing Graph Algorithms by Means of Graph Transformation Units.

Contact Info

Product

Resources

About