Parallelism and Concurrency of Stochastic Graph Transformations

Abstract

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.

DOI: 10.1007/978-3-642-33654-6_7

Extracted Key Phrases

6 Figures and Tables

Cite this paper

@inproceedings{Heckel2012ParallelismAC, title={Parallelism and Concurrency of Stochastic Graph Transformations}, author={Reiko Heckel and Hartmut Ehrig and Ulrike Golas and Frank Hermann}, booktitle={ICGT}, year={2012} }