Stochastic mechanics of graph rewriting

DOI10.1145/2933575.2934537zbMath1401.68132OpenAlexW2466928235MaRDI QIDQ4635860

Ilias Garnier, Nicolas Behr, Vincent Danos

Publication date: 23 April 2018

Published in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://www.pure.ed.ac.uk/ws/files/25448314/final_paper_submission159_2.pdf

zbMATH Keywords

graph rewritingconcurrencyprobabilistic systems

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (12)

Unnamed Item ⋮ Rewriting Theory for the Life Sciences: A Unifying Theory of CTMC Semantics ⋮ Verifying chemical reaction network implementations: a pathway decomposition approach ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Rewriting theory for the life sciences: a unifying theory of CTMC semantics ⋮ Prospects for declarative mathematical modeling of complex biological systems ⋮ Rule Algebras for Adhesive Categories ⋮ Concurrency theorems for non-linear rewriting theories

This page was built for publication: Stochastic mechanics of graph rewriting