@article{16701,
author = {Gil, Joseph and Meyer auf der Heide, Friedhelm and Wigderson, Avi},
issn = {0097-5397},
journal = {SIAM Journal on Computing},
pages = {936--955},
title = {{The Tree Model for Hashing: Lower and Upper Bounds}},
doi = {10.1137/s0097539793255722},
year = {1996},
}
@article{2579,
author = {Betz, Stefan},
journal = {UmweltWirtschaftsForum},
pages = {pp. 44 -- 51},
title = {{Produktionsabfallrecycling als operatives Entscheidungsproblem}},
volume = {4},
year = {1996},
}
@inproceedings{3262,
author = {Goltz, Ursula and Wehrheim, Heike},
booktitle = {Mathematical Foundations of Computer Science 1996, 21st International Symposium, MFCS'96, Cracow, Poland, September 2-6, 1996, Proceedings},
editor = {Penczek, Wojciech and Szalas, Andrzej},
pages = {394----406},
title = {{Causal Testing}},
doi = {10.1007/3-540-61550-4_165},
year = {1996},
}
@article{5612,
author = {Kabst, Rüdiger and Larsen, H H and Bramming, P},
journal = {The International Journal of Human Resource Management},
number = {3},
pages = {618--639},
title = {{How Do Lean Management Organizations Behave Regarding Training and Development?}},
volume = {7},
year = {1996},
}
@book{6146,
author = {Brewster, C and Weber, W and Kabst, Rüdiger},
title = {{Working Time and Contract Flexibility in the E.U.}},
year = {1996},
}
@article{7404,
author = {Habel, Annegret and Heckel, Reiko and Taentzer, Gabriele},
journal = {Fundamenta Informaticae},
number = {3,4},
pages = {287--313},
title = {{Graph Grammars with Negative Application Conditions}},
volume = {26},
year = {1996},
}
@inproceedings{8104,
author = {Krauter, Stefan and Hanitsch, Rolf and Moreira, L.},
booktitle = {Proceedings of the 25th IEEE–PV–Specialists Conference, Washington D.C. (USA), 13.–19. Mai 1996, Band 1, S. 1323–1326.},
title = {{New Optical and Thermal Enhanced PV Modules Performing 12% better under True Module Rating Conditions}},
year = {1996},
}
@inproceedings{7834,
abstract = {The concept of views is used on two levels. First, so-called design views are developed for structuring specifications, that is, a system is modeled according to different views (e.g., representing the needs of different kinds of users) which have to be synchronized afterwards in order to build the whole system. Views can be specified by means of typed graph transformation systems, where the type graph determines the visible types and the productions describe the known operations of that view. The synchronization of views is done by the construction of cooperative parallel composition of graph transformation systems, developed by Leila Ribeiro and presented at the same seminar. If the specification is complete, a view may describe an observation of the system in operation. In this case we speak of a user view. It turns out that the semantics of such a view cannot be described by computations (i.e., graph transformations), but just by observations of computations of the global system. Such observations of computations cannot be represented by graph transformations in the usual sense because a local view may lack operations (productions) of the global system, so that state changes may be observed that do not have a cause in the local view. Therefore, the notion of graph transition is introduced as loose semantics for productions, where the production specifies only a lower bound to the activities that are to happen during application. Contrastingly, in the classical doublepushout approach to graph rewriting, productions are interpreted as complete descriptions of the transformations to be performed. For typed graph transformation systems a transition sequence semantics is developed, comprising all finite and infinite sequences of transitions in a system. Moreover, this semantics is shown to be compositional w.r.t. the synchronization of views.},
author = {Ehrig, Hartmut and Heckel, Reiko and Padberg, Julia and Taentzer, Gabriele and Wolter, Uwe and Corradini, Andrea and Engels, Gregor},
booktitle = {Report on the Dagstuhl-Seminar 9637 on Graph Transformations in Computer Science},
number = {155},
pages = {11--12},
publisher = {Technical University of Berlin},
title = {{Synchronization of Views and Loose Semantics of Typed Graph Productions}},
year = {1996},
}
@techreport{8197,
abstract = {The framework of graph transformation combines the potentials and advantages of both, graphs and rules, into a single computational paradigm. In this paper we survey recent developments in applying graph transformation as a rule-based framework for the specification and development of systems, languages, and tools. After presenting the basic features of graph transformation, we discuss a spectrum of applications including the evaluation of functional expressions, the specification of an interactive graphical tool, an example specification for abstract data types, and the definition of a visual database query language. The case studies indicate the need for a graph transformation language that provides suitable structuring principles and is independent of a particular graph transformation approach. To this end, we sketch the basic features of the new graph- and rule-centered language Grace, currently under development, that permits systematic and structured specification and programming based on graph transformation.},
author = {Andries, Marc and Engels, Gregor and Habel, Annegret and Hoffmann, Berthold and Kreowski, Hans-Jörg and Kuske, Sabine and Plump, Detlef and Schürr, Andy and Taentzer, Gabriele},
publisher = {University of Bremen, Department of Mathematics and Computer Science},
title = {{Graph Transformation for Specification and Programming}},
year = {1996},
}
@techreport{8200,
author = {Heckel, Reiko and Corradini, Andrea and Ehrig, Hartmut and Löwe, Michael},
title = {{Horizontal and Vertical Structuring of Typed Graph Transformation Systems}},
year = {1996},
}