Computation of admissible marking sets in weighted state machines by dynamic programming

In this paper we aim to characterize the admissible marking set in partially controllable Petri nets with weighted arcs. We consider a special subclass of generalized Petri nets called weighted state machines (WSMs) that have state-machine topology with weighted arcs. Such subclass of nets can be used to model systems of practical interest characterized by… CONTINUE READING