Stochastic Simulation of Graph Transformation Systems

  • Paolo Torrini
  • Reiko Heckel
  • István Ráth
Conference paper

DOI: 10.1007/978-3-642-12029-9_11

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6013)
Cite this paper as:
Torrini P., Heckel R., Ráth I. (2010) Stochastic Simulation of Graph Transformation Systems. In: Rosenblum D.S., Taentzer G. (eds) Fundamental Approaches to Software Engineering. FASE 2010. Lecture Notes in Computer Science, vol 6013. Springer, Berlin, Heidelberg

Abstract

Stochastic graph transformation systems (SGTS) [1] support integrated modelling of architectural reconfiguration and non-functional aspects such as performance and reliability. In its simplest form a SGTS is a graph transformation system (GTS) where each rule name is associated with a rate of an exponential distribution governing the delay of its application. However, this approach has its limitations. Model checking with explicit states does not scale well to models with large state space. Since performance and reliability properties often depend on the behaviour of large populations of entities (network nodes, processes, services, etc.), this limitation is significant. Also, exponential distributions do not always provide the best abstraction. For example, the time it takes to make a phone call or transmit a message is more likely to follow a normal distribution.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Paolo Torrini
    • 1
  • Reiko Heckel
    • 1
  • István Ráth
    • 2
  1. 1.Department of Computer ScienceUniversity of Leicester 
  2. 2.Department of Measurement and Information SystemsBudapest University of Technology and Economics 

Personalised recommendations