Find upper bound
bound = findbound(node_tree)
This function is used to find upper bound of every place in Petri net. If the upper bound is finite then the place is bounded. If the upper bound is infinite then the place is unbounded. The input of this function is node_tree generated by buildtree. The output of this function in a column vector with number of elements equal number of places in Petri net.
f = [1 0 0;0 0 1;0 1 0]; // forward incidence b = [0 1 0;0 1 0;0 0 1]; // backward incidence x0 = [0;1;0]; // initial state nt = []; // node_tree idpt = []; // id_parent_tran [nt,idpt] = buildtree(f,b,x0,0,0,nt,idpt) // build coverability tree findbound(nt) // the first place is unbounded | ![]() | ![]() |