Approximations for Stochastic Graph Rewriting

In this note we present a method to compute approximate descriptions of a class of stochastic systems. For the method to apply, the system must be presented as a Markov chain on a state space consisting in graphs or graph-like objects, and jumps must be described by transformations which follow a finite set of local rules.


Editor(s):
Merz, Stephan
Pang, Jun
Published in:
Formal Methods and Software Engineering -- 16th International Conference on Formal Engineering Methods, ICFEM 2014, Luxembourg, Luxembourg, November 3-5, 2014. Proceedings, 1-10
Presented at:
16th International Conference on Formal Engineering Methods, ICFEM '14, Luxembourg, Luxembourg, November 3-5, 2014
Year:
2014
Publisher:
Springer International Publishing
ISBN:
978-3-319-11736-2
Keywords:
Note:
Invited paper. This research was sponsored by the European Research Council (ERC) under the grants 587327 “DOPPLER” and 320823 “RULE”.
Laboratories:




 Record created 2015-07-26, last modified 2018-09-13

Postprint:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)