Exact results for deterministic cellular automats traffic models

被引：27

作者：

Fuks, H ^{[1
]}

机构：

[1] Field Inst Res Math Sci, Toronto, ON M5T 3J1, Canada

[2] Univ Guelph, Dept Math & Stat, Guelph, ON N1G 2W1, Canada

来源：

PHYSICAL REVIEW E | 1999年 / 60卷 / 01期

关键词：

D O I：

10.1103/PhysRevE.60.197

中图分类号：

O35 [流体力学]; O53 [等离子体物理学];

学科分类号：

070204 ; 080103 ; 080704 ;

摘要：

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. [S1063-651X(99)07207-4].

引用

页码：197 / 202

页数：6

共 12 条

[1] Cellular automaton rules conserving the number of active sites [J].