Parallelism and Concurrency of Stochastic Graph Transformations
Graph transformation systems (GTS) have been proposed for high-level stochastic modelling of dynamic systems and networks. The resulting systems can be described as semi-Markov processes with graphs as states and transformations as transitions. The operational semantics of such processes can be explored through stochastic simulation. In this paper, we develop the basic theory of stochastic graph transformation, including generalisations of the Parallelism and Concurrency Theorems and their application to computing the completion time of a concurrent process.
KeywordsCompletion Time Graph Transformation Sequential Composition Business Process Model Transformation Sequence
Unable to display preview. Download preview PDF.
- 1.Brandt, C., Hermann, F., Groote, J.F.: Generation and Evaluation of Business Continuity Processes; Using Algebraic Graph Transformation and the mCRL2 Process Algebra. Journal of Research and Practice in Information Technology 43(1), 65–85 (2011)Google Scholar
- 3.Grinstead, C., Snell, J.: Introduction to Probability. Dartmouth Chance Project (2005), http://www.dartmouth.edu/~chance/teaching_aids/books_articles/probability_book/book.html
- 5.Hermann, F.: Analysis and Optimization of Visual Enterprise Models Based on Graph and Model Transformation. Ph.D. thesis, TU Berlin (2011), http://opus.kobv.de/tuberlin/volltexte/2011/3008/
- 8.Wolfram Research: Mathematica 8.0 (2012), http://www.wolfram.com/
- 11.TFS, TU Berlin: AGG: The Attributed Graph Grammar System, http://tfs.cs.tu-berlin.de/agg/