Reachability analyses in Petri nets by Groebner bases

被引：0
|
作者：
Matsumoto, T [1 ]
Takata, M [1 ]
Moro, S [1 ]
机构：
[1] Fukui Univ, Fukui 910, Japan
来源：
SICE 2002: PROCEEDINGS OF THE 41ST SICE ANNUAL CONFERENCE, VOLS 1-5 | 2002年
关键词：
integer programming; Groebrier basis; Buchberger algorithm; Algebraic geometry; Petri net reachability problems; symbolic computation systems;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Finding an non-negative integer solution x is an element of Z(+)(nx1) for Ax=b(Ais an element ofZ(mxn),bis an element ofZ(mx1)) in Petri nets is NP-complete. Being NP-complete, even algorithms with theoretically bad worst case and with average complexity can be useful for a special class of problems, hence deserve investigation. Then a Groebner basis approach to integer programming problems was proposed in 1991 and some symbolic computation systems became to have useful tools for ideals, varieties, and algorithms for algebraic geometry. In this paper, two kinds of examples are given to show how Groebner basis approach is applied to reachability problems in Petri nets.
引用
收藏
页码：841 / 846
页数：6
相关论文
共 50 条
12345