@article{oai:u-fukui.repo.nii.ac.jp:00025328,
 author = {高田, 真樹 and 松本, 忠 and 茂呂, 征一郎 and TAKATA, Maki and MATSUMOTO, Tadashi and MORO, Seiichiro},
 issue = {1},
 journal = {福井大学工学部研究報告},
 month = {Mar},
 note = {One of methods to solve integer programming problems consists in the method which uses groebner bases. An arbitrary solution for a state equation Ax=b(A∈Zmxn,b∈Zmx1) of Petri nets means a firing count vector. Then finding a nonnegative integer solution x∈Znx1+ for Ax=b in Petri nets is one of integer programming problems. In this paper, the method to obtain generators of solutions in Petri nets by using groebner bases is proposed and investigated. moreover, Petri nets have an ill property that the number of minimal support T-invariants increases in exponential when places and transitions are increased. Then, the number of groebner bases and calculation time of groebner bases are measured by using a symbolic computation system or a computer algebra system; Maple 7.},
 pages = {89--96},
 title = {計算機代数システム援用によるグレブナー基底のペトリネットの挙動解析への適用},
 volume = {51},
 year = {2003}
}