Canonical Derivations with Negative Application Conditions

Using graph transformations to specify the dynamics of distributed systems and networks, we require a precise understanding of concurrency. Negative application conditions (NACs) are an essential means for controlling the application of rules, extending our ability to model complex systems. A classical notion of concurrency in graph transformation is based on shift equivalence and its representation by canonical derivations, i.e., normal forms of the shift operation anticipating independent steps. These concepts are lifted to graph transformation systems with NACs and it is shown that canonical derivations exist for so-called incremental NACs

Changing middle school students' models of literacy through cognitive strategy instruction

Includes bibliographic references (p. 8

An evolutionary graph transformation system as a modelling framework for evolutionary algorithms

Abstract. In this paper an heuristic method for the solving of complex optimization problems is presented which is inspired equally by genetic algorithms and graph transformation. In short it can be described as a genetic algorithm where the individuals (encoding solutions of the given problem) are always graphs and the operators to create new individuals are provided by graph transformation. As a case study this method is used to solve the independent set problem.

Some initial sections of the algebraic-specification tale

SIGLETIB Hannover: RO 802(1987,1) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman

Communities of autonomous units for pickup and delivery vehicle routing

Abstract. Communities of autonomous units are being developed for formal specification and semantic analysis of systems of interacting and mobile components. The autonomous units of a community are rulebased, self-controlled, goal-driven, and operate and move in a common environment. We employ communities of autonomous units to model the dynamic pickup and delivery problem with the general idea to demonstrate their suitability for a range of logistic tasks.

3. Workshop on theory and application of abstract data types

SIGLETIB Hannover: RO 802(1984,9) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman

Pretty patterns produced by hyperedge replacement

SIGLETIB Hannover: RO 802(1987,8) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman

Net processes correspond to derivation processes in graph grammars

TIB Hannover: RO 802(1985,2) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman