Abstract
In this central chapter I show how a system amenable to boolean description can be analyzed in terms of a set of logical equations. Each equation relates, for any time, the values of a function a, b, c,...(associated with the state, on or off, of a gene, of a chemical reaction, etc.), to the values of input variables, and of memorization variables α, β, γ,...(associated with the presence or absence of the product of a gene, of a chemical reaction, etc.). Time is present in a similar way as in differential equations; in fact, in our logical equations a, b, c,... play essentially the role of the time derivatives of α, β, γ. From the set of logical equations describing a system, one can derive its stable steady states (if any), the pathways (temporal sequences of states) and the conditions determining which pathway will be followed.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Thomas, R. (1979). Kinetic logic : a boolean analysis of the dynamic behaviour of control circuits. In: Thomas, R. (eds) Kinetic Logic A Boolean Approach to the Analysis of Complex Regulatory Systems. Lecture Notes in Biomathematics, vol 29. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-49321-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-49321-8_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09556-9
Online ISBN: 978-3-642-49321-8
eBook Packages: Springer Book Archive