A six-state minimal time solution to the Firing squad synchronization problem (Q1097699): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q29300723, #quickstatements; #temporary_batch_1709751086066 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(87)90124-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2108002652 / rank | |||
Normal rank | |||
Revision as of 20:33, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A six-state minimal time solution to the Firing squad synchronization problem |
scientific article |
Statements
A six-state minimal time solution to the Firing squad synchronization problem (English)
0 references
1987
0 references
The firing squad synchronization problem is the problem of synchronization of n finite state automata connected in the structure of a one-dimensional systolic array. The time-optimal solution with eight states was presented by \textit{R. Balzar} [An 8-states minimal time solution to the firing squad synchronization problem, Inf. Control 10, 22-42 (1967)]. Using a new method the author gives a new time-optimal solution with six states only. An open problem remains whether this number can be decreased to 5 (at least five states are necessary).
0 references
one-dimensional cellular structure
0 references
minimization of the number of states
0 references
firing squad synchronization
0 references
finite state automata
0 references
systolic array
0 references
