@inbook{8078,
  author       = {{Kremer, H.-Hugo}},
  booktitle    = {{Meisterprüfung - Lernen für die Praxis - Unternehmensführung 1}},
  editor       = {{Braukmann, U. and Diettrich, A. and Kremer, H.-H. and Sloane, P.F.E. and Stickling, E.}},
  pages        = {{19--94}},
  title        = {{{Existenzgründung}}},
  year         = {{1995}},
}

@inproceedings{8097,
  author       = {{Krauter, Stefan}},
  booktitle    = {{Proceedings of the ISES Solar World Congress 1995, Harare (Simbabwe), 11.–15. September 1995.}},
  title        = {{{Solar Electricity up to 30% less expensive by optical and thermal enhanced PV modules}}},
  year         = {{1995}},
}

@inproceedings{8098,
  author       = {{Onneken, K. and Krauter, Stefan}},
  booktitle    = {{Proceedings of the 1995 ISES Solar World Congress, Harare (Simbabwe), 11.–15. September 1995}},
  title        = {{{STOPV: A Development Tool for Thermal and Optical Optimization of PV Module Encapsulations}}},
  year         = {{1995}},
}

@inproceedings{8099,
  author       = {{Krauter, Stefan}},
  booktitle    = {{Proceedings of the ISES Solar World Congress 1995, Harare (Simbabwe), 11.–15. September 1995}},
  title        = {{{Actual Optical and Thermal Performance of PV-Modules}}},
  year         = {{1995}},
}

@inproceedings{8100,
  author       = {{Krauter, Stefan}},
  booktitle    = {{Proceedings of the 13th European Photovoltaic Solar Energy Conference, Nizza (Frankreich), 23.–27. Oktober 1995, S. 2306–2309.}},
  title        = {{{Thermal and Optical Enhanced PV-Modules}}},
  year         = {{1995}},
}

@techreport{8194,
  author       = {{Conrad, Mirko and Gajewsky, Magdalena and Holl-Biniasz, Rainer and Rudolf, Michael and Demuth, Jochen and Weber, Stephan and Heckel, Reiko and Müller, Jürgen and Taentzer, Gabriele and Wagner, Annika}},
  title        = {{{Graphische Spezifikation ausgewählter Teile von AGG - einem algebraischen Graphgrammatiksystem}}},
  year         = {{1995}},
}

@techreport{8195,
  abstract     = {{Several object-oriented modeling approaches propose to describe the dynamic behaviour of objects by state transition diagrams. None of them provides precise rules or conditions for the interrelation between the behaviour description of classes and those of their subclasses. In this paper, we discuss this interrelation in detail. It turns out that one has to distinguish between the observable and the invocable behaviour of objects and that different compatibility requirements between the diagrams exist depending on the type of behaviour.}},
  author       = {{Ebert, Jürgen and Engels, Gregor}},
  publisher    = {{University of Koblenz-Landau}},
  title        = {{{Specialization of Object Life Cycle Definitions}}},
  year         = {{1995}},
}

@techreport{8196,
  author       = {{Engels, Gregor and Schürr, Andy}},
  publisher    = {{Vakgroep Informatica, Rijksuniversiteit Leiden}},
  title        = {{{Encapsulated Hierarchical Graphs, Graph Types, and Meta Types}}},
  year         = {{1995}},
}

@inproceedings{8266,
  author       = {{Groenewegen, Luuk and Engels, Gregor}},
  booktitle    = {{Proceedings of the 4th European Workshop on Software Process Technology (EWSPT 1995), Noordwijkerhout (The Netherlands)}},
  pages        = {{189--192}},
  publisher    = {{Springer}},
  title        = {{{Coordination by Behavioural Views and Communication Patterns}}},
  doi          = {{http://dx.doi.org/10.1007/3-540-59205-9_56}},
  volume       = {{913}},
  year         = {{1995}},
}

@inproceedings{8267,
  abstract     = {{Based on a categorical semantics that has been developed for typed graph grammars we uses colimits (pushouts) to model composition and (reverse) graph grammar morphisms to describe refinements of typed graph grammars. Composition of graph grammars w.r.t. common subgrammars is shown to be compatible with the semantics, i.e. the semantics of the composed grammar is obtained as the composition of the semantics of the component grammars. Moreover, the structure of a composed grammar is preserved during a refinement step in the sense that compatible refinements of the components induce a refinement of the composition. The concepts and results are illustrated by an example.}},
  author       = {{Corradini, Andrea and Heckel, Reiko}},
  booktitle    = {{Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)}},
  pages        = {{46--55}},
  publisher    = {{Elsevier}},
  title        = {{{A Compositional Approach to Structuring and Refinement of Typed Graph Grammars}}},
  volume       = {{2}},
  year         = {{1995}},
}

@inproceedings{8268,
  abstract     = {{The overall aim of this paper is a proposal how to bridge the gap between formal specification techniques developed in research projects and semi--formal or informal specifications used in industrial practice. The main idea to overcome these problems is to develop graphical support for formal methods in order to increase acceptance by practitioners and to provide means for integration of formal and semi--formal methods. More specifically suitable concepts will be developed to combine algebraic specifications, Petri Nets, and Graph Grammars with each other and with distinguished graphical components to be used by industrial partners.}},
  author       = {{Bardohl, Bernhard and Bardohl, Roswitha and Castro, Paulo and Ehrig, Hartmut and Heckel, Reiko and Ribeiro, Leila and Nunes, Daltro and Martini, Alfio}},
  booktitle    = {{Proceedings of the 3rd German-Brazilian Workshop on Information Technology (1995), Berlin (Germany)}},
  publisher    = {{Forschungszentrum Jülich GmbH}},
  title        = {{{GRAPHIT: Graphical Support and Integration of Formal and Semiformal Methods for Software Specification and Development}}},
  volume       = {{26}},
  year         = {{1995}},
}

@inproceedings{8269,
  abstract     = {{Currently existing graph grammar-based specification languages have serious problems with supporting any kind of “specification-in-the-large” activities. More precisely, they have deficiencies with respect to modeling hierarchical data structures or specifying meta activities like manipulation of graph schemata. Furthermore, already proposed graph grammar module concepts are still too abstract to be useful in practice. Our contribution addresses these problems by introducing a new hierarchical graph data model with an infinite number of schema, meta-schema, etc. layers. It forms the base for a forthcoming concrete modular graph grammar specification language where in addition information hiding aspects like explicit export and import interfaces are expressible.}},
  author       = {{Engels, Gregor and Schürr, Andy}},
  booktitle    = {{Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)}},
  pages        = {{101--109}},
  publisher    = {{Elsevier}},
  title        = {{{Encapsulated Hierarchical Graphs, Graph Types, and Meta Types}}},
  doi          = {{http://dx.doi.org/10.1016/S1571-0661(05)80186-0}},
  year         = {{1995}},
}

@inproceedings{8270,
  author       = {{Heckel, Reiko and Wagner, Annika}},
  booktitle    = {{Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)}},
  pages        = {{118--126}},
  publisher    = {{Elsevier}},
  title        = {{{Ensuring Consistency of Conditional Graph Grammars - A constructive Approach}}},
  doi          = {{http://dx.doi.org/10.1016/S1571-0661(05)80188-4}},
  volume       = {{2}},
  year         = {{1995}},
}

@inbook{8354,
  author       = {{Kremer, H.-Hugo}},
  booktitle    = {{Meisterprüfung - Lernen für die Praxis - Unternehmensführung 1}},
  editor       = {{Braukmann, U. and Diettrich, A. and Kremer, H.-H. and Sloane, P.F.E. and Stickling, E.}},
  pages        = {{19--94}},
  title        = {{{Existenzgründung}}},
  year         = {{1995}},
}

@article{16510,
  abstract     = {{<jats:p> In an array of coupled oscillators, synchronous chaos may occur in the sense that all the oscillators behave identically although the corresponding motion is chaotic. When a parameter is varied this fully symmetric dynamical state can lose its stability, and the main purpose of this paper is to investigate which type of dynamical behavior is expected to be observed once the loss of stability has occurred. The essential tool is a classification of Lyapunov exponents based on the symmetry of the underlying problem. This classification is crucial in the derivation of the analytical results but it also allows an efficient computation of the dominant Lyapunov exponent associated with each symmetry type. We show how these dominant exponents determine the stability of invariant sets possessing various instantaneous symmetries, and this leads to the idea of symmetry breaking bifurcations of chaotic attractors. Finally, the results and ideas are illustrated for several systems of coupled oscillators. </jats:p>}},
  author       = {{Aston, Philip J. and Dellnitz, Michael}},
  issn         = {{0218-1274}},
  journal      = {{International Journal of Bifurcation and Chaos}},
  pages        = {{1643--1676}},
  title        = {{{Symmetry Breaking Bifurcations of Chaotic Attractors}}},
  doi          = {{10.1142/s021812749500123x}},
  year         = {{1995}},
}

@article{16532,
  author       = {{Dellnitz, M and Heinrich, C}},
  issn         = {{0951-7715}},
  journal      = {{Nonlinearity}},
  pages        = {{1039--1066}},
  title        = {{{Admissible symmetry increasing bifurcations}}},
  doi          = {{10.1088/0951-7715/8/6/009}},
  year         = {{1995}},
}

@article{16542,
  author       = {{Dellnitz, M and Melbourne, I}},
  issn         = {{0951-7715}},
  journal      = {{Nonlinearity}},
  pages        = {{1067--1075}},
  title        = {{{A note on the shadowing lemma and symmetric periodic points}}},
  doi          = {{10.1088/0951-7715/8/6/010}},
  year         = {{1995}},
}

@article{16550,
  author       = {{Dellnitz, Michael and Field, Michael and Golubitsky, Martin and Ma, Jun and Hohmann, Andreas}},
  issn         = {{0218-1274}},
  journal      = {{International Journal of Bifurcation and Chaos}},
  pages        = {{1243--1247}},
  title        = {{{Cycling Chaos}}},
  doi          = {{10.1142/s0218127495000909}},
  year         = {{1995}},
}

@article{16551,
  abstract     = {{<jats:p> Spiral patterns have been observed experimentally, numerically, and theoretically in a variety of systems. It is often believed that these spiral wave patterns can occur only in systems of reaction–diffusion equations. We show, both theoretically (using Hopf bifurcation techniques) and numerically (using both direct simulation and continuation of rotating waves) that spiral wave patterns can appear in a single reaction–diffusion equation [ in u(x, t)] on a disk, if one assumes "spiral" boundary conditions (u<jats:sub>r</jats:sub> = mu<jats:sub>θ</jats:sub>). Spiral boundary conditions are motivated by assuming that a solution is infinitesimally an Archimedian spiral near the boundary. It follows from a bifurcation analysis that for this form of spirals there are no singularities in the spiral pattern (technically there is no spiral tip) and that at bifurcation there is a steep gradient between the "red" and "blue" arms of the spiral. </jats:p>}},
  author       = {{Dellnitz, Michael and Golubitsky, Martin and Hohmann, Andreas and Stewart, Ian}},
  issn         = {{0218-1274}},
  journal      = {{International Journal of Bifurcation and Chaos}},
  pages        = {{1487--1501}},
  title        = {{{Spirals in Scalar Reaction–Diffusion Equations}}},
  doi          = {{10.1142/s0218127495001149}},
  year         = {{1995}},
}

@article{16566,
  author       = {{Breslauer, Dany and Czumaj, Artur and Dubhashi, Devdatt P. and Meyer auf der Heide, Friedhelm}},
  issn         = {{0020-0190}},
  journal      = {{Information Processing Letters}},
  pages        = {{103--110}},
  title        = {{{Transforming comparison model lower bounds to the parallel-random-access-machine}}},
  doi          = {{10.1016/s0020-0190(97)00032-x}},
  year         = {{1995}},
}