2004
DOI: 10.1007/978-3-540-30479-1_32
|View full text |Cite
|
Sign up to set email alerts
|

Using de Bruijn Diagrams to Analyze 1d Cellular Automata Traffic Models

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2006
2006
2019
2019

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…Some of them include queuing networks [6,36], Markov models, Cellular Automata [12,38,30,33], DEVS [8,22], software agents [2], object-oriented programming [34] and learning automata [25]. Several other approaches have also been used, from Game Theory [7], Petri Nets [37], up to fluid or electrical flow models equivalent to traffic.…”
Section: Introductionmentioning
confidence: 99%
“…Some of them include queuing networks [6,36], Markov models, Cellular Automata [12,38,30,33], DEVS [8,22], software agents [2], object-oriented programming [34] and learning automata [25]. Several other approaches have also been used, from Game Theory [7], Petri Nets [37], up to fluid or electrical flow models equivalent to traffic.…”
Section: Introductionmentioning
confidence: 99%