SOFTWARE ENGINEERING

Detailed explanation-1: -One is the class of trap circuit Petri nets (TC nets), where a Petri net is called a TC net if the set of places on any directed circuit forms a trap, and the other is the class of deadlock circuit Petri nets (DC nets), where a Petri net is called a DC net if the set of places on any directed circuit forms a deadlock.

Detailed explanation-2: -A Petri Net is a graph model for the control behavior of systems exhibiting concurrency in their operation. The graph is bipartite, the two node types being places drawn as circles, and transitions drawn as bars. The arcs of the graph are directed and run from places to transitions or vice versa.

Detailed explanation-3: -Definition. A Petri net with enabling arcs is formally defined as a six-tuple PN1=(P, T, I, O, E, M0), where PN=(P, T, I, O, M0) is a Petri net and E⊆(P×T)→N is the input function that defines weighted enabling arcs from places to transitions.