Stochastic Analysis of Graph Transformation Systems: A Case Study in P2P Networks

Photograph of Reiko Heckel

Reiko Heckel

(Leicester)

In distributed and mobile systems with volatile bandwidth and fragile connectivity, non-functional aspects like performance and reliability become more and more important. To formalise, measure, and predict these properties, stochastic methods are required. At the same time such systems are characterised by a high degree of architectural reconfiguration. Viewing the architecture of a distributed system as a graph, this is naturally modelled by graph transformations. To address these two concerns, stochastic graph transformation systems have been introduced associating with each rule its application rate?the rate of the exponential distribution governing the delay of its application. Deriving continuous-time Markov chains, Continuous Stochastic Logic is used to specify reliability properties and verify them through model checking. ,P> In particular, we study a protocol for the reconfiguration of P2P networks intended to improve their reliability by adding redundant connections. The modelling of this protocol as a (stochastic) graph transformation system takes advantage of negative application and conditions path expressions. The ensuing high-level style of specification helps to reduce the number of states and increases the capabilities for automated analysis.
Tuesday 15th November 2005, 14:00
Robert Recorde Room
Department of Computer Science