TY  - JOUR
A1  - Schneider, Sven
A1  - Maximova, Maria
A1  - Sakizloglou, Lucas
A1  - Giese, Holger
T1  - Formal testing of timed graph transformation systems using metric temporal graph logic
JF  - International journal on software tools for technology transfer
N2  - Embedded real-time systems generate state sequences where time elapses between state changes. Ensuring that such systems adhere to a provided specification of admissible or desired behavior is essential. Formal model-based testing is often a suitable cost-effective approach. We introduce an extended version of the formalism of symbolic graphs, which encompasses types as well as attributes, for representing states of dynamic systems. Relying on this extension of symbolic graphs, we present a novel formalism of timed graph transformation systems (TGTSs) that supports the model-based development of dynamic real-time systems at an abstract level where possible state changes and delays are specified by graph transformation rules. We then introduce an extended form of the metric temporal graph logic (MTGL) with increased expressiveness to improve the applicability of MTGL for the specification of timed graph sequences generated by a TGTS. Based on the metric temporal operators of MTGL and its built-in graph binding mechanics, we express properties on the structure and attributes of graphs as well as on the occurrence of graphs over time that are related by their inner structure. We provide formal support for checking whether a single generated timed graph sequence adheres to a provided MTGL specification. Relying on this logical foundation, we develop a testing framework for TGTSs that are specified using MTGL. Lastly, we apply this testing framework to a running example by using our prototypical implementation in the tool AutoGraph.
KW  - formal testing
KW  - typed attributed symbolic graphs
KW  - timed graph
KW  - transformation
KW  - graph conditions
KW  - metric temporal graph logic
Y1  - 2021
U6  - https://doi.org/10.1007/s10009-020-00585-w
SN  - 1433-2779
SN  - 1433-2787
VL  - 23
IS  - 3
SP  - 411
EP  - 488
PB  - Springer
CY  - Heidelberg
ER  -