ABSTRACT
This chapter validates resource preservation net (RPN) using discrete mathematics. The validation is performed through proposing a theorem of soundness and a few lemmas. The model is validated for non-cooperative and cooperative systems”. “Scalability of the framework falls under the soundness and efficiency of the general framework regardless of the number of cooperating RPN added to the system. It is a design quality measure of the framework. The cooperation is studied in two different cases, namely loosely coupled and tightly coupled. A loosely coupled case is when only resources are shared between different RPNs. On the other hand, a tightly coupled case is when resources and customers are shared and can move among the RPNs. Serializability is viewing the system as a sequential system where tokens are executed one after another and the successful execution of one token will not cause the failure of another one.
