@Article{MGK18,
AUTHOR = {Maximova, Maria and Giese, Holger and Krause, Christian},
TITLE = {{Probabilistic Timed Graph Transformation Systems}},
YEAR = {2018},
JOURNAL = {Journal of Logical and Algebraic Methods in Programming},
VOLUME = {101},
PAGES = {110 - 131},
URL = {http://www.sciencedirect.com/science/article/pii/S2352220817302365},
OPTacc_url = {},
PDF = {uploads/pdf/MGK18_PTGTS.pdf},
OPTacc_pdf = {},
ABSTRACT = {Today, software has become an intrinsic part of complex distributed embedded real-time systems. The next generation of embedded real-time systems will interconnect the today unconnected systems via complex software parts and the service-oriented paradigm. Due to these interconnections, the architecture of systems can be subject to changes at run-time, e.g. when dynamic binding of service end-points is employed or complex collaborations are established dynamically. However, suitable formalisms and techniques that allow for modeling and analysis of timed and probabilistic behavior of such systems as well as of
their structure dynamics do not exist so far.

To fill the identified gap, we propose Probabilistic Timed Graph Transformation Systems (PTGTSs) as a high-level description language that supports all the necessary aspects of structure dynamics, timed behavior, and probabilistic behavior. We introduce the formal model of PTGTSs in this paper as well as present and formally verify a mapping of models with finite state spaces to probabilistic timed automata (PTA) that allows to use the PRISM model checker to analyze PTGTS models with respect to PTCTL properties.}
}