Indian cities are seen with predominantly mixed traffic plying on the streets. Modeling involving vehicles characterised of different speed, length, and width is a challenging issue. Based finer cell system cellular automata (CA) models, this paper proposes to evaluate behavior cars motorcycles for intermediate lane width, which more common in cities. The maximum car flow observed (even presenc...

In this paper multilayered cellular automata are formally defined as a generalization of muftilayered automata networks. They are hierarchically organized on the basis of nested graphs, and can show different kinds of dynamics, which allow to use them to model, e.g., complex biological systems comprised of different entities organized in a hierarchical framework. Finally, the simulation of the ...

Cellular automata are considered to be a nice model of complex systems in which an infinite oneor twodimensional array of finite state machines (cells) updates itself in synchronous manner according to a uniform local rule. In this project report, we give an overview of our project. We have proposed a large number of algorithms for a variety of cellular automata. We focus our attention to the s...

In order to design a reasonable pedestrian evacuation and exclude the security risks in large stadiums, this thesis proposes the research of security model of evacuation in stadiums combined with multi-agent and cellular automata. The research is based on cellular automata model and the process makes extended analysis to the cell’s behavior of autologous, and then it makes simulation experiment...

In order to obtain universal classical cellular automata an in nite space is required. Therefore, the number of required processors depends on the length of input data and, additionally, may increase during the computation. On the other hand, Turing machines are universal devices which have one processor only and additionally an in nite storage tape. Here an in some sense intermediate model is ...

We present cellular automata on appropriate digraphs and show that any covered normal logic program is a cellular automaton. Seeing programs a.s cellular automata. shifts attention from classes of Herbrand models to orbits of Herbra.nd interpretations. Orbits capture both the declarative, model-theoretic meaning of programs a.s well a.s their inferential behavior. Logically and intentionally di...