Abstract
Boolean (or logical) algebras use variables which can have only a limited number of values. The purpose of this chapter is to give scientists involved in systems modelling the background needed to use the boolean approach in their own field of research. For rigorous and complete mathematical developments the reader should refer to the bibliography. In this book, we use the term “boolean” in its limited, but most common sense, meaning “binary”. In binary algebra, the variables can have only two values, 0 and 1 , or F (false) and T (true), or L (low) and H (high).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
E. J. MC CLUSKEY & T C. BARTEE 1962 “A Survey of switching circuit theory” (Mc. Graw Hill).
E. J. MC CLUSKEY 1965 “Introduction to the theory of switching circuits” (Mc. Graw Hill).
R.F. MILLER 1965 “Switching Theory: Vol.1. Combinational Circuits Vol.2. Sequential Circuits and Machines”. (J. Wiley & Sons).
J. FLORINE 1964 “La Synthese des Machines Logiques et Son automatisation”. (Dunod)
J. FLORINE 1969 “Automatismes à Séquences etCommandes Numériques”. (Dunod).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leussler, A., Van Ham, P. (1979). Combinational systems. 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_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-49321-8_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09556-9
Online ISBN: 978-3-642-49321-8
eBook Packages: Springer Book Archive