In: Syst. Anal., Modelling Simulation; Vol. 6, No. 7, pages 539-543. 1989.
Abstract: A model of concurrent processes using various codes of programs under resources constraints is presented. The extension algorithm of a given concurrent system in such a way that each strategy of resource allocation guarantees that the extended system is deadlock free is found. The proof of correctness of this algorithm is given.
Keywords: concurrent processes synchronization (using nets); deadlock freeness.
Back to the Petri Nets Bibliography