With the aim of significantly increasing the modeling capability of Petri nets, we suggest that models involve parameters to represent the weights of arcs, or the number of tokens in places. We consider the property of coverability of markings. Two general questions arise: “Is there a parameter value for which the property is satisfied?” and “Does the property hold for all possible values of the parameters?”. We show that these issues are undecidable in the general case. Therefore, we also define subclasses of parameterised networks, depending on whether the parameters are used on places, input or output arcs of transitions. For some subclasses, we prove that certain problems become decidable, making these subclasses more usable in practice.
CITATION STYLE
David, N., Jard, C., Lime, D., & Roux, O. H. (2015). Discrete parameters in Petri nets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9115, pp. 137–156). Springer Verlag. https://doi.org/10.1007/978-3-319-19488-2_7
Mendeley helps you to discover research relevant for your work.