Discrete Parameters in Petri Nets

摘要: With the aim of significantly increasing modeling capability Petri nets, we suggest that models involve parameters to represent weights arcs, or number tokens in places. We consider property coverability markings. Two general questions arise: “Is there a parameter value for which is satisfied?" and “Does hold all possible values parameters?". show these issues are undecidable case. Therefore, also define subclasses parameterised networks, depending on whether used places, input output arcs transitions. For some subclasses, prove certain problems become decidable, making more usable practice.