In this paper a method for analyzing the global properties of generalized cell mappings involving a very large number of cells is presented. The procedure of the algorithm is devised by taking advantages of certain properties of Markov chains. First, the persistent groups representing the motions to which the system will eventually evolve are determined. Then the absorption probabilities of any transient cell into these persistent groups are evaluated. These two sets of information provide us with the global behavior of the system. After describing the method its viability is illustrated by two examples.

This content is only available via PDF.
You do not currently have access to this content.