Dynamical systems considered as ordering machines (Q1897729)

A new concept of considering dynamical systems as ordering machines is discussed. It is shown that because a dynamical system assigns locally fore-and-after relations to pairs of states one can use these local relations to establish all the topological properties of the system globally. This approach is applied to generalize cell mapping dynamical systems. There is devised a sorting procedure of cell states to yield the global evolution picture of the system. Some remarks linking dyamical systems as ordering machines to the theory of partially ordered sets and the theory of digraphs are made.