Approximations for Stochastic Graph Rewriting
- Cite this paper as:
- Danos V., Heindel T., Honorato-Zimmer R., Stucki S. (2014) Approximations for Stochastic Graph Rewriting. In: Merz S., Pang J. (eds) Formal Methods and Software Engineering. ICFEM 2014. Lecture Notes in Computer Science, vol 8829. Springer, Cham
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.
Unable to display preview. Download preview PDF.