An approach to automatic verification of stochastic graph transformations

Non-functional requirements like performance and reliability play a prominent role in distributed and dynamic systems. To measure and predict such properties using stochastic formal methods is crucial. At the same time, graph transformation systems are a suitable formalism to formally model distributed and dynamic systems. Already, to address these two issues, stochastic graph transformation systems (SGTS) have been introduced to model dynamic distributed systems. But most of the researches so far are concentrated on SGTS as a modelling means without considering the need for suitable analysis tools. In this paper, we present an approach to verify this kind of graph transformation systems using PRISM (a stochastic model checker). We translate the SGTS to the input language of PRISM and then PRISM performs the model checking and returns the results back to the designers.