http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
On Verification of Marking-Dependent Terminacy for Data-Flow Program Nets
Shingo Yamaguchi,Keisuke Komiya,Qi-Wei Ge,Minoru Tanaka 대한전자공학회 2008 ITC-CSCC :International Technical Conference on Ci Vol.2008 No.7
In this paper, we discuss terminacy at the initial marking for (data-flow) program nets. Ge et al. have proposed an algorithm to verify terminacy at any marking, i.e. structurally terminacy. However, there is no algorithm to verify terminacy at the initial marking. In this paper, we give a necessary and sufficient condition to verify the terminacy. Using this condition, we construct a polynomial time algorithm for a subclass of program nets. We also show that the problem to verify the terminacy for general program nets is undecidable.