Parallelism and concurrency of stochastic graph transformations

Authors:
Reiko Heckel;Hartmut Ehrig;Ulrike Golas;Frank Hermann
Affiliations:
University of Leicester, UK;Technische Universität Berlin, Germany;Konrad-Zuse-Zentrum für Informationstechnik Berlin, Germany;University of Luxembourg, Luxembourg
Venue:
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Year:
2012

Citing 6
Cited 0

Scheduling under uncertainty: bounding the makespan distribution

Computational Discrete Mathematics
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)

Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
Elements for response-time statistics in ERP transaction systems

Performance Evaluation
The model transformation language of the VIATRA2 framework

Science of Computer Programming
Stochastic simulation of graph transformation systems

FASE'10 Proceedings of the 13th international conference on Fundamental Approaches to Software Engineering
Stochastic analysis of graph transformation systems: a case study in P2P networks

ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing

Quantified Score

Hi-index	0.00

Visualization

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.