Abstract
We propose a finite approximation analysis of one dimensional cellular automata. We regard a configuration as a two-way infinite path of states so that 2LTL formulas can be used to express its properties. We select a finite list of 2LTL formulas and define an abstract cell by a list of truth values corresponding to the formulas. In our method a generation sequence of finite approximate Kripke structures is constructed by using abstract cells. We can analyze a one dimensional cellular automaton by the generation sequence.
