@book{GieseMaximovaSakizloglouetal.2018,
  author    = {Giese, Holger and Maximova, Maria and Sakizloglou, Lucas and Schneider, Sven},
  title     = {Metric temporal graph logic over typed attributed graphs},
  number    = {123},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-433-3},
  issn      = {1613-5652},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-411351},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {29},
  year      = {2018},
  abstract  = {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.},
  language  = {en}
}
@book{GieseMaximovaSakizloglouetal.2019,
  author    = {Giese, Holger and Maximova, Maria and Sakizloglou, Lucas and Schneider, Sven},
  title     = {Metric temporal graph logic over typed attributed graphs},
  number    = {127},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-463-0},
  issn      = {1613-5652},
  doi       = {10.25932/publishup-42752},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-427522},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {34},
  year      = {2019},
  abstract  = {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.},
  language  = {en}
}