메뉴 건너뛰기




Volumn 335, Issue 5, 1998, Pages 877-895

A method of computing minimum firing time for self-cleaning SWITCH-less program nets

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA PROCESSING; DATA STRUCTURES; FLOWCHARTING; GRAPH THEORY; PARALLEL PROCESSING SYSTEMS;

EID: 0032116480     PISSN: 00160032     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0016-0032(97)00017-3     Document Type: Article
Times cited : (3)

References (11)
  • 1
    • 84937641774 scopus 로고
    • First version of data flow procedure language
    • Springer, New York
    • J. B. Dennis, First version of data flow procedure language. In Lecture Notes in Computer Science 19G, Springer, New York, 1974.
    • (1974) Lecture Notes in Computer Science , vol.19 G
    • Dennis, J.B.1
  • 2
    • 0020923408 scopus 로고
    • The MIT data flow engineering model
    • J. B. Dennis, "The MIT data flow engineering model", Proc. IFIP Congress, Vol. 83, pp. 553-560, 1983.
    • (1983) Proc. IFIP Congress , vol.83 , pp. 553-560
    • Dennis, J.B.1
  • 3
    • 0017458590 scopus 로고
    • A data flow multiprocessor
    • J. Rumbaugh, "A data flow multiprocessor", IEEE Trans. Comput., Vol. c-26(2), pp. 138-146, 1977.
    • (1977) IEEE Trans. Comput. , vol.C-26 , Issue.2 , pp. 138-146
    • Rumbaugh, J.1
  • 4
    • 0022964131 scopus 로고
    • Dataflow machine architecture
    • A. H. Veen, "Dataflow machine architecture", ACM Comput. Surv., Vol. 18(4), pp. 365-396, 1986.
    • (1986) ACM Comput. Surv. , vol.18 , Issue.4 , pp. 365-396
    • Veen, A.H.1
  • 5
    • 0010177460 scopus 로고
    • Dataflow parallel computers
    • T. Yuba, "Dataflow parallel computers", J. Syst. Control Inf. Jpn., Vol. 33(5), pp. 220-229, 1989.
    • (1989) J. Syst. Control Inf. Jpn. , vol.33 , Issue.5 , pp. 220-229
    • Yuba, T.1
  • 6
    • 0041795979 scopus 로고
    • Analysis of parallelism in autonomous execution of data-flow program nets
    • Q. W. Ge, T. Watanabe and K. Onaga, "Analysis of parallelism in autonomous execution of data-flow program nets", Trans. IEICE Jpn., Vol. E74(10), pp. 3008-3017, 1991.
    • (1991) Trans. IEICE Jpn. , vol.E74 , Issue.10 , pp. 3008-3017
    • Ge, Q.W.1    Watanabe, T.2    Onaga, K.3
  • 7
    • 0030163975 scopus 로고    scopus 로고
    • On verification of token self-cleanness of data-flow program nets
    • Q. W. Ge and K. Onaga, "On verification of token self-cleanness of data-flow program nets", Trans. IEICE, Vol. E79(6), pp. 812-817, 1996.
    • (1996) Trans. IEICE , vol.E79 , Issue.6 , pp. 812-817
    • Ge, Q.W.1    Onaga, K.2
  • 8
    • 0042297144 scopus 로고
    • Application of petri nets to the specification phase of communication software development
    • H. Hasegawa, "Application of petri nets to the specification phase of communication software development", Inf. Proc. Soc. Jpn., Vol. 34(6), pp. 770-777, 1993.
    • (1993) Inf. Proc. Soc. Jpn. , vol.34 , Issue.6 , pp. 770-777
    • Hasegawa, H.1
  • 10
    • 0005170248 scopus 로고
    • Topological analysis of firing activities of data-flow program pets
    • Q. W. Ge, T. Watanabe and K. Onaga, "Topological analysis of firing activities of data-flow program pets", Trans. IEICE Jpn., Vol. E73(7), pp. 1215-1224, 1990.
    • (1990) Trans. IEICE Jpn. , vol.E73 , Issue.7 , pp. 1215-1224
    • Ge, Q.W.1    Watanabe, T.2    Onaga, K.3
  • 11
    • 0025798327 scopus 로고
    • Execution termination and computation determinacy of data-flow program nets
    • Q. W. Ge, T. Watanabe and K. Onaga, "Execution termination and computation determinacy of data-flow program nets", J. Franklin Inst., Vol. 328(1), 123-141, 1991.
    • (1991) J. Franklin Inst. , vol.328 , Issue.1 , pp. 123-141
    • Ge, Q.W.1    Watanabe, T.2    Onaga, K.3


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