As we pointed out in the previous chapter, several frameworks and constructions relate to SDS, and in the following we present a short overview. This chapter is not intended to be a complete survey — the list of frameworks that we present is not exhaustive, and for the concepts that we discuss we only provide enough of an introduction to allow for a comparison to SDS. Specifically, we discuss cellular automata, random Boolean networks, and finite-state machines. Other frameworks related to SDS that are not discussed here include interacting particle systems [25] and Petri nets [26].


Phase Space Cellular Automaton Boolean Network Interact Particle System Input Tape 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2008

Personalised recommendations