@inproceedings{8277, author = {{Gadducci, Fabio and Heckel, Reiko and Koch, Manuel}}, booktitle = {{Proceedings of the Workshop on the General Theory of Graph Transformation Systems (GETGRATS 1997), Bordeaux (France)}}, title = {{{Combining Graph Transformations with Temporal Logic}}}, year = {{1997}}, } @inproceedings{8278, author = {{Gadducci, Fabio and Heckel, Reiko}}, booktitle = {{Proceedings of the 12th International Workshop on Recent Trends in Algebraic Development Techniques (WADT 1997), Tarquinia (Italy)}}, pages = {{223--237}}, publisher = {{Springer}}, title = {{{An Inductive View of Graph Transformation}}}, volume = {{1376}}, year = {{1997}}, } @inproceedings{8279, author = {{Heckel, Reiko}}, booktitle = {{Proceedings of the Workshop on the General Theory of Graph Transformation Systems (GETGRATS 1997), Bordeaux (France)}}, title = {{{Compositional Development and Verification of Graph Transformation Systems Based on Views and View Integration}}}, year = {{1997}}, } @article{7402, author = {{Engels, Gregor and Jürgen Schneider, Hans}}, journal = {{International Journal on Software Engineering and Knowledge Engineering (IJSEKE)}}, number = {{4}}, pages = {{397--400}}, title = {{{Guest Editors' Introduction}}}, doi = {{http://dx.doi.org/10.1142/S0218194097000230}}, volume = {{7}}, year = {{1997}}, } @article{7403, abstract = {{The idea of a combined reference model- and view-based specification approach has been proposed recently in the software engineering community. In this paper we present a specification technique based on graph transformations which supports such a development approach. The use of graphs and graph transformations allows to satisfy the general requirements of an intuitive understanding and the integration of static and dynamic aspects on a well-defined and sound semantical base. On this background, formal notions of view and view relation are developed and the behaviour of views is described by a loose semantics. View relations are shown to preserve the behaviour of views. Moreover, we define a construction for the automatic integration of views which assumes that the dependencies between different views are described by a reference model. The views and the reference model are kept consistent manually, which is the task of a model manager. In case of more than two views more general scenarios are developed and discussed. We are able to show that the automatic view integration is compatible with the loose semantics, i.e., the behaviour of the system model is exactly the integration of the behaviours of the views. All concepts and results are illustrated at the well-known example of a banking system.}}, author = {{Engels, Gregor and Heckel, Reiko and Taentzer, Gabriele and Ehrig, Hartmut}}, journal = {{Int. Journal of Software and Knowledge Engeneering}}, number = {{4}}, pages = {{457--477}}, title = {{{A Combined Reference Model- and View-Based Approach to System Specification}}}, volume = {{7}}, year = {{1997}}, } @inbook{7515, abstract = {{The algebraic approaches to graph transformation are based on the concept of gluing of graphs corresponding to pushouts in suitable categories of graphs and graph morphisms. This allows one to give not only an explicit algebraic or set theoretical description of the constructions but also to use concepts and results from category theory in order to build up a rich theory and to give elegant proofs even in complex situations. In the previous chapter we have presented an overview of the basic notions and problems common to the two algebraic approaches the double pushout DPO approach and the single pushout SPO approach and their solutions in the DPO approach. In this chapter we introduce the SPO approach to graph transformation and some of its main results. We study application conditions for graph productions and the transformation of more general structures than graphs in the SPO approach where similar generalizations have been or could be studied also in the DPO approach. Finally we present a detailed comparison of the DPO and the SPO approach especially concerning the solutions to the problems discussed for both approaches in the previous chapter.}}, author = {{Ehrig, Hartmut and Heckel, Reiko and Korff, Martin and Löwe, Michael and Ribeiro, Leila and Wagner, Annika and Corradini, Andrea}}, booktitle = {{Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations}}, pages = {{247--312}}, publisher = {{World Scientific}}, title = {{{Algebraic Approaches to Graph Transformation, Part II: Single Pushout Approach and Comparison with Double Pushout Approach}}}, year = {{1997}}, } @inbook{7516, author = {{Engels, Gregor and Rekers, Jan and Andries, Marc}}, booktitle = {{Visual Language Theory}}, pages = {{241--255}}, publisher = {{Springer}}, title = {{{How to represent a visual specification}}}, year = {{1997}}, } @inbook{7517, abstract = {{The algebraic approaches to graph transformation are based on the concept of gluing of graphs, modelled by pushouts in suitable categories of graphs and graph morphisms. This allows one not only to give an explicit algebraic or set theoretical description of the constructions, but also to use concepts and results from category theory in order to build up a rich theory and to give elegant proofs even in complex situations. In this chapter we start with an overwiev of the basic notions common to the two algebraic approaches, the double-pushout (DPO) approach and the singlepushout (SPO) approach; next we present the classical theory and some recent development of the double-pushout approach. The next chapter is devoted instead to the single-pushout approach, and it is closed by a comparison between the two approaches.}}, author = {{Corradini, Andrea and Montanari, Ugo and Rossi, Francesca and Ehrig, Hartmut and Heckel, Reiko and Löwe, Michael}}, booktitle = {{Handbook of Graph Grammars and Computing by Graph Transformation, Volume 1: Foundations}}, pages = {{163--245}}, publisher = {{World Scientific}}, title = {{{Algebraic Approaches to Graph Transformation, Part I: Basic Concepts and Double Pushout Approach}}}, year = {{1997}}, } @article{16564, author = {{Grigoriev, Dima and Karpinski, Marek and Meyer auf der Heide, Friedhelm and Smolensky, Roman}}, issn = {{1016-3328}}, journal = {{computational complexity}}, pages = {{357--375}}, title = {{{A lower bound for randomized algebraic decision trees}}}, doi = {{10.1007/bf01270387}}, year = {{1997}}, } @article{16565, author = {{Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}}, issn = {{0890-5401}}, journal = {{Information and Computation}}, pages = {{103--120}}, title = {{{Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures}}}, doi = {{10.1006/inco.1997.2642}}, year = {{1997}}, } @article{16567, author = {{Meyer auf der Heide, Friedhelm and Storch, M. and Wanka, Rolf}}, issn = {{1432-4350}}, journal = {{Theory of Computing Systems}}, pages = {{627--644}}, title = {{{Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks}}}, doi = {{10.1007/s002240000071}}, year = {{1997}}, } @inbook{16569, author = {{Meyer auf der Heide, Friedhelm and Vöcking, Berthold}}, booktitle = {{Euro-Par'97 Parallel Processing}}, isbn = {{9783540634409}}, issn = {{0302-9743}}, title = {{{Static and dynamic data management in networks}}}, doi = {{10.1007/bfb0002716}}, year = {{1997}}, } @inproceedings{16604, author = {{Berenbrink, Petra and Meyer auf der Heide, Friedhelm and Schröder, Klaus}}, booktitle = {{Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures - SPAA '97}}, isbn = {{0897918908}}, title = {{{Allocating weighted jobs in parallel}}}, doi = {{10.1145/258492.258522}}, year = {{1997}}, } @inbook{16605, author = {{Bäumker, Armin and Meyer auf der Heide, Friedhelm}}, booktitle = {{Solving Irregularly Structured Problems in Parallel}}, isbn = {{9783540631385}}, issn = {{0302-9743}}, title = {{{Communication efficient parallel searching}}}, doi = {{10.1007/3-540-63138-0_21}}, year = {{1997}}, } @inbook{16687, author = {{Karaivazoglou, Efstratios and Meyer auf der Heide, Friedhelm}}, booktitle = {{Euro-Par'97 Parallel Processing}}, isbn = {{9783540634409}}, issn = {{0302-9743}}, title = {{{Routing on asyncronous processor networks}}}, doi = {{10.1007/bfb0002741}}, year = {{1997}}, } @inproceedings{16689, author = {{Maggs, B.M. and Meyer auf der Heide, Friedhelm and Vöcking, Berthold and Westermann, Matthias}}, booktitle = {{Proceedings 38th Annual Symposium on Foundations of Computer Science}}, isbn = {{0818681977}}, title = {{{Exploiting locality for data management in systems of limited bandwidth}}}, doi = {{10.1109/sfcs.1997.646117}}, year = {{1997}}, } @inbook{16693, author = {{Meyer auf der Heide, Friedhelm and Decker, Thomas}}, booktitle = {{Informatik ’97 Informatik als Innovationsmotor}}, isbn = {{9783540630661}}, issn = {{1431-472X}}, title = {{{Parallel Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms, Design Methods, Applications”}}}, doi = {{10.1007/978-3-642-60831-5_22}}, year = {{1997}}, } @inproceedings{16893, author = {{Thies, S. and Gutkauf, B. and Domik, Gitta}}, booktitle = {{Proceedings 5. GI Workshop Adaptivität und Benutzermodellierung in interaktiven Softwaresystemen}}, location = {{Saarbrücken}}, title = {{{Demo eines Intelligenten Diagramm Assistenten (IDIAS)}}}, year = {{1997}}, } @inproceedings{16894, author = {{Gutkauf, B. and Thies, S. and Domik, Gitta}}, booktitle = {{Proceedings 2nd International Symposium on Global Engineering Networking}}, location = {{Antwerp, Belgium}}, pages = {{115--127}}, title = {{{User Adaptive Presentation of Information }}}, year = {{1997}}, } @article{10609, author = {{Platzner, Marco and Rinner, Bernhard and Weiss, Reinhold}}, journal = {{e & i Elektrotechnik und Informationstechnik}}, pages = {{13--18}}, publisher = {{Springer}}, title = {{{A Computer Architecture to Support Qualitative Simulation in Industrial Applications}}}, volume = {{114}}, year = {{1997}}, }