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.
Cite this item
Danos, V., Heindel, T., Honorato-Zimmer, R., & Stucki, S. (2014). Approximations for Stochastic Graph Rewriting. In S. Merz & J. Pang (Editors), Formal Methods and Software Engineering -- 16th International Conference on Formal Engineering Methods, ICFEM 2014, Luxembourg, Luxembourg, November 3-5, 2014. Proceedings. https://doi.org/10.1007/978-3-319-11737-9_1
Click Copy to copy the citation, or select the text manually.
icfem.pdf
Postprint
Accepted version
openaccess
646.64 KB
Adobe PDF
2c7425058123b143b2bedf79d2e3af0b