In: Proc. IEEE Int. Conf. on Systems, Man, and Cybernetics (SMC'2000), 8-11 October 2000, Nashville, TN, Vol. 4, pages 3153-3158. 2000.
Abstract: The paper presents an algorithm for the computation of enabled transition bindings in high-level petri nets. The algorithm does not depend on either functional or logic language paradigm, but may be implemented in commonly used imperative languages. To achieve this, the paper shows that a high-level Petri net transition, together with its input arcs, input places and place marking, constitutes an extended type of the finite domain constraint satisfaction problem (CSP). Calculation of all transition bindings corresponds to solving such a problem, which is called a resource-value CSP. It is shown how the use of multi-sets in net markings and arc expression of an existing efficient CSP algorithm to enable solution of resource-value CSPs. The new algorithm, FC-CBJ-M, has been used for the simulation and analysis of colored Petri and PrT nets.
Keywords: domain satisfaction problem, high-level Petri nets, transition bindings.