메뉴 건너뛰기




Volumn 168, Issue 2, 1996, Pages 367-404

On optimal solutions to the firing squad synchronization problem

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; PROBLEM SOLVING; SYNCHRONIZATION;

EID: 0030289137     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00084-9     Document Type: Article
Times cited : (50)

References (16)
  • 1
    • 0001824412 scopus 로고
    • An 8-state minimal time solution to the firing squad synchronization problem
    • R. Balzer, An 8-state minimal time solution to the firing squad synchronization problem, Inform. and Control 10 (1967) 22-42.
    • (1967) Inform. and Control , vol.10 , pp. 22-42
    • Balzer, R.1
  • 2
    • 0016071612 scopus 로고
    • Synchronization of growing automata
    • G.T. Herman, Synchronization of growing automata, Inform. and Control 25 (1974) 103-122.
    • (1974) Inform. and Control , vol.25 , pp. 103-122
    • Herman, G.T.1
  • 3
    • 0004765428 scopus 로고
    • The firing squad synchronization problem for two dimensional arrays
    • K. Kobayashi, The firing squad synchronization problem for two dimensional arrays, Inform. and Control 34 (1977) 177-194.
    • (1977) Inform. and Control , vol.34 , pp. 177-194
    • Kobayashi, K.1
  • 4
    • 0018151840 scopus 로고
    • The firing squad synchronization problem for a class of polyautomata networks
    • K. Kobayashi, The firing squad synchronization problem for a class of polyautomata networks, J. Comput. System Sci. 17 (1978) 300-318.
    • (1978) J. Comput. System Sci. , vol.17 , pp. 300-318
    • Kobayashi, K.1
  • 5
    • 0023496686 scopus 로고
    • A 6-state minimal time solution to the firing squad synchronization problem
    • J. Mazoyer, A 6-state minimal time solution to the firing squad synchronization problem, Theoret. Comput. Sci. 50 (1987) 183-238.
    • (1987) Theoret. Comput. Sci. , vol.50 , pp. 183-238
    • Mazoyer, J.1
  • 6
    • 0012065278 scopus 로고
    • A minimal time solution to the Firing Squad Synchronization Problem with only one bit of information exchanged
    • Report 89-03
    • J. Mazoyer, A minimal time solution to the Firing Squad Synchronization Problem with only one bit of information exchanged, Research Report LIP-IMAG, Report 89-03, 1989.
    • (1989) Research Report LIP-IMAG
    • Mazoyer, J.1
  • 8
    • 0009752131 scopus 로고
    • Prentice-Hall, Englewood Cliffs, NJ
    • M. Minsky, Finite and Infinite Machines (Prentice-Hall, Englewood Cliffs, NJ, 1967) 28-29 and 282-283.
    • (1967) Finite and Infinite Machines , pp. 28-29
    • Minsky, M.1
  • 10
    • 46949105408 scopus 로고
    • A generalized firing squad problem
    • G.G. Landon and F.R. Moore, A generalized firing squad problem, Inform. and Control 12 (1968) 212-220.
    • (1968) Inform. and Control , vol.12 , pp. 212-220
    • Landon, G.G.1    Moore, F.R.2
  • 11
    • 0004499550 scopus 로고
    • Intellugent graphs: Networks of finite automata capable of solving graph problems
    • R.C. Read ed. Academic Press, New York
    • P. Rosenstiehm, J.R. Fiksel and A. Holliger, Intellugent graphs: networks of finite automata capable of solving graph problems, in: R.C. Read ed., Graph Theory and computing (Academic Press, New York, 1972) 219-265.
    • (1972) Graph Theory and Computing , pp. 219-265
    • Rosenstiehm, P.1    Fiksel, J.R.2    Holliger, A.3
  • 12
    • 0015360148 scopus 로고
    • Real time language recognition by one-dimensional cellular automata
    • A.R. Smith, Real time language recognition by one-dimensional cellular automata, J. A. C. M 6 (1972) 233-235.
    • (1972) J. A. C. M , vol.6 , pp. 233-235
    • Smith, A.R.1
  • 13
    • 0000971666 scopus 로고
    • Time optimal solution of the Firing Squad Synchronization Problem for n-dimensional rectangles with the general at an arbitrary position
    • H. Szwerinski, Time optimal solution of the Firing Squad Synchronization Problem for n-dimensional rectangles with the general at an arbitrary position, Theoret. Comput. Sci. 19 (1982) 305-320.
    • (1982) Theoret. Comput. Sci. , vol.19 , pp. 305-320
    • Szwerinski, H.1
  • 15
    • 0002725637 scopus 로고
    • An optimum solution to the Firing Squad Synchronization Problem
    • A. Waksman, An optimum solution to the Firing Squad Synchronization Problem, Inform. and Control 9 (1966) 66-78.
    • (1966) Inform. and Control , vol.9 , pp. 66-78
    • Waksman, A.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.