Approximations for Stochastic Graph Rewriting

  • Vincent Danos
  • Tobias Heindel
  • Ricardo Honorato-Zimmer
  • Sandro Stucki
Conference paper

DOI: 10.1007/978-3-319-11737-9_1

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8829)
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

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Vincent Danos
    • 1
  • Tobias Heindel
    • 1
  • Ricardo Honorato-Zimmer
    • 1
  • Sandro Stucki
    • 2
  1. 1.School of InformaticsUniversity of EdinburghEdinburghUnited Kingdom
  2. 2.Programming Methods Laboratory, EPFLLausanneSwitzerland

Personalised recommendations