Mean Quantitative Coverability in Stochastic Graph Transformation Systems

Authors

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

DOI:

https://doi.org/10.14279/tuj.eceasst.68.958

Abstract

Many classical problems for Petri nets, in particular reachability and coverability, have obvious counterparts for graph transformation systems. Similarly, many problems for stochastic Petri nets, seen as a model for chemical reaction networks, are special cases of corresponding problems in graph transformation. For example, the evolution of the counts of chemical species in a test tube over time is a typical phenomenon from chemistry, which can faithfully be modelled and analysed using stochastic Petri nets. The corresponding mean quantitative coverability problem for stochastic graph transformation is simple to describe – yet hard to solve. This extended abstract summarises the fundamental ideas and challenges.

Downloads

Published

2014-10-01

How to Cite

[1]
T. Heindel, V. Danos, R. Honorato-Zimmer, and S. Stucki, “Mean Quantitative Coverability in Stochastic Graph Transformation Systems”, eceasst, vol. 68, Oct. 2014.