Bài toán NP-đầy đủ đối với lưới Petri – suy rộng dưới dạng SM (self-modifying –net) thuộc lớp PSMonce

Tran Tho Chau

Abstract



In this paper we show that the k-bounded problem for self-modifying-nets in PSMonce is NP –complete.


Full Text:

PDF


DOI: https://doi.org/10.15625/1813-9663/4/2/11195 Display counter: Abstract : 41 views. PDF : 29 views.

Journal of Computer Science and Cybernetics ISSN: 1813-9663

Published by Vietnam Academy of Science and Technology