Conjectures about Traffic Light Queues
classification
🧮 math.HO
keywords
blockscarslightsarriveconjecturesdiscretefullygreen
read the original abstract
In discrete time, $\ell$-blocks of red lights are separated by $\ell$-blocks of green lights. Cars arrive at random. The maximum line length of idle cars is fully understood for $\ell = 1$, but only partially for $2 \leq \ell \leq 3$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.