Abstract
Due to their notable dynamic behaviour, boolean discrete time dynamical systems in the state space {0, 1}n are extensively studied in many different fields. Two well known examples are neural networks and cellular automata, the former used for special computational purposes and artificial intelligence, the latter used for the simulation of complex systems.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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.
References
F. Robert, Discrete Iterations, Springer Verlag, NY (1986).
G. Cattaneo, R. Nani, A method for the analysis of parallel boolean networks with low connectivity, in print on Proc. 3° Workshop on “Parallel Architectures and Neural Networks”, Vietri -Italy (1990).
R. Nani, Metodi di analisi per sistemi dinamici booleani a tempi discreti, Thesis for Dipartimento di Scienze dell’Informazione, Milano (1989).
E. Goles, Lyapunov functions associated to automata networks, in Automata networks in computer science by F.F. Souliè et. al. (edrs.), Manchester United Press (1987).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer Science+Business Media New York
About this chapter
Cite this chapter
Cattaneo, G., Nani, R. (1991). Lyapunov Functions for “Attractive” Discrete Time Boolean Dynamical Systems. In: New Trends in Systems Theory. Progress in Systems and Control Theory, vol 7. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0439-8_24
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0439-8_24
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6760-7
Online ISBN: 978-1-4612-0439-8
eBook Packages: Springer Book Archive