Lucas Sakizloglou's Books

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

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

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

Book's by Lucas Sakizloglou

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

Metric Temporal Graph Logic over Typed Attributed Graphs

Metric Temporal Graph Logic over Typed Attributed Graphs

Username

Password

Username

Password

Password again

Birthday

Email