Executable Symbolic Models of Neural Processes

Background Neuroscience is experiencing explosive growth in detailed high-quality experimental information on neural processes underlying learning, memory and behavior. There is a need for computational models that can manage this outpouring of information, derive knowledge from information, and to generate novel, testable hypotheses. Many current models of neural processes utilize a framework of differential equations. These models tend to exhibit high sensitivity to system parameters requiring accurate measurements of these parameters. Such data are frequently unavailable, leading to difficult solution stability, robustness, and validity problems. Further, the models do not scale easily since they rapidly become intractable as the number of cells incorporated increases. The situation is analogous to that in the biochemical pathway modeling. There, a complementary approach based on a computing formalism called Pathway Logic, implemented by the high-level rewriting-logic language Maude. This approach is being successfully used to model and simulate biochemical signaling pathways.

[1]  D. A. Baxter,et al.  Mechanisms underlying fictive feeding in aplysia: coupling between a large neuron with plateau potentials activity and a spiking neuron. , 2002, Journal of neurophysiology.

[2]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[3]  Rafael Luján From Molecules to Networks: An Introduction to Cellular and Molecular Neuroscience, John H. Byrne, James L. Roberts (Eds.). Elsevier Academic Press (2004) , 2005 .

[4]  K. Pearson Common principles of motor control in vertebrates and invertebrates. , 1993, Annual review of neuroscience.

[5]  Douglas A. Baxter,et al.  Computational Model of a Central Pattern Generator , 2006, CMSB.

[6]  Carolyn L. Talcott,et al.  Representing and Simulating Protein Functional Domains in Signal Transduction Using Maude , 2003, CMSB.

[7]  Carolyn L. Talcott,et al.  Ðð Blockinøöóòò Aeóøø× Ò Ìììóööøø Blockin Blockinð Óñôùøøö Ë Blockin Blockin Blockinò ½ ´¾¼¼¾µ Íêää Øøôô»»ûûûººð××úúúöºòð»ðó Blockin Blockinøø»òø Blockin×»úóðùññ½ºøñð ½½ Ôôôô× Executable Models of Biological Networks , 2022 .

[8]  Douglas A. Baxter,et al.  CHAPTER 7 – Dynamical Properties of Excitable Membranes , 2004 .

[9]  J. Meseguer,et al.  Rewriting Logic as a Logical and Semantic Framework , 1996 .

[10]  D. A. Baxter,et al.  In Vitro Analog of Operant Conditioning inAplysia. II. Modifications of the Functional Dynamics of an Identified Neuron Contribute to Motor Pattern Selection , 1999, The Journal of Neuroscience.

[11]  Carolyn L. Talcott,et al.  Pathway logic modeling of protein functional domains in signal transduction. , 2003 .

[12]  L. F. Abbott 4 – Single Neuron Dynamics: an Introduction , 1994 .

[13]  François Fages,et al.  The Biochemical Abstract Machine BIOCHAM , 2004, CMSB.

[14]  M. G. Sriram Modelling protein functional domains in signal transduction using Maude , 2003, Briefings Bioinform..

[15]  José Meseguer,et al.  Pathway Logic: Symbolic Analysis of Biological Signaling , 2001, Pacific Symposium on Biocomputing.

[16]  Robert Stevens,et al.  e-Science and biological pathway semantics , 2007, BMC Bioinformatics.

[17]  David Harel,et al.  Statecharts: A Visual Formalism for Complex Systems , 1987, Sci. Comput. Program..

[18]  Abraham J Susswein,et al.  Multiple memory processes following training that a food is inedible in Aplysia. , 1998, Learning & memory.

[19]  Corrado Priami,et al.  Application of a stochastic name-passing calculus to representation and simulation of molecular processes , 2001, Inf. Process. Lett..

[20]  D. A. Baxter,et al.  Classical Conditioning of Feeding in Aplysia: II. Neurophysiological Correlates , 2000, The Journal of Neuroscience.

[21]  Kei-Hoi Cheung,et al.  Advancing translational research with the Semantic Web , 2007, BMC Bioinformatics.

[22]  Narciso Martí-Oliet,et al.  The Maude 2.0 System , 2003, RTA.