메뉴 건너뛰기




Volumn 36, Issue 5, 2006, Pages 1210-

Comments on "A modified reachability tree approach to analysis of unbounded Petri nets"

Author keywords

Petri nets; Reachability tree

Indexed keywords

ALGORITHM; ARTIFICIAL INTELLIGENCE; ARTIFICIAL NEURAL NETWORK; COMPUTER SIMULATION; MATHEMATICAL COMPUTING; NOTE; THEORETICAL MODEL;

EID: 33749393592     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCSI.2006.876811     Document Type: Note
Times cited : (23)

References (2)
  • 1
    • 0742290028 scopus 로고    scopus 로고
    • "A modified reachability tree approach to analysis of unbounded Petri nets"
    • Feb
    • F.-Y. Wang, Y. Q. Gao, and M. C. Zhou, "A modified reachability tree approach to analysis of unbounded Petri nets," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 34, no. 1, pp. 303-308, Feb. 2004.
    • (2004) IEEE Trans. Syst., Man, Cybern. B, Cybern. , vol.34 , Issue.1 , pp. 303-308
    • Wang, F.-Y.1    Gao, Y.Q.2    Zhou, M.C.3
  • 2
    • 0000223972 scopus 로고
    • "Parallel program schemata"
    • May
    • R. Karp and R. Miller, "Parallel program schemata," J. Comput. Syst. Sci., vol. 3, no. 2, pp. 147-195, May 1969.
    • (1969) J. Comput. Syst. Sci. , vol.3 , Issue.2 , pp. 147-195
    • Karp, R.1    Miller, R.2


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