Giese, Holger's Books

Efficient and scalable graph view maintenance for deductive graph databases based on generalized discrimination networks

By: Beyhl, Thomas,Giese, Holger

Write a review Read reviews Take a Quiz Solve Book Puzzle

Efficient and scalable graph view maintenance for deductive graph databases based on generalized discrimination networks

By: Beyhl, Thomas,Giese, Holger

Graph databases provide a natural way of storing and querying graph data. In contrast to relational databases, queries over graph databases enable to refer directly to the graph structure of such graph data. For example, graph pattern matching can be employed to formulate queries over graph data. However, as for relational databases running complex queries can be very time-consuming and ruin the interactivity with the database. One possible approach to deal with this performance issue is to employ database views that consist of pre-computed answers to common and often stated queries. But to ensure that database views yield consistent query results in comparison with the data from which they are derived, these database views must be updated before queries make use of these database views. Such a maintenance of database views must be performed efficiently, otherwise the effort to create and maintain views may not pay off in comparison to processing the queries directly on the data from which the database views are derived. At the time of writing, graph databases do not support database views and are limited to graph indexes that index nodes and edges of the graph data for fast query evaluation, but do not enable to maintain pre-computed answers of complex queries over graph data. Moreover, the maintenance of database views in graph databases becomes even more challenging when negation and recursion have to be supported as in deductive relational databases. In this technical report, we present an approach for the efficient and scalable incremental graph view maintenance for deductive graph databases. The main concept of our approach is a generalized discrimination network that enables to model nested graph conditions including negative application conditions and recursion, which specify the content of graph views derived from graph data stored by graph databases. The discrimination network enables to automatically derive generic maintenance rules using graph transformations for maintaining graph views in case the graph data from which the graph views are derived change. We evaluate our approach in terms of a case study using multiple data sets derived from open source projects.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

154

Publisher

Universitätsverlag Potsdam

Published Date

ISBN 10

3869563397

ISBN 13

9783869563398

Inductive invariant checking with partial negative application conditions

By: Dyck, Johannes,Giese, Holger

Write a review Read reviews Take a Quiz Solve Book Puzzle

Inductive invariant checking with partial negative application conditions

By: Dyck, Johannes,Giese, Holger

Graph transformation systems are a powerful formal model to capture model transformations or systems with infinite state space, among others. However, this expressive power comes at the cost of rather limited automated analysis capabilities. The general case of unbounded many initial graphs or infinite state spaces is only supported by approaches with rather limited scalability or expressiveness. In this report we improve an existing approach for the automated verification of inductive invariants for graph transformation systems. By employing partial negative application conditions to represent and check many alternative conditions in a more compact manner, we can check examples with rules and constraints of substantially higher complexity. We also substantially extend the expressive power by supporting more complex negative application conditions and provide higher accuracy by employing advanced implication checks. The improvements are evaluated and compared with another applicable tool by considering three case studies.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

Publisher

Universitätsverlag Potsdam

Published Date

ISBN 10

3869563338

ISBN 13

9783869563336

Models in Software Engineering

Workshops and Symposia at MODELS 2007 Nashville, TN, USA, September 30 - October 5, 2007, Reports and Revised Selected Papers

By: Holger Giese

Write a review Read reviews Take a Quiz Solve Book Puzzle

Models in Software Engineering

Workshops and Symposia at MODELS 2007 Nashville, TN, USA, September 30 - October 5, 2007, Reports and Revised Selected Papers

By: Holger Giese

This book constitutes the thoroughly refereed post-workshop proceedings of 10 internationl workshops and 2 symposia held as satellite events of the 10th International Conference on Model Driven Engineering Languages and Systems, MoDELS 2007, in Nashville, TN, USA, in September/October 2007 (see LNCS 4735). The 29 revised full papers were carefully selected for inclusion in the book and are presented along with a doctoral and an educators' symposium section. The papers are organized in topical sections representing the various workshops: aspect-oriented modeling (AOM 2007), language engineering (ATEM2007), model driven development of advanced user interfaces (MDDAUI 2007), model size metrics (MSM 2007), model-based design of trustworthy health information systems (MOTHIS 2007), model-driven engineering, verification and validation (MoDeVVa 2007), modelling systems with OCL (Ocl4All 2007), Models@run.time, multi-paradigm modeling: concepts and tools (MPM 2007), quality in modeling, doctoral symposium, and educators' symposium.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

331

Publisher

Springer

Published Date

ISBN 10

3540690735

ISBN 13

9783540690733

Scalable Compatibility for Embedded Real-time Components Via Language Progressive Timed Automata

By: Stefan Neumann,Holger Giese

Write a review Read reviews Take a Quiz Solve Book Puzzle

Scalable Compatibility for Embedded Real-time Components Via Language Progressive Timed Automata

By: Stefan Neumann,Holger Giese

The proper composition of independently developed components of an embedded real- time system is complicated due to the fact that besides the functional behavior also the non-functional properties and in particular the timing have to be compatible. Nowadays related compatibility problems have to be addressed in a cumbersome integration and configuration phase at the end of the development process, that in the worst case may fail. Therefore, a number of formal approaches have been developed, which try to guide the upfront decomposition of the embedded real-time system into components such that integration problems related to timing properties can be excluded and that suitable configurations can be found. However, the proposed solutions require a number of strong assumptions that can be hardly fulfilled or the required analysis does not scale well. In this paper, we present an approach based on timed automata that can provide the required guarantees for the later integration without strong assumptions, which are difficult to match in practice. The approach provides a modular reasoning scheme that permits to establish the required guarantees for the integration employing only local checks, which therefore also scales. It is also possible to determine potential configuration settings by means of timed game synthesis.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

Publisher

Universitätsverlag Potsdam

Published Date

ISBN 10

3869562269

ISBN 13

9783869562261

Model-driven engineering of adaptation engines for self-adaptive software

executable runtime megamodels

By: Thomas Vogel,Holger Giese

Write a review Read reviews Take a Quiz Solve Book Puzzle

Model-driven engineering of adaptation engines for self-adaptive software

executable runtime megamodels

By: Thomas Vogel,Holger Giese

The development of self-adaptive software requires the engineering of an adaptation engine that controls and adapts the underlying adaptable software by means of feedback loops. The adaptation engine often describes the adaptation by using runtime models representing relevant aspects of the adaptable software and particular activities such as analysis and planning that operate on these runtime models. To systematically address the interplay between runtime models and adaptation activities in adaptation engines, runtime megamodels have been proposed for self-adaptive software. A runtime megamodel is a specific runtime model whose elements are runtime models and adaptation activities. Thus, a megamodel captures the interplay between multiple models and between models and activities as well as the activation of the activities. In this article, we go one step further and present a modeling language for ExecUtable RuntimE MegAmodels (EUREMA) that considerably eases the development of adaptation engines by following a model-driven engineering approach. We provide a domain-specific modeling language and a runtime interpreter for adaptation engines, in particular for feedback loops. Megamodels are kept explicit and alive at runtime and by interpreting them, they are directly executed to run feedback loops. Additionally, they can be dynamically adjusted to adapt feedback loops. Thus, EUREMA supports development by making feedback loops, their runtime models, and adaptation activities explicit at a higher level of abstraction. Moreover, it enables complex solutions where multiple feedback loops interact or even operate on top of each other. Finally, it leverages the co-existence of self-adaptation and off-line adaptation for evolution.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

Publisher

Universitätsverlag Potsdam

Published Date

ISBN 10

3869562277

ISBN 13

9783869562278

Quantitative Modeling and Analysis of Service-oriented Real-time Systems Using Interval Probabilistic Timed Automata

By: Krause, Christian,Giese, Holger

Write a review Read reviews Take a Quiz Solve Book Puzzle

Quantitative Modeling and Analysis of Service-oriented Real-time Systems Using Interval Probabilistic Timed Automata

By: Krause, Christian,Giese, Holger

One of the key challenges in service-oriented systems engineering is the prediction and assurance of non-functional properties, such as the reliability and the availability of composite interorganizational services. Such systems are often characterized by a variety of inherent uncertainties, which must be addressed in the modeling and the analysis approach. The different relevant types of uncertainties can be categorized into (1) epistemic uncertainties due to incomplete knowledge and (2) randomization as explicitly used in protocols or as a result of physical processes. In this report, we study a probabilistic timed model which allows us to quantitatively reason about nonfunctional properties for a restricted class of service-oriented real-time systems using formal methods. To properly motivate the choice for the used approach, we devise a requirements catalogue for the modeling and the analysis of probabilistic real-time systems with uncertainties and provide evidence that the uncertainties of type (1) and (2) in the targeted systems have a major impact on the used models and require distinguished analysis approaches. The formal model we use in this report are Interval Probabilistic Timed Automata (IPTA). Based on the outlined requirements, we give evidence that this model provides both enough expressiveness for a realistic and modular specifiation of the targeted class of systems, and suitable formal methods for analyzing properties, such as safety and reliability properties in a quantitative manner. As technical means for the quantitative analysis, we build on probabilistic model checking, specifically on probabilistic time-bounded reachability analysis and computation of expected reachability rewards and costs. To carry out the quantitative analysis using probabilistic model checking, we developed an extension of the Prism tool for modeling and analyzing IPTA. Our extension of Prism introduces a means for modeling probabilistic uncertainty in the form of probability intervals, as required for IPTA. For analyzing IPTA, our Prism extension moreover adds support for probabilistic reachability checking and computation of expected rewards and costs. We discuss the performance of our extended version of Prism and compare the interval-based IPTA approach to models with fixed probabilities.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

Publisher

Universitätsverlag Potsdam

Published Date

ISBN 10

3869561718

ISBN 13

9783869561714

Living with Our Sun’s Ultraviolet Rays

By: Arthur C. Giese

Write a review Read reviews Take a Quiz Solve Book Puzzle

Living with Our Sun’s Ultraviolet Rays

By: Arthur C. Giese

Sunlight is part of everyday life and we accept it as good-and good it is in a number of ways. The sun is our source of warmth, and of the light by which we see. It is, in fact, the source of the energy with which life continues on earth. It furnishes energy for photosynthesis, and the pro ducts of photosynthesis constitute our food, building materials, and fuel. A steady state of balance and fine interrelationships exists between life on earth and all the forces and stresses in nature. This book will pin point the balance and relationships we share with sunlight. Our primary focus will be on the ultraviolet radiation of the sun, and on the ultraviolet photobiology of life on earth. This is the story of the effects of the sun's ultraviolet radiation, both good and bad, on all of us and all of life. We will explore the nature of the sun's ultraviolet radiation as it reaches the earth's surface today, and as it probably affected the earth in the distant past; and examine the effect of such radiation on all life, unicellular organisms as well as multicellular plants and animals. The effects of the sun's ultraviolet rays are primarily a result of their action upon cells, and secondarily, a result of their interactions between cells. The cell of a multicellular organism-man included-is also part of the tissue of an organ, and the organ is part of the whole organism.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

193

Publisher

Springer Science & Business Media

Published Date

ISBN 10

1461587441

ISBN 13

9781461587446

Metric Temporal Graph Logic over Typed Attributed Graphs

Extended Version

By: Giese, Holger,Maximova, Maria,Sakizloglou, Lucas,Schneider, Sven

Write a review Read reviews Take a Quiz Solve Book Puzzle

Metric Temporal Graph Logic over Typed Attributed Graphs

Extended Version

By: Giese, Holger,Maximova, Maria,Sakizloglou, Lucas,Schneider, Sven

Graph repair, restoring consistency of a graph, plays a prominent role in several areas of computer science and beyond: For example, in model-driven engineering, the abstract syntax of models is usually encoded using graphs. Flexible edit operations temporarily create inconsistent graphs not representing a valid model, thus requiring graph repair. Similarly, in graph databases—managing the storage and manipulation of graph data—updates may cause that a given database does not satisfy some integrity constraints, requiring also graph repair. We present a logic-based incremental approach to graph repair, generating a sound and complete (upon termination) overview of least-changing repairs. In our context, we formalize consistency by so-called graph conditions being equivalent to first-order logic on graphs. We present two kind of repair algorithms: State-based repair restores consistency independent of the graph update history, whereas deltabased (or incremental) repair takes this history explicitly into account. Technically, our algorithms rely on an existing model generation algorithm for graph conditions implemented in AutoGraph. Moreover, the delta-based approach uses the new concept of satisfaction (ST) trees for encoding if and how a graph satisfies a graph condition. We then demonstrate how to manipulate these STs incrementally with respect to a graph update.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

Publisher

Universitätsverlag Potsdam

Published Date

ISBN 10

3869564636

ISBN 13

9783869564630

Metric Temporal Graph Logic over Typed Attributed Graphs

By: Holger Giese,Maria Maximova,Lucas Sakizloglou,Sven Schneider

Write a review Read reviews Take a Quiz Solve Book Puzzle

Metric Temporal Graph Logic over Typed Attributed Graphs

By: Holger Giese,Maria Maximova,Lucas Sakizloglou,Sven Schneider

Various kinds of typed attributed graphs are used to represent states of systems from a broad range of domains. For dynamic systems, established formalisms such as graph transformations provide a formal model for defining state sequences. We consider the extended case where time elapses between states and introduce a logic to reason about these sequences. With this logic we express properties on the structure and attributes of states as well as on the temporal occurrence of states that are related by their inner structure, which no formal logic over graphs accomplishes concisely so far. Firstly, we introduce graphs with history by equipping every graph element with the timestamp of its creation and, if applicable, its deletion. Secondly, we define a logic on graphs by integrating the temporal operator until into the well-established logic of nested graph conditions. Thirdly, we prove that our logic is equally expressive to nested graph conditions by providing a suitable reduction. Finally, the implementation of this reduction allows for the tool-based analysis of metric temporal properties for state sequences. Verschiedene Arten von getypten attributierten Graphen werden benutzt, um Zustände von Systemen in vielen unterschiedlichen Anwendungsbereichen zu beschreiben. Der etablierte Formalismus der Graphtransformationen bietet ein formales Model, um Zustandssequenzen für dynamische Systeme zu definieren. Wir betrachten den erweiterten Fall von solchen Sequenzen, in dem Zeit zwischen zwei verschiedenen Systemzuständen vergeht, und führen eine Logik ein, um solche Sequenzen zu beschreiben. Mit dieser Logik drücken wir zum einen Eigenschaften über die Struktur und die Attribute von Zuständen aus und beschreiben zum anderen temporale Vorkommen von Zuständen, die durch ihre innere Struktur verbunden sind. Solche Eigenschaften können bisher von keiner der existierenden Logiken auf Graphen vergleichbar darstellt werden. Erstens führen wir Graphen mit Änderungshistorie ein, indem wir jedes Graphelement mit einem Zeitstempel seiner Erzeugung und, wenn nötig, seiner Löschung versehen. Zweitens definieren wir eine Logik auf Graphen, indem wir den Temporaloperator Until in die wohl-etablierte Logik der verschachtelten Graphbedingungen integrieren. Drittens beweisen wir, dass unsere Logik gleich ausdrucksmächtig ist, wie die Logik der verschachtelten Graphbedingungen, indem wir eine passende Reduktionsoperation definieren. Zuletzt erlaubt uns die Implementierung dieser Reduktionsoperation die werkzeukbasierte Analyse von metrisch-temporallogischen Eigenschaften für Zustandssequenzen zu führen.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

Publisher

Universitätsverlag Potsdam

Published Date

ISBN 10

3869564334

ISBN 13

9783869564333

On the operationalization of graph queries with generalized discrimination networks

By: Beyhl, Thomas,Blouin, Dominique,Giese, Holger,Lambers, Leen

Write a review Read reviews Take a Quiz Solve Book Puzzle

On the operationalization of graph queries with generalized discrimination networks

By: Beyhl, Thomas,Blouin, Dominique,Giese, Holger,Lambers, Leen

Graph queries have lately gained increased interest due to application areas such as social networks, biological networks, or model queries. For the relational database case the relational algebra and generalized discrimination networks have been studied to find appropriate decompositions into subqueries and ordering of these subqueries for query evaluation or incremental updates of query results. For graph database queries however there is no formal underpinning yet that allows us to find such suitable operationalizations. Consequently, we suggest a simple operational concept for the decomposition of arbitrary complex queries into simpler subqueries and the ordering of these subqueries in form of generalized discrimination networks for graph queries inspired by the relational case. The approach employs graph transformation rules for the nodes of the network and thus we can employ the underlying theory. We further show that the proposed generalized discrimination networks have the same expressive power as nested graph conditions.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

Publisher

Universitätsverlag Potsdam

Published Date

ISBN 10

3869563729

ISBN 13

9783869563725

Modeling collaborations in self-adaptive systems of systems

terms, characteristics, requirements, and scenarios

By: Wätzoldt, Sebastian,Giese, Holger

Write a review Read reviews Take a Quiz Solve Book Puzzle

Modeling collaborations in self-adaptive systems of systems

terms, characteristics, requirements, and scenarios

By: Wätzoldt, Sebastian,Giese, Holger

An increasing demand on functionality and flexibility leads to an integration of beforehand isolated system solutions building a so-called System of Systems (SoS). Furthermore, the overall SoS should be adaptive to react on changing requirements and environmental conditions. Due SoS are composed of different independent systems that may join or leave the overall SoS at arbitrary point in times, the SoS structure varies during the systems lifetime and the overall SoS behavior emerges from the capabilities of the contained subsystems. In such complex system ensembles new demands of understanding the interaction among subsystems, the coupling of shared system knowledge and the influence of local adaptation strategies to the overall resulting system behavior arise. In this report, we formulate research questions with the focus of modeling interactions between system parts inside a SoS. Furthermore, we define our notion of important system types and terms by retrieving the current state of the art from literature. Having a common understanding of SoS, we discuss a set of typical SoS characteristics and derive general requirements for a collaboration modeling language. Additionally, we retrieve a broad spectrum of real scenarios and frameworks from literature and discuss how these scenarios cope with different characteristics of SoS. Finally, we discuss the state of the art for existing modeling languages that cope with collaborations for different system types such as SoS.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

Publisher

Universitätsverlag Potsdam

Published Date

ISBN 10

3869563249

ISBN 13

9783869563244

Automatic verification of behavior preservation at the transformation level for relational model transformation

By: Dyck, Johannes,Giese, Holger,Lambers, Leen

Write a review Read reviews Take a Quiz Solve Book Puzzle

Automatic verification of behavior preservation at the transformation level for relational model transformation

By: Dyck, Johannes,Giese, Holger,Lambers, Leen

The correctness of model transformations is a crucial element for model-driven engineering of high quality software. In particular, behavior preservation is the most important correctness property avoiding the introduction of semantic errors during the model-driven engineering process. Behavior preservation verification techniques either show that specific properties are preserved, or more generally and complex, they show some kind of behavioral equivalence or refinement between source and target model of the transformation. Both kinds of behavior preservation verification goals have been presented with automatic tool support for the instance level, i.e. for a given source and target model specified by the model transformation. However, up until now there is no automatic verification approach available at the transformation level, i.e. for all source and target models specified by the model transformation. In this report, we extend our results presented in [27] and outline a new sophisticated approach for the automatic verification of behavior preservation captured by bisimulation resp. simulation for model transformations specified by triple graph grammars and semantic definitions given by graph transformation rules. In particular, we show that the behavior preservation problem can be reduced to invariant checking for graph transformation and that the resulting checking problem can be addressed by our own invariant checker even for a complex example where a sequence chart is transformed into communicating automata. We further discuss today's limitations of invariant checking for graph transformation and motivate further lines of future work in this direction.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

126

Publisher

Universitätsverlag Potsdam

Published Date

ISBN 10

3869563915

ISBN 13

9783869563916

Model-driven engineering of adaptation engines for self-adaptive software

executable runtime megamodels

By: Thomas Vogel,Holger Giese

Write a review Read reviews Take a Quiz Solve Book Puzzle

Model-driven engineering of adaptation engines for self-adaptive software

executable runtime megamodels

By: Thomas Vogel,Holger Giese

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

Publisher

Universitätsverlag Potsdam

Published Date

ISBN 10

3869562277

ISBN 13

9783869562278

Scalable Compatibility for Embedded Real-time Components Via Language Progressive Timed Automata

By: Stefan Neumann,Holger Giese

Write a review Read reviews Take a Quiz Solve Book Puzzle

Scalable Compatibility for Embedded Real-time Components Via Language Progressive Timed Automata

By: Stefan Neumann,Holger Giese

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

Publisher

Universitätsverlag Potsdam

Published Date

ISBN 10

3869562269

ISBN 13

9783869562261

Book's by Giese, Holger

Efficient and scalable graph view maintenance for deductive graph databases based on generalized discrimination networks

Efficient and scalable graph view maintenance for deductive graph databases based on generalized discrimination networks

Inductive invariant checking with partial negative application conditions

Inductive invariant checking with partial negative application conditions

Models in Software Engineering

Models in Software Engineering

Scalable Compatibility for Embedded Real-time Components Via Language Progressive Timed Automata

Scalable Compatibility for Embedded Real-time Components Via Language Progressive Timed Automata

Model-driven engineering of adaptation engines for self-adaptive software

Model-driven engineering of adaptation engines for self-adaptive software

Quantitative Modeling and Analysis of Service-oriented Real-time Systems Using Interval Probabilistic Timed Automata

Quantitative Modeling and Analysis of Service-oriented Real-time Systems Using Interval Probabilistic Timed Automata

Living with Our Sun’s Ultraviolet Rays

Living with Our Sun’s Ultraviolet Rays

Metric Temporal Graph Logic over Typed Attributed Graphs

Metric Temporal Graph Logic over Typed Attributed Graphs

Metric Temporal Graph Logic over Typed Attributed Graphs

Metric Temporal Graph Logic over Typed Attributed Graphs

On the operationalization of graph queries with generalized discrimination networks

On the operationalization of graph queries with generalized discrimination networks

Modeling collaborations in self-adaptive systems of systems

Modeling collaborations in self-adaptive systems of systems

Automatic verification of behavior preservation at the transformation level for relational model transformation

Automatic verification of behavior preservation at the transformation level for relational model transformation

Model-driven engineering of adaptation engines for self-adaptive software

Model-driven engineering of adaptation engines for self-adaptive software

Scalable Compatibility for Embedded Real-time Components Via Language Progressive Timed Automata

Scalable Compatibility for Embedded Real-time Components Via Language Progressive Timed Automata

Username

Password

Username

Password

Password again

Birthday

Email