Résumé : I will give an overview and report on the latest results of the so-called rule algebraic approach to stochastic rewriting systems [1,2]. Besides a general (high-level) introduction to the mathematical concepts, the focus of the talk will be on the practical implications in terms of efficiently analyzing rewriting systems. In particular, I will compare the traditional approaches to analyzing chemical reaction systems (aka discrete graph rewriting systems) to analytically tractable cases of stochastic graph rewriting systems, such as the preferential attachment model. Amongst the novel results, the combinatorial conversion and disassociator dynamics theorems introduced in detail in the morning session will be mentioned, as well as perspectives in terms of restricted rewriting systems.
 N. Behr, V. Danos and I. Garnier, Stochastic mechanics of graph rewriting, In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, pp. 46-55. ACM, 2016.
 N. Behr, V. Danos, I. Garnier and T. Heindel, The algebras of graph rewriting, arXiv preprint arXiv:1612.06240 (2016).
|Dernière modification : mardi 02 mai 2017||Contact : Cyril.Banderier at lipn.univ-paris13.fr|