메뉴 건너뛰기




Volumn , Issue , 2005, Pages 111-124

Optimal state assignment of synchronous parallel automata

Author keywords

parallelism; state encoding; synchronous parallel automata

Indexed keywords


EID: 34547273408     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/0-387-28327-7_10     Document Type: Chapter
Times cited : (4)

References (21)
  • 3
    • 84891439960 scopus 로고
    • State assignment for parallel synchronous automata
    • Fisiko-Tehnicheskih Nauk, in Russian
    • L. D. Cheremisinova, State assignment for parallel synchronous automata. Izvestia AN BSSR, Ser. Fisiko-Tehnicheskih Nauk, 1 86-91 (1987) (in Russian).
    • (1987) Izvestia AN BSSR, Ser , vol.1 , pp. 86-91
    • Cheremisinova, L.D.1
  • 6
    • 0003716854 scopus 로고
    • Analysis of production schemata by Petri nets
    • Cambridge
    • M. T. Hack, Analysis of production schemata by Petri nets. Project MAC TR-94, Cambridge (1972).
    • (1972) Project MAC TR-94
    • Hack, M.T.1
  • 7
    • 0003780715 scopus 로고
    • Addison-Wesley Publishing Company, Reading, MA
    • F. Harary, Graph Theory. Addison-Wesley Publishing Company, Reading, MA (1969).
    • (1969) Graph Theory
    • Harary, F.1
  • 10
    • 77949993611 scopus 로고
    • Covering a graph by complete bipartite subgraphs
    • Institute of Engineering Cybernetics of Academy of Sciences of Belarus, Minsk, in Russian
    • Yu. V. Pottosin, Covering a graph by complete bipartite subgraphs. In: Design of Discrete Systems. Institute of Engineering Cybernetics of Academy of Sciences of Belarus, Minsk pp. 72-84 (1989) (in Russian).
    • (1989) Design of Discrete Systems , pp. 72-84
    • Pottosin, Yu.V.1
  • 11
    • 77949946481 scopus 로고
    • Finding maximum complete bipartite subgraphs in a graph
    • Institute of Engineering Cybernetics of Academy of Sciences of Belarus, Minsk, in Russian
    • Yu. V. Pottosin, Finding maximum complete bipartite subgraphs in a graph. In: Automatization of Logical Design of Discrete Systems. Institute of Engineering Cybernetics of Academy of Sciences of Belarus, Minsk pp. 19-27 (1991) (in Russian).
    • (1991) Automatization of Logical Design of Discrete Systems , pp. 19-27
    • Pottosin, Yu.V.1
  • 12
    • 77949977877 scopus 로고
    • A method for encoding the partial states of a parallel automaton with minimal-length codes
    • Allerton Press, Inc., New York
    • Yu. V. Pottosin, A method for encoding the partial states of a parallel automaton with minimal-length codes. In: Automatic Control and Computer Sciences, Vol. 6. Allerton Press, Inc., New York, pp. 45-50 (1995).
    • (1995) Automatic Control and Computer Sciences , vol.6 , pp. 45-50
    • Pottosin, Yu.V.1
  • 13
    • 34547249261 scopus 로고
    • Generating parallel automata
    • Institute of Engineering Cybernetics of Academy of Sciences of Belarus, Minsk, in Russian
    • Yu. V. Pottosin, Generating parallel automata. In: Methods and Algorithms for Logical Design. Institute of Engineering Cybernetics of Academy of Sciences of Belarus, Minsk pp. 132-142 (1995) (in Russian).
    • (1995) Methods and Algorithms for Logical Design , pp. 132-142
    • Pottosin, Yu.V.1
  • 14
    • 84891451470 scopus 로고
    • Research CAD system for discrete control devices
    • Institute of Engineering Cybernetics of Academy of Sciences of Belarus, Minsk, in Russian
    • N. R. Toropov, Research CAD System for Discrete Control Devices: Materials on Software for Computers. Institute of Engineering Cybernetics of Academy of Sciences of Belarus, Minsk (1994) (in Russian).
    • (1994) Materials on Software for Computers
    • Toropov, N.R.1
  • 15
    • 34547353578 scopus 로고
    • Proof of the conjecture of complete reducibility of a-nets
    • Institute of Engineering Cybernetics of Academy of Sciences of BSSR, Minsk, in Russian
    • V. V. Tropashko, Proof of the conjecture of complete reducibility of a-nets. In: Design of Logical Control Systems. Institute of Engineering Cybernetics of Academy of Sciences of BSSR, Minsk pp. 13-21 (1986) (in Russian).
    • (1986) Design of Logical Control Systems , pp. 13-21
    • Tropashko, V.V.1
  • 16
    • 77949938950 scopus 로고
    • Optimal coverage of sets
    • ASM Monograph Series, Academic Press, New York, London
    • A. D. Zakrevskij, Optimal coverage of sets. In: A Programming Language for Logic and Coding Algorithms. ASM Monograph Series, Academic Press, New York, London, pp. 175-192 (1969).
    • (1969) A Programming Language for Logic and Coding Algorithms , pp. 175-192
    • Zakrevskij, A.D.1
  • 18
    • 34547291856 scopus 로고
    • Optimization of matrix of partial state assignment for parallel automata
    • Institute of Engineering Cybernetics, Academy of Sciences of Belarus, Minsk, in Russian
    • A. D. Zakrevskij, Optimization of matrix of partial state assignment for parallel automata. In: Formalization and Automatization of Logic Design. Institute of Engineering Cybernetics, Academy of Sciences of Belarus, Minsk pp. 63-70 (1993) (in Russian).
    • (1993) Formalization and Automatization of Logic Design , pp. 63-70
    • Zakrevskij, A.D.1
  • 19
    • 34547264307 scopus 로고    scopus 로고
    • Parallel logical control algorithms: Verification and hardware implementation
    • A. D. Zakrevskij, Parallel logical control algorithms: verification and hardware implementation. Computer Science Journal of Moldova, 4(1), 3-19, (1996).
    • (1996) Computer Science Journal of Moldova , vol.4 , Issue.1 , pp. 3-19
    • Zakrevskij, A.D.1
  • 20
    • 10844295713 scopus 로고    scopus 로고
    • Institute of Engineering Cybernetics, National Academy of Sciences of Belarus, Minsk, in Russian
    • A. D. Zakrevskij, Parallel Algorithms for Logical Control. Institute of Engineering Cybernetics, National Academy of Sciences of Belarus, Minsk (1999) (in Russian).
    • (1999) Parallel Algorithms for Logical Control
    • Zakrevskij, A.D.1


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