Name
Abstract | ||
|---|---|---|
This study focuses the simple protocol in a three-vehicle-merging scenario. First propose an English rule by providing the general assumption and drawing the clear borderline of the system. Then create the Finite State Machines of the vehicles engaged in the merging process. Using probabilistic verification with Stack algorithm, namely Zigangorov-Jelinek algorithm, we test errors state possibilities which offer safe and reliable communication. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/FSKD.2012.6234046 | FSKD |
Keywords | Field | DocType |
finite state machines,protocols,safe merge system,road vehicles,road safety,zigangorov-jelinek algorithm,telecommunication network reliability,three-vehicle-merging scenario,reliable communication,safe communication,stack algorithm,error state possibility testing,safe merge,automated highways,probabilistic verification,english rule,protocol,probabilistic logic,finite state machine,merging,reliability,automata | Computer science,Computer security,Finite-state machine,Artificial intelligence,Probabilistic logic,Telecommunication network reliability,Merge (version control),Computer engineering,Machine learning | Conference |
Volume | Issue | ISBN |
null | null | 978-1-4673-0025-4 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Feng Liu | 1 | 25 | 24.38 |
| Xingquan Gao | 2 | 2 | 1.11 |