http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Computational complexity of state number calculation problem of some bounded classes of Petri net
Atsushi OHTA,Yuki FUKAYA,Kohkichi TSUJI 대한전자공학회 2015 ITC-CSCC :International Technical Conference on Ci Vol.2015 No.6
This paper studies computational complexity of state number decision problem of Petri net. The problem is to decide whether the number of reachable markings of a Petri net is greater than or equal to a given finite integer. It is shown that the problem is PSPACE complete for bounded Petri nets, NP- hard for acyclic free choice workflow nets and weighted state machines.
Electron compound nature in a surface atomic layer of a two-dimensional hexagonal lattice
Matsuda, Iwao,Nakamura, Fumitaka,Kubo, Keisuke,Hirahara, Toru,Yamazaki, Shiro,Choi, Won Hoon,Yeom, Han Woong,Narita, Hisashi,Fukaya, Yuki,Hashimoto, Mie,Kawasuso, Atsuo,Ono, Masanori,Hasegawa, Yukio,H American Physical Society 2010 Physical review. B, Condensed matter and materials Vol.82 No.16