@ARTICLE{HLM06FI,
  title = {{Stochastic graph transformation systems}},
  author = {{Reiko} {Heckel} and {Georgios} {Lajios} and {Sebastian} {Menge}},
  journal = {Fundamenta Informaticae. SPECIAL ISSUE ON ICGT 2004.},
  pages = {63 - 84  },
  abstract = {In distributed and mobile systems with volatile bandwidth and fragile connectivity, non-functional aspects like performance and reliability become more and more important. To formalize, measure, and predict such properties, stochastic methods are required. At the same time such systems are characterized by a high degree of architectural reconfiguration. Viewing the architecture of a distributed system as a graph, this is naturally modeled by graph transformations. To combine these two views, in this paper we introduce stochastic graph transformation systems associating with each rule its application rate - the rate of the exponential distribution governing the delay of its application. Beside the basic definitions and a motivating example, we derive continuous time Markov chains, establish a link with continuous stochastic logic, deal with the problem of abstraction through graph isomorphisms, and discuss the analysis of properties by means of an experimental tool chain.},
  volume = {74},
  number = {1},
  year = {2006},
  url = {http://www.cs.le.ac.uk/people/rh122/papers/2006/HLM06FI.pdf},
  issn = {0169-2968},
  partner = {ULEICES},
}