Filters








67 Hits in 1.7 sec

Net refinement by pullback rewriting [chapter]

Renate Klempien-Hinrichs
1998 Lecture Notes in Computer Science  
The theory of graph grammars is concerned with the rulebased transformation of graphs and graph-like structures. As the formalism of Petri nets is founded on a particular type of graphs, the various net refinement methods proposed for their structured design are in particular graph transformations. This paper aims at applying a recently developed technique for graph rewriting, the so-called pullback approach, to describe net refinement. The translation of this technique, which is based on
more » ... )graph morphisms, into terms of net morphisms yields a well-defined mechanism closely related to pullback rewriting in hypergraphs. A variant allows to elegantly characterize a particular net refinement operation which modifies the context of the refined transition.
doi:10.1007/bfb0053550 fatcat:pmw2zjgiafa25hqm3u6jsuxlha

Typing of Graph Transformation Units [chapter]

Renate Klempien-Hinrichs, Hans-Jörg Kreowski, Sabine Kuske
2004 Lecture Notes in Computer Science  
The concept of graph transformation units in its original sense is a structuring principle for graph transformation systems which allows the interleaving of rule applications with calls of imported units in a controlled way. The semantics of a graph transformation unit is a binary relation on an underlying type of graphs. In order to get a flexible typing mechanism for transformation units and a high degree of parallelism this paper introduces typed graph transformation units that transform
more » ... ples of typed input graphs into l-tuples of typed output graphs in a controlled and structured way. The transformation of the typed graph tuples is performed with actions that apply graph transformation rules and imported typed units simultaneously to the graphs of a tuple. The transformation process is controlled with control conditions and with graph tuple class expressions. The new concept of typed graph transformation units is illustrated with examples from the area of string parsing with finite automata.
doi:10.1007/978-3-540-30203-2_10 fatcat:qkxxvy5asffe3i3fur56cbis5a

Normal forms for context-free node-rewriting hypergraph grammars

RENATE KLEMPIEN-HINRICHS
2002 Mathematical Structures in Computer Science  
doi:10.1017/s0960129501003528 fatcat:dazbablrwrbnhkpbep2t25fhee

Undecidable Control Conditions in Graph Transformation Units

Karsten Hölscher, Renate Klempien-Hinrichs, Peter Knirsch
2008 Electronical Notes in Theoretical Computer Science  
Graph transformation units are an approach-independent concept for programming by applying rules and imported transformation units to graphs, starting in an initial and ending in a terminal graph. This transformation process has to obey a so-called control condition, i.e. the device to select how rules or imported transformation units are to be combined in the transformation process executed by the unit. While the other parts of a unit may simply be required to be computable, this is too
more » ... tive for control conditions. In this paper, we show that the semantics of certain control conditions is in general undecidable already when a single imported transformation unit occurs in the condition, and discuss the consequences for programming with graph transformation units.
doi:10.1016/j.entcs.2007.08.028 fatcat:gtqyxfwixfgwrp2nwsjo7ahk7y

Node Replacement in Hypergraphs: Translating NCE Rewriting into the Pullback Approacht [chapter]

Hélène Jacquet, Renate Klempien-Hinrichs
2000 Lecture Notes in Computer Science  
doi:10.1007/978-3-540-46464-8_9 fatcat:hlaic27wdbgv5nomohbfdnvd6e

Generation of Celtic Key Patterns with Tree-based Collage Grammars

Renate Klempien-Hinrichs, Caroline Von Totth
2010 Electronic Communications of the EASST  
Tree-based collage grammars are a syntactic device for modelling visual languages. Celtic art provides such languages, which follow precise rules of construction, for instance key patterns and knotwork. In this paper, we study the syntactic generation of Celtic key patterns using tree-based collage grammars. Moreover, the regulation mechanisms we employ to ensure that only consistent key patterns are generated are compared with the mechanisms used in a previous study for knotwork.
doi:10.14279/tuj.eceasst.26.356 dblp:journals/eceasst/Klempien-HinrichsT10 fatcat:bbf2fkzh2fbbdgbzlj3ujkztme

Pullback rewriting and applications1 1This research was partially supported by the EC TMR Network GETGRATS (General Theory of Graph Transformation Systems) and the ESPRIT Basic Research Working Group APPLIGRAPH (Applications of Graph Transformation)

Michel Bauderon, Hélène Jacquet, Renate Klempien-Hinrichs
2002 Electronical Notes in Theoretical Computer Science  
doi:10.1016/s1571-0661(04)80193-2 fatcat:orvw5bhryvhyffosw7m5a2w5ly

Structured Modeling with GRACE1 1This research was partially supported by the EC TMR Network GETGRATS (General Theory of Graph Transformation Systems) and the ESPRIT Basic Research Working Group APPLIGRAPH (Applications of Graph Transformation)

Hans-Jörg Kreowski, Giorgio Busatto, Renate Klempien-Hinrichs, Peter Knirsch, Sabine Kuske
2002 Electronical Notes in Theoretical Computer Science  
doi:10.1016/s1571-0661(04)80206-8 fatcat:4rhwqibkdjb7zkcegoc7ibfp6i

Rule-Based Transformation of Graphs and the Product Type [chapter]

Renate Klempien-Hinrichs, Hans-Jörg Kreowski, Sabine Kuske
Transformation of Knowledge, Information and Data  
., 1999) , UML state machines (Kuske, 2001) , and logistic processes (Klempien-Hinrichs & Knirsch & Kuske, 2002) . Transformation units.  ... 
doi:10.4018/9781591405276.ch002 fatcat:egfdswlpcjajzk32td7wnigviq

Rule-Based Transformation of Graphs and the Product Type [chapter]

Renate Klempien-Hinrichs, Hans-Jörg Kreowski, Sabine Kuske
Transformation of Knowledge, Information and Data  
., 1999) , UML state machines (Kuske, 2001) , and logistic processes (Klempien-Hinrichs & Knirsch & Kuske, 2002) . Transformation units.  ... 
doi:10.4018/978-1-59140-527-6.ch002 fatcat:qmpn3dzs7bcida2klel33vcrtu

Autonomous Units: Basic Concepts and Semantic Foundation [chapter]

Karsten Hölscher, Renate Klempien-Hinrichs, Peter Knirsch, Hans-Jörg Kreowski, Sabine Kuske
Understanding Autonomous Cooperation and Control in Logistics  
doi:10.1007/978-3-540-47450-0_8 fatcat:g7oqsq72qvfjdlmbv6uw2pm62u

Page 2882 of Mathematical Reviews Vol. , Issue 2003d [page]

2003 Mathematical Reviews  
{For the entire collection see MR 2003b:68007.} 2003d:68123 68Q42 Klempien-Hinrichs, Renate (D-BRMN; Bremen) Normal forms for context-free node-rewriting hypergraph grammars.  ...  Klempien-Hinrichs, in Graph gram- mars and their application to computer science (Williamsburg, VA, 1994), 397-411, Lecture Notes in Comput. Sci., 1073, Springer, Berlin, 1996; MR 97h:68070].  ... 

Page 3339 of Mathematical Reviews Vol. , Issue 2001E [page]

2001 Mathematical Reviews  
Klempien-Hinrichs, Node re- placement in hypergraphs: translating NCE rewriting into the pull- back approach (117-130); Mercé Llabrés and Francesc Rossellé [Francesc Rossell6-Llompart], Pushout complements  ...  transitions: a rule-based framework with incomplete in- formation (85-102); Annegret Habel, Jiirgen Miiller and Detlef Plump, Double-pushout approach with injective matching (103- 116); Héléne Jacquet and Renate  ... 

Page 1956 of Mathematical Reviews Vol. , Issue 2001C [page]

2001 Mathematical Reviews  
Klempien-Hinrichs, The gener- ative power of context-free node rewriting in hypergraphs (211- 221); Franti8ek Mraz, Martin Platek and Martin Prochazka, On special forms of restarting automata (223-233  ...  Rodica Ceterchi, Cut-and-paste languages (179-188); Rudolf Freund, Generalized P-systems with splicing and cut- ting/recombination (189-199); Radu Gramatovici, Shuffle-based multilanguages (201-210); Renate  ... 

Page 5316 of Mathematical Reviews Vol. , Issue 97H [page]

1997 Mathematical Reviews  
See Klemm, Albrecht Otto Klemm, Albrecht Otto Klempien-Hinrichs, Renate Klenke, Achim Klerlein, Joseph B. .................. 05079 EE sl acccnesneanayehioedt 17018 Klingenberg, Christian 35147 ES a eer  ... 
« Previous Showing results 1 — 15 out of 67 results