<< isdominate Min-Max-Plus And Petrinet ispure >>

Min-Max-Plus And Petrinet >> Min-Max-Plus And Petrinet > ispetrinetbounded

ispetrinetbounded

Test boundedness properties of Petri net

Calling Sequence

bounded = ispetrinetbounded(node_tree)

Parameters

bounded
: Boolean represents existence of Petri net's boundedness properties.
node_tree
: Matrix contains states in all coverability tree's node.

Description

This function is used to test whether Petri net bounded. If all place are bounded then Petri net bounded and this function returns true. If there exist unbounded places then Petri net is not bounded and this function returns false. The input of this function is generated by buildtree.

Examples

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

ispetrinetbounded(nt) // Petri net is unbounded

f = [0 1;0 1;1 0]; // forward incidence

b = [1 0;1 0;0 1]; // backward incidence

x0 = [1;1;0]; // initial state

nt = []; // node_tree

idpt = []; // id_parent_tran

[nt,idpt] = buildtree(f,b,x0,0,0,nt,idpt); // build coverability tree

ispetrinetbounded(nt) // Petri net is bounded

Authors

See Also


Report an issue
<< isdominate Min-Max-Plus And Petrinet ispure >>