Stochastic process semantics for dynamical grammars

  • Eric MjolsnessEmail author
  • Guy Yosiphon


We define a class of probabilistic models in terms of an operator algebra of stochastic processes, and a representation for this class in terms of stochastic parameterized grammars. A syntactic specification of a grammar is formally mapped to semantics given in terms of a ring of operators, so that composition of grammars corresponds to operator addition or multiplication. The operators are generators for the time-evolution of stochastic processes. The dynamical evolution occurs in continuous time but is related to a corresponding discrete-time dynamics. An expansion of the exponential of such time-evolution operators can be used to derive a variety of simulation algorithms. Within this modeling framework one can express data clustering models, logic programs, ordinary and stochastic differential equations, branching processes, graph grammars, and stochastic chemical reaction kinetics. The mathematical formulation connects these apparently distant fields to one another and to mathematical methods from quantum field theory and operator algebra. Such broad expressiveness makes the framework particularly suitable for applications in machine learning and multiscale scientific modeling.


stochastic processes operator algebra dynamical systems multiscale modeling probabilistic inference machine learning 

Mathematics Subject Classifications (2000)

68T30 68T37 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Mjolsness, E.: Stochastic process semantics for dynamical grammar syntax: an overview. In: Ninth International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, Florida, 4-6 January 2006Google Scholar
  2. 2.
    Preston, C.J.: Spatial birth-and-death processes. Bull. Int. Statist. Inst. 46(2), 371–391 (1977)MathSciNetGoogle Scholar
  3. 3.
    Lange, K.: Applied Probability. Section 96. Springer, Berlin Heidelberg New York (2004)Google Scholar
  4. 4.
    Snyder, D.L., Miller, M.I.: Random Point Processes in Time and Space. Wiley, New York (1991)zbMATHGoogle Scholar
  5. 5.
    Athreyea, K.B., Ney, P.E.: Branching Processes. Dover, New York (1972)Google Scholar
  6. 6.
    Engel, K., Nagel, R.: One-parameter Semigroups for Linear Evolution Equations. Springer Graduate Texts in Mathematics 194, New York (2000)zbMATHGoogle Scholar
  7. 7.
    Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Francisco (1988)Google Scholar
  8. 8.
    Nodelman, U., Shelton, C., Koller , D.: Continuous time Bayesian networks. In: Proceedings of the Eighteenth Conference on Uncertainty in Artificial Intelligence (UAI), pp. 378–387. Morgan Kaufmann, San Francisco (2002)Google Scholar
  9. 9.
    Dean, T., Kanazawa, K.: A model for reasoning about persistence and causation. Comput. Intell. 5, 142–150 (1989)Google Scholar
  10. 10.
    Sanghai, S., Domingos, P., Weld, D.: Relational dynamic Bayesian networks. J. Artif. Intell. Res. 24, 759–797 (2005)zbMATHGoogle Scholar
  11. 11.
    Milch, B., Marthi, B., Russell, S., Sontag, D.: BLOG: probabilistic models with unknown objects. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence, pp. 1352–1359 (2005)Google Scholar
  12. 12.
    St-Aubin, R., Friedman, J., Mackworth, A.K.: A formal mathematical framework for modeling probabilistic hybrid systems. In: Ninth International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, Florida, 4–6 January 2006Google Scholar
  13. 13.
    Prusinkiewicz, P., Lindenmeyer, A.: The Algorithmic Beauty of Plants. Springer, Berlin Heidelberg New York (1990)zbMATHGoogle Scholar
  14. 14.
    Giavitto, J., Michel, O.: MGS: a programming language for the transformations of topological collections. LaMI – Universite d’ Evry Val d’Essonne. Technical Report 61–2001. Cited in May 2001Google Scholar
  15. 15.
    Prusinkiewicz, P., Hammel, M.S., Mjolsness, E.: Animation of plant development. Comput. Graph. SIGGRAPH ‘93. 351–360 (1993)Google Scholar
  16. 16.
    Mjolsness, E., Sharp, D.H., Reinitz, J.: A Connectionist Model of Development. J. Theor. Biol. 152(4), 429–454 (1991)CrossRefGoogle Scholar
  17. 17.
    Phillips, A., Cardelli, L.: A Correct Abstract Machine for the Stochastic Pi-calculus. Cited Sep 2006 (2006)
  18. 18.
    Petri, C.A.: Kommunikation mit Automaten. Dissertation, University of Bonn (1962)Google Scholar
  19. 19.
    Jensen, K.: Coloured Petri Nets I, II, III. Springer, Berlin Heidelberg New York (1997)Google Scholar
  20. 20.
    Genrich, H.: Predicate/Transition nets. Advances in Petri nets : APN 1, 208–247. (1986)Google Scholar
  21. 21.
    Haas, P.J.: Stochastic Petri Nets. Springer, Berlin Heidelberg New York (2006)Google Scholar
  22. 22.
    van Kampen, N.G.: Stochastic Processes in Physics and Chemistry. North-Holland, Amsterdam, The Netherlands (1981)zbMATHGoogle Scholar
  23. 23.
    Reed, M., Simon, B.: Methods of Modern Mathematical Physics: Functional Analysis I. Academic, New York (1972)Google Scholar
  24. 24.
    Mattis, D.C., Glasser, M.L.: The uses of quantum field theory in diffusion-limited reactions. Rev. Mod. Phys. 70, 979–1001 (1998)CrossRefGoogle Scholar
  25. 25.
    McLachlan, R.I., Quispel, G.R.: Splitting methods. Acta Numer. 11, 341–434 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  26. 26.
    Hatano, N., Suzuki, M.: Finding Exponential Product Formulas of Higher Orders. Cited in 2 Jun 2005 (2005)
  27. 27.
    Hall, B.C.: Lie Groups, Lie Algebras, and Representations: An Elementary Introduction, pp. 63–76. Springer, Berlin Heidelberg New York (2003)zbMATHGoogle Scholar
  28. 28.
    Müser, M.H.: The path-integral Monte Carlo approach of rigid linear molecules in three dimensions. Mol. Simul. 17(131) (1996)Google Scholar
  29. 29.
    Dyson, F.: Phys. Rev. 75, 486 (1949)zbMATHCrossRefMathSciNetGoogle Scholar
  30. 30.
    Risken, H.: The Fokker–Planck Equation. Springer, Berlin Heidelberg New York (1984)zbMATHGoogle Scholar
  31. 31.
    Gillespie, D.J.: A general method for numerically simulating the stochastic time evolution of coupled chemical reactions. J. Comput. Phys. 2, 403–434 (1976)CrossRefMathSciNetGoogle Scholar
  32. 32.
    Shachter, R.: Evaluating influence diagrams. Oper. Res. 33, 871–882 (1986)MathSciNetGoogle Scholar
  33. 33.
    Kanazawa, Koller, D., Russell, S.: Stochastic simulation algorithms for dynamic probabilistic networks. In: Proceedings of Uncertainty in Artificial Intelligence 95. (1995)
  34. 34.
    Mjolsness, E.: Variable-Structure Systems from Graphs and Grammars. UC Irvine School of Information and Computer Sciences, Irvine. UCI ICS TR# 05-09, (2005)
  35. 35.
    Ghahramani, Z.: Non-parametric Bayesian methods. In: The 21st Conference on Uncertainty in Artificial Intelligence (UAI 2005), University of Edinburgh, Edinburgh, Scotland, July 26th–July 29th 2005. Cited in Sep 06 (2006)
  36. 36.
    Geman, S., Geman, D.: Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Trans. Pattern Anal. Mach. Intell. 6, 721–741 (1984)zbMATHCrossRefGoogle Scholar
  37. 37.
    MacQueen, J.B.: Some methods for classification and analysis of multivariate observations. In: Proceedings of 5th Berkeley Symposium on Mathematical Statistics and Probability (1967)Google Scholar
  38. 38.
    Dempster, A., Laird, N., Rubin, D.: Maximum likelihood from incomplete data via the EM algorithm. J.R. Stat. Soc. Series B, 1–38 (1977)MathSciNetGoogle Scholar
  39. 39.
    Hart, C., et al.: A mathematical and computational framework for quantitative comparison and integration of large-scale gene expression data. Nucleic Acids Res. 33, 2580–2594 (2005)CrossRefMathSciNetGoogle Scholar
  40. 40.
    Jönsson, H., et al.: An auxin-driven polarized transport model for phyllotaxis. Proc. Natl. 1900 Acad. Sciences USA, 103(5), 1633–1638. Retrieved 13 January 2006 from http://www.pnas.1901 org/cgi/content/abstract/103/5/1633 (2006)
  41. 41.
    Federl, P., Prusinkiewicz, P.: Solving differential equations in developmental models of multicellular structures expressed using L-systems. In: Bubak, M., van Albada, G., Sloot, P., Dongarra, J. (eds.) Proceedings of Computational Science. ICCS 2004, II. Lecture Notes in Computer Science, vol. 3037, pp. 65–72. Springer, Berlin Heidelberg New York (2004)Google Scholar
  42. 42.
    Jacquez, J.A., Simon, C.P.: The stochastic SI model with recruitment and deaths. I. Comparison with the closed SIS model. Math. Biosci. 117, 77–125 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  43. 43.
    Cenzer, D., Marek, V.W., Remmel, J.B.: Using logic programs to reason about infinite sets. In: Eighth International Symposium on Artificial Intelligence and Mathematics. (2004)
  44. 44.
    Cuny, J., Ehrig, H., Engels, G., Rozenberg, G.: Graph Grammars and their Applications to Computer Science. Springer, Berlin Heidelberg New York (1994)Google Scholar
  45. 45.
    Mjolsness, E.: Symbolic neural networks derived from stochastic grammar domain models. In: Sun, R., Alexandre, R. (eds.) Connectionist Symbolic Integration. Erlbaum, Mahwah, NJ (1997)Google Scholar
  46. 46.
    Bhan, A., Mjolsness, E.: Static and dynamic models of biological networks. Complexity 11(6), 57–63 (2006)CrossRefMathSciNetGoogle Scholar
  47. 47.
    Turing, A.M.: The chemical basis of morphogenesis. Phil. Trans. Roy. Soc. Lond. B237, 37–72 (1952)Google Scholar
  48. 48.
    Gor, V., Bacarian, T., Elowitz, M., Mjolsness, E.: Tracking cell signals in fluorescent images. In: Computer Vision Methods for Bioinformatics (CVMB) workshop, at Computer Vision and Pattern Recognition (CVPR). Cited in June 2005
  49. 49.
    Shapiro, B.E., et al.: Cellerator: extending a computer algebra system to include biochemical arrows for signal transduction simulations. Bioinformatics 19, 677–678 (2003)CrossRefGoogle Scholar
  50. 50.
    Fracchia, F.D.: Integrating lineage and interaction for the visualization of cellular structures. In: Cuny, J., Ehrig, H., Engels, G., Rozenberg, G. (eds.) Graph Grammars and Their Application to Computer Science. Fifth International Workshop, Lecture Notes in Computer Science 1073, pp. 521–535. Springer, Berlin Heidelberg New York (1996)CrossRefGoogle Scholar
  51. 51.
    Soloveichik, D., Cook, M., Winfree, E., Bruck, J. : Computation with Finite Stochastic Chemical Reaction Networks. manuscript (2006)Google Scholar

Copyright information

© Springer Science+Business Media, Inc. 2007

Authors and Affiliations

  1. 1.Donald Bren School of Information and Computer ScienceUniversity of CaliforniaIrvineUSA

Personalised recommendations