Exact results for deterministic cellular automata traffic models

arXivmath/9904182MaRDI QIDQ6501294FDOQ6501294

Authors: Henryk Fukś 

Abstract: We present a rigorous derivation of the flow at arbitrary time in a deterministic cellular automaton model of traffic flow. The derivation employs regularities in preimages of blocks of zeros, reducing the problem of preimage enumeration to a well known lattice path counting problem. Assuming infinite lattice size and random initial configuration, the flow can be expressed in terms of generalized hypergeometric function. We show that the steady state limit agrees with previously published results.

This page was built for publication: Exact results for deterministic cellular automata traffic models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6501294)