ABSTRACT
This chapter introduces a formal definition of “Cellular automata” (CA) considering synchronous and asynchronous approaches. A CA is an infinite regular n-dimensional lattice in which each of the cells can take a finite value. States in the lattice are updated according to a local rule in a simultaneous, synchronous way, and cell states change in discrete time steps. The chapter provides an introduction to formal specifications for CA and an introduction to the Cell-Discrete Event systems Specification (DEVS) formalism, which allows defining cell spaces based on DEVS and CA models. In Gabriel A. Wainer and Norbert Giambiasi and Wainer, the Cell-DEVS formalism was presented. Cell-DEVS a combination of DEVS and CA with explicit timing delays. In Cell-DEVS, each cell is defined as an atomic model, and a procedure to couple cells is defined. The Cell-DEVS model C represents a one-way highway that passes between regions A and B.
