000210229 001__ 210229
000210229 005__ 20190317000228.0
000210229 020__ $$a978-3-319-11736-2
000210229 0247_ $$2doi$$a10.1007/978-3-319-11737-9_1
000210229 037__ $$aCONF
000210229 245__ $$aApproximations for Stochastic Graph Rewriting
000210229 269__ $$a2014
000210229 260__ $$bSpringer International Publishing$$c2014
000210229 336__ $$aConference Papers
000210229 490__ $$aLecture Notes in Computer Science$$v8829
000210229 500__ $$aInvited paper. This research was sponsored by the European Research Council (ERC) under the grants 587327 “DOPPLER” and 320823 “RULE”.
000210229 520__ $$aIn 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.
000210229 6531_ $$aStochastic Processes
000210229 6531_ $$aGraph Rewriting
000210229 6531_ $$aRule-Based Systems
000210229 700__ $$aDanos, Vincent
000210229 700__ $$aHeindel, Tobias
000210229 700__ $$aHonorato-Zimmer, Ricardo
000210229 700__ $$0246677$$aStucki, Sandro$$g152185
000210229 7112_ $$a16th International Conference on Formal Engineering Methods, ICFEM '14$$cLuxembourg, Luxembourg$$dNovember 3-5, 2014
000210229 720_1 $$aMerz, Stephan$$eed.
000210229 720_1 $$aPang, Jun$$eed.
000210229 773__ $$q1-10$$tFormal Methods and Software Engineering -- 16th International Conference on Formal Engineering Methods, ICFEM 2014, Luxembourg, Luxembourg, November 3-5, 2014. Proceedings
000210229 8564_ $$s662160$$uhttps://infoscience.epfl.ch/record/210229/files/icfem.pdf$$yPostprint$$zPostprint
000210229 909C0 $$0252187$$pLAMP$$xU10409
000210229 909CO $$ooai:infoscience.tind.io:210229$$pconf$$pIC$$qGLOBAL_SET
000210229 917Z8 $$x152185
000210229 937__ $$aEPFL-CONF-210229
000210229 973__ $$aEPFL$$rNON-REVIEWED$$sPUBLISHED
000210229 980__ $$aCONF