Exact results for deterministic cellular automata traffic models

Details Exact results for deterministic cellular automata traffic models Exact results for deterministic cellular automata traffic models

1999-04-12

arxiv.org/abs/math/9904182v1

Mathematics

Dynamical Systems

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Exact results for deterministic cellular automata traffic models does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Exact results for deterministic cellular automata traffic models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exact results for deterministic cellular automata traffic models will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-346378