Reference : Parallelism and Concurrency of Stochastic Graph Transformations
Scientific congresses, symposiums and conference proceedings : Paper published in a journal
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/3926
Parallelism and Concurrency of Stochastic Graph Transformations
English
Heckel, Reiko [University of Leicester, United Kingdom]
Ehrig, Hartmut [Technische Universität Berlin, Germany]
Golas, Ulrike [Technische Universität Berlin, Germany]
Hermann, Frank mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
2012
Graph Transformation, Lecture Notes in Computer Science (LNCS)
Springer
7562
96-110
Yes
Int. Conf. on Graph Transformation
Sep. 2012
Bremen
Germany
[en] graph transformation ; concurrency ; stochastic processes
[en] 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.
http://hdl.handle.net/10993/3926

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Limited access
HEGH12.pdfPublisher postprint1.76 MBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.