Moment Semantics for Reversible Rule-Based Systems

DOI10.1007/978-3-319-20860-2_1zbMath1464.68139OpenAlexW1589305078MaRDI QIDQ2822487

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

Publication date: 30 September 2016

Published in: Reversible Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-20860-2_1

zbMATH Keywords

stochastic processesgraph rewritingrule-based systemsreversible computingmoment semantics

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42) Other nonclassical models of computation (68Q09) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items

Unnamed Item, Rewriting Theory for the Life Sciences: A Unifying Theory of CTMC Semantics, Computing Continuous-Time Markov Chains as Transformers of Unbounded Observables, Rewriting theory for the life sciences: a unifying theory of CTMC semantics

Uses Software

• PySB
• pa-ode-gen
• iNA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic approach to single-pushout graph transformation
• Matrix representation of the stationary measure for the Multispecies TASEP
• Rigid geometric constraints for Kappa models
• Coarse-graining the dynamics of ideal branched polymers
• DPO Transformation with Open Maps
• Emergence of Scaling in Random Networks
• Sesqui-Pushout Rewriting
• SOME RESULTS ON SOLVABILITY OF ORDINARY LINEAR DIFFERENTIAL EQUATIONS IN LOCALLY CONVEX SPACES
• Markov Chains
• Graph fission in an evolving voter model
• Pattern Graphs and Rule-Based Models: The Semantics of Kappa
• Intrinsic information carriers in combinatorial dynamical systems
• Foundations of Software Science and Computation Structures
• Adhesive and quasiadhesive categories
• Approximating Markov Processes by Averaging