# Healthcare Operation Improvement Based on Simulation of Cooperative Resource Preservation Nets for None-Consumable Resources

Authors: Soraia Oueida; Yehia Kotb; Seifedine Kadry; Sorin Ionescu
Journal: Complexity
 (2018)

---

## Abstract

Healthcare systems are growing very fast, especially emergency departments (EDs) which constitute the major bottleneck of these complex concurrent systems. Emergency departments, where patients arrive without any prior notice, are considered real-time complex dynamic systems. Enhancing these systems requires tailored modeling techniques and a process optimization approach. A new mathematical approach is proposed in order to help multiple emergency units cooperate and share none-consumable resources to achieve the required flow. To achieve the cooperation, the process is modeled by a new subclass of Petri nets. The new Petri net model was proposed in a previous work and is used in this study in order to tackle the problem of modeling and managing these emergency units. The proposed Petri net is named Resource Preservation Net (RPN). Few theorems and lemmas are proposed to support the proposed Petri net model and to prove the correctness of cooperation and resource sharing. In this contribution, a model of cooperative healthcare units is proposed to achieve sound resource sharing and collaboration. The objective function of the proposed model is to improve the key performance indicators: patients length of stay (LoS), resource utilization rates, and patients waiting time. The cooperation among multiple EDs is then proposed through the study of merging two or more units. The cooperative and noncooperative behavior are also studied through theorems of soundness, separability and serializability, and a proof of scalability.


---

## Body

## 1. Introduction

Complexity, concurrency, and unpredictability of events in majority of industrial systems impose on decision makers the need to study the system and analyze the processes to always find room for improvements. Industrial systems usually face a main problem: resources shortage [1]. Effective allocation of resources is a must to maintain a dynamic controlled flow of operations [2]. In this study, a new model is proposed in order to effectively control the workflow processes and maintain synchronization among activities [3]. Tasks and dependencies are modeled in Petri net by transitions, and places/arcs, respectively [4]. Using Petri net modeling with healthcare helps to control and overcome the problem of complexity. Here, two main characteristics of Petri net workflows can be highlighted: Safety and Soundness. Ensuring the soundness of the model will definitely ensure the liveness, reachability, and efficiency of the model proposed. Moreover, model soundness guarantees a system with critical sections free and ensures framework serializability and separability. Critical sections are referred to as some tasks impossible to be executed by more than one activity at a time. A framework that handles critical sections was suggested by Baldwinet al. [5].The healthcare system under study in this paper is the emergency department (ED) [6] of a general hospital located in Lebanon. The hospital is recognized since 1952. The hospital’s ED consists of two emergency rooms, named in this study ER A and ER B, connected through an underground tunnel. The ED serves more than 40,000 patients annually and is open for 24/7. The main performance measures relied on during this study are patient length of stay (LoS) and queues waiting time. These metrics are considered the main problems tackling emergency departments nowadays [7]. High waiting times may lead to overcrowding and thus affects the daily operations of the ED and may result in patient dissatisfaction [3]. A possible solution to these problems is increasing the resource capacity. Nevertheless, adding extra resources is not always possible due to budget constraints and management limitation in providing extra facilities [8]. Problems facing ED systems have been the main subject in literature when it comes to healthcare management. Improving ED processes is the key to patient satisfaction always taking into consideration the cost/revenue [9]. Computer simulation was proven to be the best way to present effectively the flow in a real-time system without any interruption of the daily operations. The power of Petri net is about the fact that it merges the mathematical modeling and the simulation of processes, which means that the system can be analyzed and enhancement can be suggested [5]. To alleviate the overcrowding problem and prevent bottleneck, waiting times and patient LoS should be reduced. Also, a better resource allocation of available resources may reduce waste and undesirable cost [10]. In this study, several processes of the chosen ED are simulated such as registration, triage, examination, radiology, and billing, in order to suggest improvement scenarios. This study is organized as follows: An introduction is presented in Section 1. Petri net and application to healthcare are discussed in Section 2. In Section 3, a new Petri net framework is proposed. In Section 4, the new system is validated through a mathematical model. Framework scalability is presented in Section 5. In Section 6, framework separability and serializability are presented. An application of the new framework to healthcare is illustrated in Section 7. Simulation results are discussed in Section 8. Finally, conclusion and future work are presented in Section 9.


## 2. Literature Review on Petri Nets

Petri net is a mathematical modeling language used to describe the concurrent behavior as well as the functional structure of systems. Being flexible and simple to use, Petri net is proven to be very efficient when modeling and analyzing discrete complex systems such as healthcare. With Petri nets, the dynamic behavior of each process can be illustrated and visualized without interrupting the real-life system. Events’ dependencies can be evaluated and easily modeled. A framework designed using Petri nets can be easily verified and validated based on the main characteristics: boundedness, reproducibility, liveness, reachability or nonreachability, invariants, and deadlocks. Systems and processes are described using places and transitions. Places are represented in the model with circles. Transitions are represented in the model with rectangles. A transition can be connected to one or more places and one place can be connected to one or more transitions. Arcs are used to connect different nodes. In this paper, tokens resemble the resources and patients in medical emergency units and are represented in the model by solid circles residing inside the places. A transition, t, can be enabled if and only if no empty places are connected to this transition as inputs; we say that the transition is fired. After being fired, new tokens are generated in each of the output places and all tokens are removed from each of the input places.Business processes can be enhanced using simulation, where the real system continues its normal flow of operation without any real interruption in its activities. The system is redesigned and represented by a model to describe all its processes. Emergency departments being complex and concurrent systems rely on simulation in order to improve its operation. Accordingly, Petri nets were proven to be one of the efficient approaches used in order to optimize this type of systems [11]. Jansen and Reijers [12] used colored Petri nets in order to model a mental healthcare institute. Service time and flow time were reduced as part of system improvement. As per the literature, overcrowding of emergency departments is the major problem facing healthcare systems which imposes the need to optimize its flow of work and resource capacity levels. Another ED in Italy was modeled by Dotoliet al. [13] where a PN workflow model was designed in order to improve the structure and dynamics of the system [14]. The authors approached a management technique for optimizing patient flow and proposing new resource dimensions. Mahuleaet al. [15] proved in their work the efficiency of Petri net workflows in modeling and analyzing healthcare systems [16]. In their study, they suggested a new methodology using Petri nets for resource allocation where different resources are assigned based on the type of the activity required. Another study addressing healthcare problems using Petri nets was proposed by Augusto and Xie [17]. Early patients discharge and introducing home care option was suggested by Fantiet al. [18] as another alternative procedure for overcoming the problem of ED overcrowding. Darabi et al. presented a study on resource modeling for a hospital in Chicago. The resources consist of human and nonhuman resources and the study is based on Petri [19] net concepts where these resources are modeled and simulated can be performed [20]. Another research was approached by Chen et al., using Petri net in order to support resource assignment in project management [21]. Several previous studies were performed using Petri net modeling and simulation in order to study system flow and control resource allocation ([22–27]).


## 3. New Proposed Petri Net Framework

In a previous work, a new type of Petri net model is proposed [28]. This new model is useful for systems with none-consumable resources and named Resource Preservation Net (RPN for short). Resources flowing into the system are preserved. Resources are referred to the human resources providing care to arriving patients. Resources return to their corresponding pools when a task is accomplished. This RPN can be applied to any queuing system such as healthcare, restaurants, banks, etc. Some previous works also used extended Petri nets and subclasses of Petri nets in order to model project management with resource sharing ([21, 29–31]). All these nets are capable of modeling resource sharing but do not tackle the problems stated here in the RPN. In this RPN, each resource returns to its pool after serving a certain activity, resources are not consumable and siphons are guaranteed to be always controlled. Moreover, this RPN is a project of an under process prototype platform that will allow the simulation of any complex industrial system such an emergency department and tackle the problems arising by performing optimization and providing all parties satisfaction. In Section 4, a mathematical model is suggested and presented in order to validate and better describe these systems. RPN is a subclass version of the general PN existing in the literature with some changes that depict the resource aware structure. This proposed RPN is applied to a real-life problem in Section 7 in order to model and optimize an ED in Lebanon. A comparison between the general Petri net (PN) and the proposed valid RPN is presented in Figures 1(a), 1(b), and 1(c).Figure 1
A comparison betweenRPN architecture (left hand side) and regular Petri net (right hand side).
(a) (b) (c)In Figure1(a), as seen in the RPN(left hand side), for every place type in the set of input places of a certain transition, that type has to exist as an output place. The number of input places and output places does not have to be the same, it is the existence of place types that has to match one to one between input set and output set. Figure 1(a), the general PN(right hand side), does not have such constraint which means that certain types might be suppressed during transition execution. Figure 1(b) shows the property of resource preservation. In the left hand side, the RPN preserves the resource; in other words, the number of input tokens is equal to the number of output tokens, whereas in the right hand side, tokens could be consumed as a general PN. In Figure 1(c), the left hand side shows the RPN with the property of controlling siphons which is a basic property that has to be satisfied in any RPN. The right hand side of Figure 1(c) shows a general PN where siphons do not have to be controlled.


## 4. Mathematical Model and System Validation

The proposed Petri net model,RPN, is validated using discrete mathematics. The validation is performed through proposing a theorem of soundness and few lemmas. The model is validated for noncooperative systems [32] where only one unit is included in a certain organization.


### 4.1. Model Definition

AnRPN is a uncouple that is defined as(1)RPN=Pp,P,T,R,λ,Λ,F,i,o,M,ΘPp,Rwhere (i)
Pp is the pool of preserved resources;(ii)
P is the set of places;(iii)
T is the set of transitions;(iv)
λ is the set of request for service;(v)
Λ is the set of capabilities;(vi)
Θ(Pp,R) is the mapping function that assigns resources to pools;(vii)
R is the set of resources;(viii)
F=Pp×T∪T×Pp∪P×T∪T×P which is the topology of the workflow. Note that the places here are classified into regular places and pools. Pools are places that have the initial marking of resources and all pools are controlled siphons. Siphons are places that, if not properly controlled, once they loose their markings they might not be marked again;(ix)
M is the marking of the RPN;(x)
i is the input place of the RPN;(xi)
o is the output place of the RPN.A transition can be fired only if the required number of tokens at the input place is met. Different types of resources are defined in the system, each responsible for a certain task in order to accomplish the activity. A Petri net isRPN if and only if the two conditions below are met:(1)
∀Θ(Pj)Pj∈•Ts,∃PkPk∈Ts• and Θ(Pj)=Θ(Pk). In other words, the first condition implies that, for every type of place such that this place is the input to a transition T, another place exists which is the output to this transition and where each type of places at the input is equal to the corresponding type of places at the output. This is because the resources should always return to their pools once the activity is accomplished, where Ts is any transition belonging to the set of transitions T.(2)
∀Pj∈•Ts, ∑k=1nak∈Pj where ak represents the token in a place. In other words, for every place that belongs to the input of a transition T, the sum of tokens a that are in this particular place and required to fire this transition will be equal to the sum of tokens that are generated in the output place of this transition after T is fired.0 ≤ j ≤ P and 0≤s≤T.Then, afterT is fired,(2)∑k=1nak=∑j=1maj∥aj∈T•andak∈•TThis means that the tokens are not consumable and at the end of the model all the input tokens will exit the system.


### 4.2.RPN as a None-Cooperative System

In this section a theorem is proposed in order to proof that theRPN is sound and is called the theorem of soundness. This RPN consists of one unit and is proved for now to be sound operating separately from any other unit in the system or vice versa. For a workflow to be sound, all input tokens to this workflow will eventually reach the output. In other words, there exist a minimum number of transitions that are live to guarantee that all tokens will reach the output. Therefore, the output is reachable from the input. Van der Aalst et al. provided in 2010 an overview of the different notions of soundness [33]. The proof will be done in both ways and will be presented as part (a), the result of assuming that RPN is sound, and part (b), proving that RPN is sound assuming a certain flow of costumers in the model.Theorem 1.
R P N is sound if and only if (1)
∀Pp×T≠∅,∃T×Pp≠∅,∃i∈P•i=∅,∃o∈Po•=∅,M(i)τ1≡M(o)τ2, where τ2≥τ1(2)
∑j=1nMPjPj≡•Ts=∑k=1mMPkPk≡Ts•(3)
∀Pj,Pj∈Pp,∃τ,Tτ∥Mτ(Pj)=M0(Pj) and Pj∈Tτ• and •Tτ∈Pj(4)
Λ⊆T
where(i)
Pj∈{P};(ii)
M(Pj) is the marking of a certain place P with index j;(iii)
•i is the set of input transitions to place i;(iv)
o• is the set of output transitions from place o;(v)
n is the total number of input tokens to a transition;(vi)
m is the total number of output tokens to a transition;(vii)
Tj∈{T};(viii)
τ≥0;(ix)
Mτ(Pj) is the marking of a certain place at time τ;(x)
M0(Pj) is the marking of a certain place at initial time.It is worth noting that pools are considered as siphons and therefore they have to be properly controlled. In other words, the marking of pools at the input transition should be equal to the marking of pools at the output transition. Resources should return to their pools after accomplishing a service. Moreover, customers entering the system should leave the system after receiving the required service. When a customer requests a service from the set of requests,λ, the resource responsible to accomplish this task should be able and have the capabilities to serve this customer. These capabilities are referred to as a set Λ.R P N is assumed to be sound if and only if the 4 set of equations from Theorem 1 are met. The first equation identifies the correct topology of the RPN. Transitions that are consuming tokens from resource pools have to end up producing the same tokens into same pools. This is the way we ensure that siphons are controlled. RPN is sound if for every existing connection between the place Pp and a transition T; there exist another connection between that specific T and that same place, where Pp is the set of pools. Therefore, ∀Pp×T≠∅,∃T×Pp≠∅. Also, the first place in the workflow noted by the input i and the last place noted by the output o have no connected places where •i means a transition connected to the input of i and o• means a transition connected to the output of o. Therefore, ∃i∈P∥•i=∅ and ∃o∈P∥o•=∅. Since the RPN is sound, then the marking of the inputs should be equal to the marking of the output in order to ensure a stable flow of customers in the system, where the marking is the number of needed tokens in order to fire a certain transition T that will be then executed. This means that each customer entering the system has to leave it after a certain period of time when all the needed care is attained. Therefore, M(i)≡M(o).In the second condition of the theorem, the total sum of markings of a certain placePj should be equal to the total sum of markings of another place Pk, where Pj is the input place of a certain transition Ts and Pk is the output place to this transition in order to ensure the soundness of the workflow RPN. This states that the preserved resources denoted by Pj, Pk are not consumable and should return to their corresponding pools once the transition is executed. Therefore, (3)∑j=1nMPjPj≡•Ts=∑k=1mMPkPk≡Ts•R P N is guaranteed to be sound if siphons are controlled as per the third condition of the theorem, where siphons are a set of places P such that any token taken out from the siphon must return back to that siphon. So, if siphons are not properly controlled, they might lose their marking and therefore affect the soundness of the system [34]. So for every place Pj that belongs to the pool of resources Pp, a time τ exists where these resources return to their corresponding pools, which means that the marking of this Pj at that time τ is equal to the initial marking of that place Pj. It is worth noting here that a resource can move along with the customers through many consecutive transitions, if needed, in order to accomplish a certain task and then go back to its pool when all the needed care is already given. Therefore, ∀Pj,Pj∈Pp,∃τ,Tτ∥Mτ(Pj)=M0(Pj) and Pj∈Tτ• and •Tτ∈Pj.Finally, condition 4 guarantees that each resource serving a particular customer in order to execute a certain transition should have the capability to handle and serve this customer; otherwise that customer will be lost in the system and will not follow a certain flow in order to reach the output, where the set of capabilities neededΛ should belong to that transition T that is being executed. Therefore, Λ⊆T.To conclude, Theorem1 guarantees that, for a sound RPN,(1)
the system is structurally valid;(2)
resources are not consumable;(3)
siphons are controlled;(4)
resources have the capability to serve customers.Proof (proof of Theorem1: Part A).
SinceRPN is sound, then (1)
o∈i, therefore,(2)
∀Tj∈T,Tj∈i, therefore,(3)
∃Pp×T≠∅ and M(Pp)t1=M(Pp)t2 where t2≥t1, therefore,(4)
since∃Pp×T≠∅ then, ∃T×Pp≠∅, therefore,(5)
∀Mt∈[M(i)〉, where t>0, therefore,(6)
∃τ∥Mτ=M(o) for t>τ, where τ is the time taken from input to output, therefore,(7)
∀M∈M(i),M∈M(o), then M(o)=M(i) where
(i)
M(i)=M-M(Pp)(ii)
M(i) is the input marking of the workflow (customer)(iii)
M(Pp) is the marking of the pools (resources). These pools are siphons(iv)
M(o) is the output marking(v)
M is the total markingSince RPN is a sound workflow therefore by the definition of the workflow,(8)
∃i∈P∥•i=∅ and ∃o∈P∥o•=∅SinceM(o)=M(i), therefore,(9)
∀T∈Mτ-1(•T)=Mτ(T•), where transition T fires out on time τ and •T=T•=Pp, therefore,(10)
∑j=1n(Pj)Pj=•T≡∑k=1mPkPk=T•, therefore,(11)
∀Pj,Pj∈Pp,∃τ,Tj∥Mτ(Pj)=Mo and Pj∈Tτ• and •Tτ∈Pj,(12)
SinceRPN is sound and since ∀M(o)∈[M(i)〉, therefore,(13)
∀λ∈Λ,∃Tj∈T∥Tj≡λ,Λ⊆T
In other words, sinceRPN is assumed to be sound then, the output is reachable from the input (o∈i) and therefore for every transition Tj that belongs to the set of transitions T, this specific transition Tj belongs also to the reachability of the input i (∀Tj∈T,Tj∈i) and thus a connection between a specific place Pp and a transition T exists and the marking of this place at a time t1 is equal to the marking of this place at a time t2 (∃Pp×T≠∅ and M(Pp)t1=M(Pp)t2), where t1 and t2 are two different times during the flow of customers in the system. Then, also a connection from this transition T to the place Pp exists (∃Pp×T≠∅ then, ∃T×Pp≠∅). This describes the topology of the net, specifically, the connections between siphons (Pp), and the set of transitions (T). We can then say that, for every marking at time t that belongs to the reachability marking of the input i (∀Mt∈Mi), the marking at time t is equal to the marking of the output, where τ is the total time from input to output (∃τ∥Mτ=M(o)). Therefore, the marking of arriving customers M(i) is equal to the marking of the output M(o) since the customer is reaching the output (∀M∈M(i),M∈M(o), then M(o)=M(i)). This means that the RPN is structurally stable.∃ i ∈ P ∥ • i = ∅ and ∃o∈P∥o•=∅): this equation describes the behavior of the input and output places of a sound workflow. This means that for any workflow, the input place is not preceded by any node and the output place is not followed by any node (∀T∈Mτ-1(•T)=Mτ(T•)): this equation states that the marking of the input of a transition T at a time τ-1 is equal to the marking of the output of the transition T at a time τ after this transition is being executed. Here, we are controlling the siphons; that means every resource that is entering a transition to fire it and execute it should also leave this transition after a certain time. Therefore, the resources are not consumable and should return to their corresponding pools where the total sum of marking of a specific place Pj belonging to this pool and connected to the input of the transition T is equal to the total marking of place Pk that is connected to the output of the transition T. Here we can reach the conclusion that for every Pj belonging to the pool of resources Pp, the marking of place Pj at a certain time τ is equal to the output marking of Pj, where Pj is connected to the input of the transition Tj at time τ and also connected to the output of the transition Tτ at time τ (∀Pj,Pj∈Pp,∃τ,Tj∥Mτ(Pj)=Mo and Pj∈Tτ• and •Tτ∈Pj). Therefore, siphons are being controlled.SinceRPN is sound and all customers entering the system reach the output and leave the system (∀M(o)∈Mi); therefore, for every set of requests λ that belongs to a pool of capabilities, a transition Tj exists that belongs to the set of transitions to be executed to accomplish a certain flow of the customer in the system, such that this Tj is equal to λ since the transition to be executed needs a resource that has the required capabilities. Therefore, the set of capabilities Λ belongs to the set of transitions; otherwise the customer cannot flow to the output and reach the end of the workflow net ( ∀λ∈Λ,∃Tj∈T∥Tj≡λ,Λ⊆T).Proof (proof of Theorem1: Part B).
(1)
If∃Pp×T≠∅,∃T×Pp≠∅ and ∃i∈P•i=∅,∃o∈Po•=∅, and M(i)≡M(o) therefore, (2)
∀ P j ,   P j ∈ P p ,   ∃ τ ∥ M τ ( P j ) = M 0 ( P j ) and Pj∈Tτ and Tτ∈Pj Since∀Pj,Pj∈Pp,∃τ,T∥Mτ(Pj)=M0(Pj) and Pj∈Tτ and Tτ∈Pj, therefore, (3)
∑ j = 1 n M P j P j ≡ • T = ∑ k = 1 m M P k P k ≡ T • Since∑j=1nMPjPj≡•T=∑k=1mMPkPk≡T• and ∀Pj,Pj∈Pp,∃τ,T∥Mτ(Pj)=Mo(Pj) and Pj∈Tτ and Tτ∈Pj, therefore, (4)
∀ a ∥ a ∈ M 0 ( i ) , a ∈ M t ( o )
wheret≥0 and M0(i) is the marking of the input at time 0 and Mt(o) is the marking of the output at time t. Therefore, RPN is sound.In other words, theRPN is proven to be sound if the 4 characteristics of Theorem 1 are satisfied. If the workflow is structurally valid, which means there exist a connection between the set of places Pp and the set of transition T and no nodes are preceding the input of the workflow and no nodes are following the output, plus the marking of the input is equal to the marking of the output (∃Pp×T≠∅,∃T×Pp≠∅ and ∃i∈P•i=∅,∃o∈Po•=∅, and M(i)≡M(o)); therefore, for every place Pj that belongs to the set of places Pp, there exist a transition T at a time τ where the marking of the place Pj at time τ is equal to the initial marking of Pj and Pj belongs to the reachability of T and T belongs to the reachability of Pj at time τ (∀Pj,Pj∈Pp,∃τ∥Mτ(Pj)=M0(Pj) and Pj∈Tτ and Tτ∈Pj); this means the workflow resources which belong to the set of places Pp are not consumable and they return to their corresponding pools after serving a certain transition T (∑j=1n(M(Pj))Pj≡•T=Σk=1m(M(Pk))Pk≡T•). Since the resources return to their corresponding pools, this means siphons are controllable, where for every token a, such that a belongs to the initial marking of the input, a belongs as well to the marking of the output at a time t, where t is the time taken for the customer to move from input to output (∀a∥a∈M0(i),a∈Mt(o)). Combining all these characteristics will ensure that tokens will eventually reach the output and therefore RPN is sound.To conclude Theorem1, four lemmas are proposed below and they are based on previous proofs of the theorem.Lemma 2 (for Theorem1).
For everyRPN such that RPN is sound, this RPN is structurally valid.Proof (proof of Lemma2).
∀   R P N ∥ R P N is sound, ∃Pp×T≠∅ and ∃T×Pp≠∅∥Pp,T∈{RPN} and ∃i∈P∥•i=∅ and ∃o∈P∥o•=∅, therefore, M(i)≡M(o).
In this proof we start with mentioning the characteristics of the net. The first two equations∃Pp×T≠∅ and ∃T×Pp≠∅ describe the topology of the net and how the siphons are connected to the transitions. The equations show that if a pool is an input to a set of transitions, this set of transitions will bring tokens back to the same pool. This way the siphon is controlled. For the equations, ∃i∈P∥•i=∅ and ∃o∈P∥o•=∅, they describe the basic feature of a workflow; that is, there is one place that is considered as an input and it is not preceded by any other node and there is one output place that is not followed by any other node. Therefore, the tokens that are injected to the input will eventually end up being in the output (M(i)≡M(o)).Lemma 3 (for Theorem1).
For everyRPN such that RPN is sound, the resources are not consumable and return to their corresponding pools. A resource can move with a customer into different consecutive stages, if needed, before returning to its pool.Proof (proof of Lemma3).
∀ R P N ∥ R P N is sound, ∃Pj≡•T and ∃Pk≡T•∥∑j=1n(M(Pj))=Σk=1m(M(Pk)). Then, ΣM0(P)=ΣMτ(P). Therefore, resources are not consumable.
The equation∃Pj≡•T and ∃Pk≡T• shows again the topology of the net where siphons are reachable from the sequence of transitions that consume from those siphons. For any transition, the number of input tokens equals the number of output tokens (Σj=1nM(Pj)=Σk=1mM(Pk)). Therefore, the sum of all markings in the net will not change by time and therefore there is no consumable resources (Σ(M0(P))=Σ(Mτ(P))).Lemma 4 (for Theorem1).
For everyRPN such that RPN is sound, the siphons are controllable.Proof (proof of Lemma4).
∀ R P N ∥ R P N is sound, Pj∈Pp, ∃τ, T∥M0(Pj)=Mτ(Pj) and Pj∈Tτ• and •Tτ∈Pj.
SinceRPN is sound then the initial marking of a place Pj is equal to the marking of that place at a certain time τ after the resource has moved into the required stages in order to accomplish a required service (M0(Pj)=Mτ(Pj)). Therefore, the place Pj is reachable from the output of transition T and the transition T is reachable from that place Pj (Pj∈Tτ• and •Tτ∈Pj). Then, all siphons are controllable.Lemma 5 (for Theorem1).
For everyRPN such that RPN is sound, the system’s resources have the capability to serve a certain customer and to execute a certain transition.Proof (proof of Lemma5).
HavingΛ to be the set of capabilities of resources, ∀λ∈Λ,∃Tj∈T∥λ≡Tj. Therefore, ∀RPN∥RPN is sound, ∃Λ⊆T∥T∈RPN.
In this proof, the equations describe the mapping between resource capabilities and transitions that belong to the workflow. In other words, for the transition to fire certain resource capabilities have to be available.


### 4.3. RPN as a Cooperative System

The theorems suggested here are to prove the soundness of the system including the cooperation between the twoRPNA and RPNB. RPNA refers to the RPN of UNIT A and RPNB refers to the RPN of UNIT B. The main reason of cooperation between the two RPNs is the blockage at one UNIT and therefore the need for sharing resources. RPNA can share resources (staff or customer) with RPNB if needed and vice versa. This can result in guaranteeing a load balance between the two RPNs of an organization and covering RPN that is not able to accomplish a task. The theorem will be proved based on the suggestion that each RPN, separately, is already sound. The only limitation here is that the resources being shared, if any, should be capable of serving this task coverage needed. The cooperative system is defined as follows:R P N c = <Stages, Resources, Patients> (4)RPNc=RPNA⊗RPNBwhere the operator ⊗ is used to represent the cooperation framework. This operator joins two cooperative sound frameworks RPNA and RPNB leading to a collective framework as a result and which will be proven to be sound as well. The resources, being shared, are defined as the set of pools: Pp={Pp1,Pp2,…,Ppn}.We have two cases here, either sharing only staff resources (see Theorem6) or sharing staff resources and customers along with other units; such as radiology, billing, etc. (see Theorem 7).The following theorems demonstrate the soundness of the cooperative framework. We assume that all resources are defined and initially, resources are not shared. Mathematically,RPNA∪RPNB⊆ Resources and RPNA∩RPNB={∅}.We study the cooperation in two different cases, namely, loosely coupled and tightly coupled. Loosely coupled case is when we only share resources between differentRPNs. On the other hand, tightly coupled case is when we share resources and customers can move among RPNs.Theorem6 is described by the following, where RPNA and RPNB share only resources.Theorem 6.
R P N c = RPNA⊗RPNB is sound if (1)
RPNA is a sound RPN,(2)
RPNB is a sound RPN,(3)
∀Ppj∈PpA,Ppj∈PpB and ∀Ppk∈PpB,Ppk∈PpA,(4)
∀Ppj∈PpA,PPj∈•TB and Ppj∈TB•,(5)
∀Ppk∈PpB,Ppk∈•TA and Ppk∈TA•,(6)
∃τ where Mτ(PpA)=M0(PpA) and Mτ(PpB)=M0(PpB),(7)
∃ΛA,ΛA∈TA|ΛA⊆TB and ∃ΛB,ΛB∈TB|ΛB⊆TA.Proof (proof of loosely coupled case).
SinceRPNA is sound and RPNB is sound as proved in Theorem 1, therefore, Mτ(PpA)=M0(PpA) and Mτ(PpB)=M0(PpB). Since ∀Ppj∈PpA,Ppj∈PpB and ∀Ppk∈PpB,Ppk∈PpA, therefore Ppj∈PpB and Ppk∈PpA. Since TB∈PpA and TA∈PpB, therefore, Ppj∈TA and Ppk∈TB. From Theorem 1, PpA∈TA and PpB∈TB, therefore the cooperative framework is sound.
In other words, this theorem shows the life cycle of the resource from the minute it is sent to a differentRPN until it goes back to its initial RPN. The resource leaves the pool to join transitions in a different RPN. Since the RPN in the destination is also sound, it will end up being assigned to its resource pools, which in turn will direct the token to its initial RPN that will put that resource into its initial pool.Theorem7 is described by the following where RPNA and RPNB share resources and customers.Theorem 7.
R P N c = RPNA⊗RPNB is sound tightly coupled if: (1)
∃RPNA and RPNB|RPNA is sound and RPNB is sound and RPNA⊗RPNB is sound and loosely coupled.(2)
∃TA×PB∪PA×TB|∀aA∈RPNA,aA∈RPNB and ∀aB∈RPNB,aB∈RPNA.Proof (proof of tightly coupled case).
(1)
since∃RPNc= RPNA⊗RPNB|RPNc is sound loosely coupled from Theorem 6. Therefore, all siphons are controlled. (2)
since∃TA×PB∪TB×PA therefore, a∈M(PA∪PB). (3)
sincePA∈PB therefore, aA∈ output of RPNA and aB∈ output of RPNB therefore, RPNc is a sound tightly coupled framework.
In other words, the framework is proven from Theorem6 to be a sound loosely coupled framework. In this theorem we prove that it is also a sound tightly coupled framework, where for every patient a that will transfer from one ER to another, this patient will return back to the original department to finalize the process and exit the system. aA refers to a patient that starts in RPNA and aB refers to a patient that starts in RPNB.As a conclusion for Theorems6 and 7, in the loosely coupled case, all pools are shared between the two RPNs. As for the tightly coupled case, all pools and patients are shared.Lemma 8 (for Theorem6).
For every cooperative systemRPNc, if this workflow is sound then, each contained workflow RPNA and RPNB are also sound.
∀ R P N c = RPNA⊗RPNB, if RPNc is sound then RPNA is sound and RPNB is sound.Proof (proof of Lemma8).
IfRPNc is sound therefore, (1)
Mτ(RPNc)≡M0(RPNc) therefore,(2)
∀Ppj∈PpA and ∀Ppk∈PpB,Ppj∈•TB and Ppj∈TA• and Ppk∈•TA and Ppk∈TB• therefore,(3)
∑i=1nMτ(RPNA)≡∑j=1mM0(RPNA) and ∑i=1nMτ(RPNB)≡∑j=1mM0(RPNB)(4)
M0(iA)=Mτ(oA) and M0(iB)=Mτ(oB) where M0(i) is the marking of the input at initial time and Mτ(o) is the marking of the output at time τ. therefore, RPNA is sound and RPNB is sound.
In other words, if the cooperative systemRPNc is sound then, exists a time τ where the marking of this workflow is equal to the initial marking. Therefore, since resources are being shared between RPNA and RPNB, then, for every resource Ppj belonging to the pool of resources of RPNA, noted here PpA, this resource belongs to the input of the transition TB serving RPNB and to the output of the transition TA since the resource should return to its original RPNA. Also, for every resource Ppk belonging to the pool of resources of RPNB, noted here PpB, this resource belongs to the input of the transition TA serving RPNA and to the output of the transition TB since the resource should also return to its original RPNB. Therefore, the sum of markings at a time τ of RPNA is equal to the initial marking of RPNA and the sum of markings at a time τ of all resources in RPNB is equal to the initial marking of RPNB. Also, the initial marking of the input place of RPNA will be equal to the marking of the output place of RPNA at a certain time τ and the initial marking of the input place of RPNB will be equal to the marking of the output place of RPNB at a certain time τ.This means that all resources in a certainRPNA or RPNB are reaching the output from the corresponding input. Therefore, RPNA is sound and RPNB is sound.Lemma 9 (for Theorem6).
∀ sound tightly coupled RPN, ∃RPNi∈RPN|RPNi is loosely coupled and RPNi is sound.Proof (proof of Lemma9).
SinceRPNA is sound and RPNB is sound, therefore (1)
M0(iA)=Mτ(oA) and M0(iB)=Mτ(oB)(2)
M0(PpA)≡Mτ(PpA) and M0(PpB)≡Mτ(PpB) therefore,(3)
PpA∈•TA and PpB∈•TB and PpA∈TA• and PpB∈TB•, therefore,(4)
∀Ppj∈Pp,∃Ppj∈PpA|Ppj∈•TA and Ppj∈TA• and(5)
∃Ppk∈PpB|Ppk∈•TB and Ppk∈TB•, therefore,(6)
M0(Ppj)≡Mτ(Ppj) and M0(Ppk)≡Mτ(Ppk); therefore, ∀RPNi∈RPN, RPN is sound and RPNi is sound and loosely coupled.
In other words, sinceRPNA and RPNB are two sound frameworks that are cooperating together, then the initial marking of the input place of RPNA is equal to the marking of the output place of RPNA at a time τ and the initial marking of the input place of RPNB is equal to the marking of the output place of RPNB at a time τ. Also, the initial marking of the resources pool in RPNA is equal to the marking of this pool at a time τ and the initial marking of the resources pool in RPNB is equal to the marking of this pool at a time τ. Moreover, the pool of resources of RPNA, PpA, belongs to the input of the transition of RPNA, •TA, and then belongs to the output of the transition after being served, TA•; similarly, the pool of resources of RPNB, PpB, belongs to the input of the transition of RPNB, •TB, and then belongs to the output of the transition after being served, TB•. Therefore, for every resource Ppj belonging to the pool of resources Pp, either for RPNA or RPNB, a resource Ppj exists that belongs to the pool of resources of RPNA, PpA, where Ppj is serving a transition in RPNA and exists a resource PpK belonging to the pool of resources of RPNB, PpB, where Ppk is serving a transition in RPNB. Therefore, the initial marking of the pool Ppj is equal to the marking of this pool at a time τ and the initial marking of the pool Ppk is equal to the marking of this pool at a time τ. Thus, for every RPNi that belongs to a workflow RPN, RPN is sound, and RPNi is sound and loosely coupled.


## 4.1. Model Definition

AnRPN is a uncouple that is defined as(1)RPN=Pp,P,T,R,λ,Λ,F,i,o,M,ΘPp,Rwhere (i)
Pp is the pool of preserved resources;(ii)
P is the set of places;(iii)
T is the set of transitions;(iv)
λ is the set of request for service;(v)
Λ is the set of capabilities;(vi)
Θ(Pp,R) is the mapping function that assigns resources to pools;(vii)
R is the set of resources;(viii)
F=Pp×T∪T×Pp∪P×T∪T×P which is the topology of the workflow. Note that the places here are classified into regular places and pools. Pools are places that have the initial marking of resources and all pools are controlled siphons. Siphons are places that, if not properly controlled, once they loose their markings they might not be marked again;(ix)
M is the marking of the RPN;(x)
i is the input place of the RPN;(xi)
o is the output place of the RPN.A transition can be fired only if the required number of tokens at the input place is met. Different types of resources are defined in the system, each responsible for a certain task in order to accomplish the activity. A Petri net isRPN if and only if the two conditions below are met:(1)
∀Θ(Pj)Pj∈•Ts,∃PkPk∈Ts• and Θ(Pj)=Θ(Pk). In other words, the first condition implies that, for every type of place such that this place is the input to a transition T, another place exists which is the output to this transition and where each type of places at the input is equal to the corresponding type of places at the output. This is because the resources should always return to their pools once the activity is accomplished, where Ts is any transition belonging to the set of transitions T.(2)
∀Pj∈•Ts, ∑k=1nak∈Pj where ak represents the token in a place. In other words, for every place that belongs to the input of a transition T, the sum of tokens a that are in this particular place and required to fire this transition will be equal to the sum of tokens that are generated in the output place of this transition after T is fired.0 ≤ j ≤ P and 0≤s≤T.Then, afterT is fired,(2)∑k=1nak=∑j=1maj∥aj∈T•andak∈•TThis means that the tokens are not consumable and at the end of the model all the input tokens will exit the system.


## 4.2.RPN as a None-Cooperative System

In this section a theorem is proposed in order to proof that theRPN is sound and is called the theorem of soundness. This RPN consists of one unit and is proved for now to be sound operating separately from any other unit in the system or vice versa. For a workflow to be sound, all input tokens to this workflow will eventually reach the output. In other words, there exist a minimum number of transitions that are live to guarantee that all tokens will reach the output. Therefore, the output is reachable from the input. Van der Aalst et al. provided in 2010 an overview of the different notions of soundness [33]. The proof will be done in both ways and will be presented as part (a), the result of assuming that RPN is sound, and part (b), proving that RPN is sound assuming a certain flow of costumers in the model.Theorem 1.
R P N is sound if and only if (1)
∀Pp×T≠∅,∃T×Pp≠∅,∃i∈P•i=∅,∃o∈Po•=∅,M(i)τ1≡M(o)τ2, where τ2≥τ1(2)
∑j=1nMPjPj≡•Ts=∑k=1mMPkPk≡Ts•(3)
∀Pj,Pj∈Pp,∃τ,Tτ∥Mτ(Pj)=M0(Pj) and Pj∈Tτ• and •Tτ∈Pj(4)
Λ⊆T
where(i)
Pj∈{P};(ii)
M(Pj) is the marking of a certain place P with index j;(iii)
•i is the set of input transitions to place i;(iv)
o• is the set of output transitions from place o;(v)
n is the total number of input tokens to a transition;(vi)
m is the total number of output tokens to a transition;(vii)
Tj∈{T};(viii)
τ≥0;(ix)
Mτ(Pj) is the marking of a certain place at time τ;(x)
M0(Pj) is the marking of a certain place at initial time.It is worth noting that pools are considered as siphons and therefore they have to be properly controlled. In other words, the marking of pools at the input transition should be equal to the marking of pools at the output transition. Resources should return to their pools after accomplishing a service. Moreover, customers entering the system should leave the system after receiving the required service. When a customer requests a service from the set of requests,λ, the resource responsible to accomplish this task should be able and have the capabilities to serve this customer. These capabilities are referred to as a set Λ.R P N is assumed to be sound if and only if the 4 set of equations from Theorem 1 are met. The first equation identifies the correct topology of the RPN. Transitions that are consuming tokens from resource pools have to end up producing the same tokens into same pools. This is the way we ensure that siphons are controlled. RPN is sound if for every existing connection between the place Pp and a transition T; there exist another connection between that specific T and that same place, where Pp is the set of pools. Therefore, ∀Pp×T≠∅,∃T×Pp≠∅. Also, the first place in the workflow noted by the input i and the last place noted by the output o have no connected places where •i means a transition connected to the input of i and o• means a transition connected to the output of o. Therefore, ∃i∈P∥•i=∅ and ∃o∈P∥o•=∅. Since the RPN is sound, then the marking of the inputs should be equal to the marking of the output in order to ensure a stable flow of customers in the system, where the marking is the number of needed tokens in order to fire a certain transition T that will be then executed. This means that each customer entering the system has to leave it after a certain period of time when all the needed care is attained. Therefore, M(i)≡M(o).In the second condition of the theorem, the total sum of markings of a certain placePj should be equal to the total sum of markings of another place Pk, where Pj is the input place of a certain transition Ts and Pk is the output place to this transition in order to ensure the soundness of the workflow RPN. This states that the preserved resources denoted by Pj, Pk are not consumable and should return to their corresponding pools once the transition is executed. Therefore, (3)∑j=1nMPjPj≡•Ts=∑k=1mMPkPk≡Ts•R P N is guaranteed to be sound if siphons are controlled as per the third condition of the theorem, where siphons are a set of places P such that any token taken out from the siphon must return back to that siphon. So, if siphons are not properly controlled, they might lose their marking and therefore affect the soundness of the system [34]. So for every place Pj that belongs to the pool of resources Pp, a time τ exists where these resources return to their corresponding pools, which means that the marking of this Pj at that time τ is equal to the initial marking of that place Pj. It is worth noting here that a resource can move along with the customers through many consecutive transitions, if needed, in order to accomplish a certain task and then go back to its pool when all the needed care is already given. Therefore, ∀Pj,Pj∈Pp,∃τ,Tτ∥Mτ(Pj)=M0(Pj) and Pj∈Tτ• and •Tτ∈Pj.Finally, condition 4 guarantees that each resource serving a particular customer in order to execute a certain transition should have the capability to handle and serve this customer; otherwise that customer will be lost in the system and will not follow a certain flow in order to reach the output, where the set of capabilities neededΛ should belong to that transition T that is being executed. Therefore, Λ⊆T.To conclude, Theorem1 guarantees that, for a sound RPN,(1)
the system is structurally valid;(2)
resources are not consumable;(3)
siphons are controlled;(4)
resources have the capability to serve customers.Proof (proof of Theorem1: Part A).
SinceRPN is sound, then (1)
o∈i, therefore,(2)
∀Tj∈T,Tj∈i, therefore,(3)
∃Pp×T≠∅ and M(Pp)t1=M(Pp)t2 where t2≥t1, therefore,(4)
since∃Pp×T≠∅ then, ∃T×Pp≠∅, therefore,(5)
∀Mt∈[M(i)〉, where t>0, therefore,(6)
∃τ∥Mτ=M(o) for t>τ, where τ is the time taken from input to output, therefore,(7)
∀M∈M(i),M∈M(o), then M(o)=M(i) where
(i)
M(i)=M-M(Pp)(ii)
M(i) is the input marking of the workflow (customer)(iii)
M(Pp) is the marking of the pools (resources). These pools are siphons(iv)
M(o) is the output marking(v)
M is the total markingSince RPN is a sound workflow therefore by the definition of the workflow,(8)
∃i∈P∥•i=∅ and ∃o∈P∥o•=∅SinceM(o)=M(i), therefore,(9)
∀T∈Mτ-1(•T)=Mτ(T•), where transition T fires out on time τ and •T=T•=Pp, therefore,(10)
∑j=1n(Pj)Pj=•T≡∑k=1mPkPk=T•, therefore,(11)
∀Pj,Pj∈Pp,∃τ,Tj∥Mτ(Pj)=Mo and Pj∈Tτ• and •Tτ∈Pj,(12)
SinceRPN is sound and since ∀M(o)∈[M(i)〉, therefore,(13)
∀λ∈Λ,∃Tj∈T∥Tj≡λ,Λ⊆T
In other words, sinceRPN is assumed to be sound then, the output is reachable from the input (o∈i) and therefore for every transition Tj that belongs to the set of transitions T, this specific transition Tj belongs also to the reachability of the input i (∀Tj∈T,Tj∈i) and thus a connection between a specific place Pp and a transition T exists and the marking of this place at a time t1 is equal to the marking of this place at a time t2 (∃Pp×T≠∅ and M(Pp)t1=M(Pp)t2), where t1 and t2 are two different times during the flow of customers in the system. Then, also a connection from this transition T to the place Pp exists (∃Pp×T≠∅ then, ∃T×Pp≠∅). This describes the topology of the net, specifically, the connections between siphons (Pp), and the set of transitions (T). We can then say that, for every marking at time t that belongs to the reachability marking of the input i (∀Mt∈Mi), the marking at time t is equal to the marking of the output, where τ is the total time from input to output (∃τ∥Mτ=M(o)). Therefore, the marking of arriving customers M(i) is equal to the marking of the output M(o) since the customer is reaching the output (∀M∈M(i),M∈M(o), then M(o)=M(i)). This means that the RPN is structurally stable.∃ i ∈ P ∥ • i = ∅ and ∃o∈P∥o•=∅): this equation describes the behavior of the input and output places of a sound workflow. This means that for any workflow, the input place is not preceded by any node and the output place is not followed by any node (∀T∈Mτ-1(•T)=Mτ(T•)): this equation states that the marking of the input of a transition T at a time τ-1 is equal to the marking of the output of the transition T at a time τ after this transition is being executed. Here, we are controlling the siphons; that means every resource that is entering a transition to fire it and execute it should also leave this transition after a certain time. Therefore, the resources are not consumable and should return to their corresponding pools where the total sum of marking of a specific place Pj belonging to this pool and connected to the input of the transition T is equal to the total marking of place Pk that is connected to the output of the transition T. Here we can reach the conclusion that for every Pj belonging to the pool of resources Pp, the marking of place Pj at a certain time τ is equal to the output marking of Pj, where Pj is connected to the input of the transition Tj at time τ and also connected to the output of the transition Tτ at time τ (∀Pj,Pj∈Pp,∃τ,Tj∥Mτ(Pj)=Mo and Pj∈Tτ• and •Tτ∈Pj). Therefore, siphons are being controlled.SinceRPN is sound and all customers entering the system reach the output and leave the system (∀M(o)∈Mi); therefore, for every set of requests λ that belongs to a pool of capabilities, a transition Tj exists that belongs to the set of transitions to be executed to accomplish a certain flow of the customer in the system, such that this Tj is equal to λ since the transition to be executed needs a resource that has the required capabilities. Therefore, the set of capabilities Λ belongs to the set of transitions; otherwise the customer cannot flow to the output and reach the end of the workflow net ( ∀λ∈Λ,∃Tj∈T∥Tj≡λ,Λ⊆T).Proof (proof of Theorem1: Part B).
(1)
If∃Pp×T≠∅,∃T×Pp≠∅ and ∃i∈P•i=∅,∃o∈Po•=∅, and M(i)≡M(o) therefore, (2)
∀ P j ,   P j ∈ P p ,   ∃ τ ∥ M τ ( P j ) = M 0 ( P j ) and Pj∈Tτ and Tτ∈Pj Since∀Pj,Pj∈Pp,∃τ,T∥Mτ(Pj)=M0(Pj) and Pj∈Tτ and Tτ∈Pj, therefore, (3)
∑ j = 1 n M P j P j ≡ • T = ∑ k = 1 m M P k P k ≡ T • Since∑j=1nMPjPj≡•T=∑k=1mMPkPk≡T• and ∀Pj,Pj∈Pp,∃τ,T∥Mτ(Pj)=Mo(Pj) and Pj∈Tτ and Tτ∈Pj, therefore, (4)
∀ a ∥ a ∈ M 0 ( i ) , a ∈ M t ( o )
wheret≥0 and M0(i) is the marking of the input at time 0 and Mt(o) is the marking of the output at time t. Therefore, RPN is sound.In other words, theRPN is proven to be sound if the 4 characteristics of Theorem 1 are satisfied. If the workflow is structurally valid, which means there exist a connection between the set of places Pp and the set of transition T and no nodes are preceding the input of the workflow and no nodes are following the output, plus the marking of the input is equal to the marking of the output (∃Pp×T≠∅,∃T×Pp≠∅ and ∃i∈P•i=∅,∃o∈Po•=∅, and M(i)≡M(o)); therefore, for every place Pj that belongs to the set of places Pp, there exist a transition T at a time τ where the marking of the place Pj at time τ is equal to the initial marking of Pj and Pj belongs to the reachability of T and T belongs to the reachability of Pj at time τ (∀Pj,Pj∈Pp,∃τ∥Mτ(Pj)=M0(Pj) and Pj∈Tτ and Tτ∈Pj); this means the workflow resources which belong to the set of places Pp are not consumable and they return to their corresponding pools after serving a certain transition T (∑j=1n(M(Pj))Pj≡•T=Σk=1m(M(Pk))Pk≡T•). Since the resources return to their corresponding pools, this means siphons are controllable, where for every token a, such that a belongs to the initial marking of the input, a belongs as well to the marking of the output at a time t, where t is the time taken for the customer to move from input to output (∀a∥a∈M0(i),a∈Mt(o)). Combining all these characteristics will ensure that tokens will eventually reach the output and therefore RPN is sound.To conclude Theorem1, four lemmas are proposed below and they are based on previous proofs of the theorem.Lemma 2 (for Theorem1).
For everyRPN such that RPN is sound, this RPN is structurally valid.Proof (proof of Lemma2).
∀   R P N ∥ R P N is sound, ∃Pp×T≠∅ and ∃T×Pp≠∅∥Pp,T∈{RPN} and ∃i∈P∥•i=∅ and ∃o∈P∥o•=∅, therefore, M(i)≡M(o).
In this proof we start with mentioning the characteristics of the net. The first two equations∃Pp×T≠∅ and ∃T×Pp≠∅ describe the topology of the net and how the siphons are connected to the transitions. The equations show that if a pool is an input to a set of transitions, this set of transitions will bring tokens back to the same pool. This way the siphon is controlled. For the equations, ∃i∈P∥•i=∅ and ∃o∈P∥o•=∅, they describe the basic feature of a workflow; that is, there is one place that is considered as an input and it is not preceded by any other node and there is one output place that is not followed by any other node. Therefore, the tokens that are injected to the input will eventually end up being in the output (M(i)≡M(o)).Lemma 3 (for Theorem1).
For everyRPN such that RPN is sound, the resources are not consumable and return to their corresponding pools. A resource can move with a customer into different consecutive stages, if needed, before returning to its pool.Proof (proof of Lemma3).
∀ R P N ∥ R P N is sound, ∃Pj≡•T and ∃Pk≡T•∥∑j=1n(M(Pj))=Σk=1m(M(Pk)). Then, ΣM0(P)=ΣMτ(P). Therefore, resources are not consumable.
The equation∃Pj≡•T and ∃Pk≡T• shows again the topology of the net where siphons are reachable from the sequence of transitions that consume from those siphons. For any transition, the number of input tokens equals the number of output tokens (Σj=1nM(Pj)=Σk=1mM(Pk)). Therefore, the sum of all markings in the net will not change by time and therefore there is no consumable resources (Σ(M0(P))=Σ(Mτ(P))).Lemma 4 (for Theorem1).
For everyRPN such that RPN is sound, the siphons are controllable.Proof (proof of Lemma4).
∀ R P N ∥ R P N is sound, Pj∈Pp, ∃τ, T∥M0(Pj)=Mτ(Pj) and Pj∈Tτ• and •Tτ∈Pj.
SinceRPN is sound then the initial marking of a place Pj is equal to the marking of that place at a certain time τ after the resource has moved into the required stages in order to accomplish a required service (M0(Pj)=Mτ(Pj)). Therefore, the place Pj is reachable from the output of transition T and the transition T is reachable from that place Pj (Pj∈Tτ• and •Tτ∈Pj). Then, all siphons are controllable.Lemma 5 (for Theorem1).
For everyRPN such that RPN is sound, the system’s resources have the capability to serve a certain customer and to execute a certain transition.Proof (proof of Lemma5).
HavingΛ to be the set of capabilities of resources, ∀λ∈Λ,∃Tj∈T∥λ≡Tj. Therefore, ∀RPN∥RPN is sound, ∃Λ⊆T∥T∈RPN.
In this proof, the equations describe the mapping between resource capabilities and transitions that belong to the workflow. In other words, for the transition to fire certain resource capabilities have to be available.


## 4.3. RPN as a Cooperative System

The theorems suggested here are to prove the soundness of the system including the cooperation between the twoRPNA and RPNB. RPNA refers to the RPN of UNIT A and RPNB refers to the RPN of UNIT B. The main reason of cooperation between the two RPNs is the blockage at one UNIT and therefore the need for sharing resources. RPNA can share resources (staff or customer) with RPNB if needed and vice versa. This can result in guaranteeing a load balance between the two RPNs of an organization and covering RPN that is not able to accomplish a task. The theorem will be proved based on the suggestion that each RPN, separately, is already sound. The only limitation here is that the resources being shared, if any, should be capable of serving this task coverage needed. The cooperative system is defined as follows:R P N c = <Stages, Resources, Patients> (4)RPNc=RPNA⊗RPNBwhere the operator ⊗ is used to represent the cooperation framework. This operator joins two cooperative sound frameworks RPNA and RPNB leading to a collective framework as a result and which will be proven to be sound as well. The resources, being shared, are defined as the set of pools: Pp={Pp1,Pp2,…,Ppn}.We have two cases here, either sharing only staff resources (see Theorem6) or sharing staff resources and customers along with other units; such as radiology, billing, etc. (see Theorem 7).The following theorems demonstrate the soundness of the cooperative framework. We assume that all resources are defined and initially, resources are not shared. Mathematically,RPNA∪RPNB⊆ Resources and RPNA∩RPNB={∅}.We study the cooperation in two different cases, namely, loosely coupled and tightly coupled. Loosely coupled case is when we only share resources between differentRPNs. On the other hand, tightly coupled case is when we share resources and customers can move among RPNs.Theorem6 is described by the following, where RPNA and RPNB share only resources.Theorem 6.
R P N c = RPNA⊗RPNB is sound if (1)
RPNA is a sound RPN,(2)
RPNB is a sound RPN,(3)
∀Ppj∈PpA,Ppj∈PpB and ∀Ppk∈PpB,Ppk∈PpA,(4)
∀Ppj∈PpA,PPj∈•TB and Ppj∈TB•,(5)
∀Ppk∈PpB,Ppk∈•TA and Ppk∈TA•,(6)
∃τ where Mτ(PpA)=M0(PpA) and Mτ(PpB)=M0(PpB),(7)
∃ΛA,ΛA∈TA|ΛA⊆TB and ∃ΛB,ΛB∈TB|ΛB⊆TA.Proof (proof of loosely coupled case).
SinceRPNA is sound and RPNB is sound as proved in Theorem 1, therefore, Mτ(PpA)=M0(PpA) and Mτ(PpB)=M0(PpB). Since ∀Ppj∈PpA,Ppj∈PpB and ∀Ppk∈PpB,Ppk∈PpA, therefore Ppj∈PpB and Ppk∈PpA. Since TB∈PpA and TA∈PpB, therefore, Ppj∈TA and Ppk∈TB. From Theorem 1, PpA∈TA and PpB∈TB, therefore the cooperative framework is sound.
In other words, this theorem shows the life cycle of the resource from the minute it is sent to a differentRPN until it goes back to its initial RPN. The resource leaves the pool to join transitions in a different RPN. Since the RPN in the destination is also sound, it will end up being assigned to its resource pools, which in turn will direct the token to its initial RPN that will put that resource into its initial pool.Theorem7 is described by the following where RPNA and RPNB share resources and customers.Theorem 7.
R P N c = RPNA⊗RPNB is sound tightly coupled if: (1)
∃RPNA and RPNB|RPNA is sound and RPNB is sound and RPNA⊗RPNB is sound and loosely coupled.(2)
∃TA×PB∪PA×TB|∀aA∈RPNA,aA∈RPNB and ∀aB∈RPNB,aB∈RPNA.Proof (proof of tightly coupled case).
(1)
since∃RPNc= RPNA⊗RPNB|RPNc is sound loosely coupled from Theorem 6. Therefore, all siphons are controlled. (2)
since∃TA×PB∪TB×PA therefore, a∈M(PA∪PB). (3)
sincePA∈PB therefore, aA∈ output of RPNA and aB∈ output of RPNB therefore, RPNc is a sound tightly coupled framework.
In other words, the framework is proven from Theorem6 to be a sound loosely coupled framework. In this theorem we prove that it is also a sound tightly coupled framework, where for every patient a that will transfer from one ER to another, this patient will return back to the original department to finalize the process and exit the system. aA refers to a patient that starts in RPNA and aB refers to a patient that starts in RPNB.As a conclusion for Theorems6 and 7, in the loosely coupled case, all pools are shared between the two RPNs. As for the tightly coupled case, all pools and patients are shared.Lemma 8 (for Theorem6).
For every cooperative systemRPNc, if this workflow is sound then, each contained workflow RPNA and RPNB are also sound.
∀ R P N c = RPNA⊗RPNB, if RPNc is sound then RPNA is sound and RPNB is sound.Proof (proof of Lemma8).
IfRPNc is sound therefore, (1)
Mτ(RPNc)≡M0(RPNc) therefore,(2)
∀Ppj∈PpA and ∀Ppk∈PpB,Ppj∈•TB and Ppj∈TA• and Ppk∈•TA and Ppk∈TB• therefore,(3)
∑i=1nMτ(RPNA)≡∑j=1mM0(RPNA) and ∑i=1nMτ(RPNB)≡∑j=1mM0(RPNB)(4)
M0(iA)=Mτ(oA) and M0(iB)=Mτ(oB) where M0(i) is the marking of the input at initial time and Mτ(o) is the marking of the output at time τ. therefore, RPNA is sound and RPNB is sound.
In other words, if the cooperative systemRPNc is sound then, exists a time τ where the marking of this workflow is equal to the initial marking. Therefore, since resources are being shared between RPNA and RPNB, then, for every resource Ppj belonging to the pool of resources of RPNA, noted here PpA, this resource belongs to the input of the transition TB serving RPNB and to the output of the transition TA since the resource should return to its original RPNA. Also, for every resource Ppk belonging to the pool of resources of RPNB, noted here PpB, this resource belongs to the input of the transition TA serving RPNA and to the output of the transition TB since the resource should also return to its original RPNB. Therefore, the sum of markings at a time τ of RPNA is equal to the initial marking of RPNA and the sum of markings at a time τ of all resources in RPNB is equal to the initial marking of RPNB. Also, the initial marking of the input place of RPNA will be equal to the marking of the output place of RPNA at a certain time τ and the initial marking of the input place of RPNB will be equal to the marking of the output place of RPNB at a certain time τ.This means that all resources in a certainRPNA or RPNB are reaching the output from the corresponding input. Therefore, RPNA is sound and RPNB is sound.Lemma 9 (for Theorem6).
∀ sound tightly coupled RPN, ∃RPNi∈RPN|RPNi is loosely coupled and RPNi is sound.Proof (proof of Lemma9).
SinceRPNA is sound and RPNB is sound, therefore (1)
M0(iA)=Mτ(oA) and M0(iB)=Mτ(oB)(2)
M0(PpA)≡Mτ(PpA) and M0(PpB)≡Mτ(PpB) therefore,(3)
PpA∈•TA and PpB∈•TB and PpA∈TA• and PpB∈TB•, therefore,(4)
∀Ppj∈Pp,∃Ppj∈PpA|Ppj∈•TA and Ppj∈TA• and(5)
∃Ppk∈PpB|Ppk∈•TB and Ppk∈TB•, therefore,(6)
M0(Ppj)≡Mτ(Ppj) and M0(Ppk)≡Mτ(Ppk); therefore, ∀RPNi∈RPN, RPN is sound and RPNi is sound and loosely coupled.
In other words, sinceRPNA and RPNB are two sound frameworks that are cooperating together, then the initial marking of the input place of RPNA is equal to the marking of the output place of RPNA at a time τ and the initial marking of the input place of RPNB is equal to the marking of the output place of RPNB at a time τ. Also, the initial marking of the resources pool in RPNA is equal to the marking of this pool at a time τ and the initial marking of the resources pool in RPNB is equal to the marking of this pool at a time τ. Moreover, the pool of resources of RPNA, PpA, belongs to the input of the transition of RPNA, •TA, and then belongs to the output of the transition after being served, TA•; similarly, the pool of resources of RPNB, PpB, belongs to the input of the transition of RPNB, •TB, and then belongs to the output of the transition after being served, TB•. Therefore, for every resource Ppj belonging to the pool of resources Pp, either for RPNA or RPNB, a resource Ppj exists that belongs to the pool of resources of RPNA, PpA, where Ppj is serving a transition in RPNA and exists a resource PpK belonging to the pool of resources of RPNB, PpB, where Ppk is serving a transition in RPNB. Therefore, the initial marking of the pool Ppj is equal to the marking of this pool at a time τ and the initial marking of the pool Ppk is equal to the marking of this pool at a time τ. Thus, for every RPNi that belongs to a workflow RPN, RPN is sound, and RPNi is sound and loosely coupled.


## 5. Framework Scalability

Scalability of our framework falls under the soundness and efficiency of the general framework regardless of the number of cooperatingRPN added to the system. It is a design quality measure of the framework. Our RPNc is guaranteed to be scalable and remain sound as demonstrated below using mathematical induction [35].Proof of Scalability. Mathematical induction technique is used in order to prove the scalability of the framework. Mathematical induction is a mathematical proof technique that allows the proof of a statement following three steps:(1)
The base case where in our case the framework is proven to be sound for oneRPNc, where RPNc=RPN1⊗RPN2(2)
The second step is the inductive hypothesis where the framework is assumed to be sound for (k)RPNc where RPNc={RPN1⊗RPN2⊗⋯⊗RPNk}(3)
The final step which is the inductive step where the framework is proven to remain sound for (k+1)RPNc. RPNc={RPN1⊗RPN2⊗⋯⊗RPNk⊗RPNk+1}Theorem 10.
∀ R P N c | R P N c = { R P N 1 ⊗ R P N 2 ⊗ ⋯ ⊗ R P N n }, if RPN1,RPN2,…,RPNn are sound RPNs therefore RPNc is sound.Proof by Induction. The three steps mentioned earlier are represented as follows:Base case: ∃ R P N c = R P N 1 ⊗ R P N 2 | R P N c is sound. RPNc is a cooperative sound system as proven before in Theorem 6.Inductive Hypothesis: given (K) RPN, we assume that ∃RPNc={RPN1⊗RPN2⊗⋯⊗RPNk}|RPNc is a sound cooperative framework.Inductive Step: it is required to prove that RPNc={RPN1⊗RPN2⊗⋯⊗RPNk⊗RPN(k+1)} is a sound cooperative framework.Proof.
AssumingRPNA={RPN1⊗RPN2⊗⋯⊗RPNk} and RPNB=RPNk+1 then if RPNA is sound from the inductive hypothesis and RPNB is sound from Theorem 1; therefore the cooperation ⊗ between them is still sound from Theorem 6, then RPNc={RPN1⊗RPN2⊗⋯⊗RPNk⊗RPN(k+1)} is still sound. Therefore, the framework is scalable.Lemma 11 (for Theorem10).
For every cooperative systemRPNc that is sound, if a new sound workflow, RPNi, cooperates with RPNc, the total workflow remains sound. Given (n) RPN|RPNc={RPN1⊗RPN2⊗⋯⊗RPNn}, ∀RPNi⊗RPNc|RPNi is sound, then RPNc remains sound.


## 6. Framework Separability and Serializability

A workflow is said to be separable if and only if the execution of the multiple tokens in the input will not affect each other. In other words, if the execution of a token A will cause token B not to reach the output, then the workflow is not separable. Separability is viewing the system as a parallel system where the system is replicated as many times as the number of tokens available and every workflow instance is fully dedicated to one token [36].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. Since siphons are controlled then resources are always available in their pools at a certain time.


### 6.1. None-Cooperative Systems

In this subsection, three theorems are presented in order to proof the separability and serializability of the proposedRPN model with no cooperation among systems.Theorem 12.
iifRPN⊖ is sound, then RPN⊖ is separable.Two-Way Proof. If RPN⊖ is sound, then RPN⊖ is separable.Proof (proof-a of Theorem12).
SinceRPN⊖ is sound, therefore ∀m∈i,o∈m, where m∈Pp and Pp represents the patient pool. Therefore, ∀a∈PR,Mt+τ(PR)∈MtPR.P R = P G - P p, PG is the total pools and a represents tokens available in places P. Therefore, ∀a∈Pp,∃τ|Mt+τ(PR) is sufficient for output o to be reachable by token a. Therefore, RPN⊖ is separable.In other words, since the RPN is sound, it means the output is reachable from the input at a certain timeτ and critical sections are controlled. Therefore, resources return to their pools and are available for another patient. Thus, the activity of a certain patient at time t does not affect another activity of another arriving patient at time t+τ.IfRPN⊖ is separable, then RPN⊖ is soundProof (proof-b of Theorem12).
SinceRPN⊖ is separable then ∀Mt+τ(PR)∈MtPR. Therefore, ∀a∈i(t),a∈o(t+kτ). Therefore, RPN⊖ is sound.
In other words, if RPN is separable, that means tokens are not affecting each other and therefore, the marking of resources at a certain timet+τ belongs to the reachability of the marking of this pool at a certain time and therefore a certain patient/token belonging to the input i at time t will definitely belong to the output o at time t+kτ. Thus, critical sections are controlled and therefore the system is sound.Theorem 13.
iifRPN⊖ is sound, then RPN⊖ is serializable.Two Ways Proof. If RPN⊖ is sound, then RPN⊖ is serializable.Proof (proof-a of Theorem13).
SinceRPN⊖ is sound, then ∀Mt∈i,Mt+τ∈o and since M(Pp)>M(PR), therefore ∃τ|M(PR)=0 and since o∈Mi. Therefore, ∃τ|PR(τ)≠0.
Therefore,∀ai,aj,τ(ai)>τ(aj), therefore RPN⊖ is serializable.
In other words, ifRPN is sound then for every marking belonging to the input i at a time t, the marking belongs also to the output o at a time t+τ. Since the number of patients is always greater than the number of resources available then, the marking of patient’s pool is greater than the marking of resource’s pool; which means that at a certain time τ, the marking of resources pool can be equal to 0 where no resources are available. Also, since the output o is reachable from the input i then, there always exist a certain time τ where a resource returns to its corresponding pool and therefore PR(τ)≠0. This leads to having two tokens ai and aj where the time of execution of one token is greater than the time of execution of the other token and therefore both tokens are not being executed at the same time. Therefore, RPN is serializable.
IfRPN⊖ is serializable, then RPN⊖ is soundProof (proof-b of Theorem13).
SinceRPN⊖ is serializable, then, Mτ(PR)≥1 and ∀τ|Mτ(i)≠0. Therefore, O∈Mi. Therefore, RPN⊖ is sound.
In other words, sinceRPN is serializable then the marking of the resource pool is definitely greater than or equal to 1; which means there is always an available resource in the corresponding pool as long as there is an available token at a certain time τ. Therefore, the output is always reachable. Since the output is always reachable from the input, therefore RPN is sound.Theorem 14.
iifRPN⊖ is serializable, then RPN⊖ is separable.Two Ways Proof. If RPN⊖ is serializable, then RPN⊖ is separableProof (proof-a of Theorem14).
From Theorem13, if RPN⊖ is serializable then RPN⊖ is sound. From Theorem 12, if RPN⊖ is sound then RPN⊖ is separable. Therefore, if RPN⊖ is serializable then RPN⊖ is separable.
IfRPN⊖ is separable, then RPN⊖ is serializableProof (proof-b of Theorem14).
From Theorem13, if RPN⊖ is sound then RPN⊖ is serializable. From Theorem 12, if RPN⊖ is separable then RPN⊖ is sound. Therefore, if RPN⊖ is separable then RPN⊖ is serializable.


### 6.2. Cooperative Systems

In this subsection, three theorems are presented in order to proof the separability and serializability of the proposedRPN model with cooperation among systems.Theorem 15.
R P N c is separable iff RPNc is sound.Two Ways Proof. If RPNc is sound, then RPNc is separable.Proof (proof-a of Theorem15).
From Theorem10, since RPNc is sound and from Theorem 12, if RPNc is sound then RPNc is separable, therefore, RPNc is separable.
IfRPNc is separable, then RPNc is sound.Proof (proof-b of Theorem15).
From Theorem10, RPNc is sound and from Theorem 7, RPNc is scalable. Then, RPNc is a valid RPN. Therefore, from Theorem 12, iff RPN is sound then RPN is separable. Therefore, RPNc is separable.Theorem 16.
R P N c is serializable iff RPNc is sound.Proof (proof of Theorem16).
From Theorem10, RPNc is sound. From Theorem 7, RPNc is scalable. Then, RPNc is a valid RPN, therefore, from Theorem 13, iff RPN is sound then RPN is serializable. Therefore, RPNc is serializable.Theorem 17.
R P N c is serializable iff RPNc is separable.Proof (proof of Theorem17).
Figures2 and 3 represent the flow in each ER and the common units between the two ERs, respectively. The stages in Figure 2 are similar for ER A and ER B. The common units which are represented in Figure 3 are the radiology and billing. On the other hand, Figure 4 describes the cooperation of the two ERs. In Figure 4, patients leaving the radiology/billing stage will follow the checking attribute stage.
From Theorem10, RPNc is sound. From Theorem 7, RPNc is scalable. Then, RPNc is a valid RPN. Therefore, from Theorem 14, iff RPN is serializable then RPN is separable. Therefore, RPNc is serializable iff RPNc is separable.Figure 2
Emergency room stages.Figure 3
Petri net radiology/billing.Figure 4
Petri net model flowchart.


## 6.1. None-Cooperative Systems

In this subsection, three theorems are presented in order to proof the separability and serializability of the proposedRPN model with no cooperation among systems.Theorem 12.
iifRPN⊖ is sound, then RPN⊖ is separable.Two-Way Proof. If RPN⊖ is sound, then RPN⊖ is separable.Proof (proof-a of Theorem12).
SinceRPN⊖ is sound, therefore ∀m∈i,o∈m, where m∈Pp and Pp represents the patient pool. Therefore, ∀a∈PR,Mt+τ(PR)∈MtPR.P R = P G - P p, PG is the total pools and a represents tokens available in places P. Therefore, ∀a∈Pp,∃τ|Mt+τ(PR) is sufficient for output o to be reachable by token a. Therefore, RPN⊖ is separable.In other words, since the RPN is sound, it means the output is reachable from the input at a certain timeτ and critical sections are controlled. Therefore, resources return to their pools and are available for another patient. Thus, the activity of a certain patient at time t does not affect another activity of another arriving patient at time t+τ.IfRPN⊖ is separable, then RPN⊖ is soundProof (proof-b of Theorem12).
SinceRPN⊖ is separable then ∀Mt+τ(PR)∈MtPR. Therefore, ∀a∈i(t),a∈o(t+kτ). Therefore, RPN⊖ is sound.
In other words, if RPN is separable, that means tokens are not affecting each other and therefore, the marking of resources at a certain timet+τ belongs to the reachability of the marking of this pool at a certain time and therefore a certain patient/token belonging to the input i at time t will definitely belong to the output o at time t+kτ. Thus, critical sections are controlled and therefore the system is sound.Theorem 13.
iifRPN⊖ is sound, then RPN⊖ is serializable.Two Ways Proof. If RPN⊖ is sound, then RPN⊖ is serializable.Proof (proof-a of Theorem13).
SinceRPN⊖ is sound, then ∀Mt∈i,Mt+τ∈o and since M(Pp)>M(PR), therefore ∃τ|M(PR)=0 and since o∈Mi. Therefore, ∃τ|PR(τ)≠0.
Therefore,∀ai,aj,τ(ai)>τ(aj), therefore RPN⊖ is serializable.
In other words, ifRPN is sound then for every marking belonging to the input i at a time t, the marking belongs also to the output o at a time t+τ. Since the number of patients is always greater than the number of resources available then, the marking of patient’s pool is greater than the marking of resource’s pool; which means that at a certain time τ, the marking of resources pool can be equal to 0 where no resources are available. Also, since the output o is reachable from the input i then, there always exist a certain time τ where a resource returns to its corresponding pool and therefore PR(τ)≠0. This leads to having two tokens ai and aj where the time of execution of one token is greater than the time of execution of the other token and therefore both tokens are not being executed at the same time. Therefore, RPN is serializable.
IfRPN⊖ is serializable, then RPN⊖ is soundProof (proof-b of Theorem13).
SinceRPN⊖ is serializable, then, Mτ(PR)≥1 and ∀τ|Mτ(i)≠0. Therefore, O∈Mi. Therefore, RPN⊖ is sound.
In other words, sinceRPN is serializable then the marking of the resource pool is definitely greater than or equal to 1; which means there is always an available resource in the corresponding pool as long as there is an available token at a certain time τ. Therefore, the output is always reachable. Since the output is always reachable from the input, therefore RPN is sound.Theorem 14.
iifRPN⊖ is serializable, then RPN⊖ is separable.Two Ways Proof. If RPN⊖ is serializable, then RPN⊖ is separableProof (proof-a of Theorem14).
From Theorem13, if RPN⊖ is serializable then RPN⊖ is sound. From Theorem 12, if RPN⊖ is sound then RPN⊖ is separable. Therefore, if RPN⊖ is serializable then RPN⊖ is separable.
IfRPN⊖ is separable, then RPN⊖ is serializableProof (proof-b of Theorem14).
From Theorem13, if RPN⊖ is sound then RPN⊖ is serializable. From Theorem 12, if RPN⊖ is separable then RPN⊖ is sound. Therefore, if RPN⊖ is separable then RPN⊖ is serializable.


## 6.2. Cooperative Systems

In this subsection, three theorems are presented in order to proof the separability and serializability of the proposedRPN model with cooperation among systems.Theorem 15.
R P N c is separable iff RPNc is sound.Two Ways Proof. If RPNc is sound, then RPNc is separable.Proof (proof-a of Theorem15).
From Theorem10, since RPNc is sound and from Theorem 12, if RPNc is sound then RPNc is separable, therefore, RPNc is separable.
IfRPNc is separable, then RPNc is sound.Proof (proof-b of Theorem15).
From Theorem10, RPNc is sound and from Theorem 7, RPNc is scalable. Then, RPNc is a valid RPN. Therefore, from Theorem 12, iff RPN is sound then RPN is separable. Therefore, RPNc is separable.Theorem 16.
R P N c is serializable iff RPNc is sound.Proof (proof of Theorem16).
From Theorem10, RPNc is sound. From Theorem 7, RPNc is scalable. Then, RPNc is a valid RPN, therefore, from Theorem 13, iff RPN is sound then RPN is serializable. Therefore, RPNc is serializable.Theorem 17.
R P N c is serializable iff RPNc is separable.Proof (proof of Theorem17).
Figures2 and 3 represent the flow in each ER and the common units between the two ERs, respectively. The stages in Figure 2 are similar for ER A and ER B. The common units which are represented in Figure 3 are the radiology and billing. On the other hand, Figure 4 describes the cooperation of the two ERs. In Figure 4, patients leaving the radiology/billing stage will follow the checking attribute stage.
From Theorem10, RPNc is sound. From Theorem 7, RPNc is scalable. Then, RPNc is a valid RPN. Therefore, from Theorem 14, iff RPN is serializable then RPN is separable. Therefore, RPNc is serializable iff RPNc is separable.Figure 2
Emergency room stages.Figure 3
Petri net radiology/billing.Figure 4
Petri net model flowchart.


## 7. Cooperative Behavior Modeling of Healthcare Units

The healthcare unit along with the flow of patients are modeled using the proposedRPN. The Petri net framework is modeled by two RPNs in order to describe the two emergency rooms that constitute the ED: ER A and ER B. The entities described in the model are same for both ERs and some are common (such as for radiology and billing). The customer refers to the patient and the resources to the medical resources who serve this patient. In this RPN, the transitions represent each stage of the model. The places represent the entity pools such as patients or medical resources and the transfer between stages. These places and transitions are connected with directed arcs called connections. Each entity in the model has a defined number of resources or tokens which is called marking.This patient will continue his flow by moving to Treatment A if he is coming from ER A and to Treatment B if he is coming from ER B. It is trustworthy to mention here that in Figure4, patient, whether A or B, should follow the remaining flow after reaching the treatment stage. The medical resources pools are named as follows: Doctor Pool, RN Pool, Nurse Pool, Transporter Pool, Accountant Pool, Receptionist Pool, Physician Pool, and Technician Pool. In order to control the critical sections in the model and avoid siphons these resources should always return to their corresponding pools after accomplishing a certain task. We say here that the model is sound [36]. The only entity that flows from the beginning till the end of the system is the patient. All these resources are nonconsumable. As for the patient, it is an entity that flows from the beginning till the end of the system and it is not consumable. The flow of patients in the system is described by the arrival to the ER until the exit either to another unit (admitted to hospital) or exiting home. Some transitions need more than the patient entity as entry place in order to be enabled.


## 8. Simulation and Results

The proposed modelRPN is simulated and results are shown in Figure 5. The results show that the billing unit suffers from bottleneck which is normal since this unit is shared by the two emergency rooms ER A and ER B. Thus, the highest utilization rate is for the corresponding resources: Accountant and Receptionist. These resources, being the busiest in the system, must be considered for future optimization. Also, the radiology unit should be considered for future improvement as per the simulation results. The workload of each resource is depicted in Figure 6. It is obvious from the results that nurses are very busy and need to be also considered during future optimization stage along with technicians and accountants. Since transporters wait for patients to finish a certain activity in another unit and then forward them to the emergency department and vice versa, they suffer from high workload and busy service time. The future optimization phase should include different allocation of these resources or adding more medical resources. By suggesting new resource dimensions, the average waiting time of patients may be decreased always maintaining the same level of care and a reduced resource workload. This may lead to extra patients being seen and thus extra patients leaving the system which results in a higher hospital revenue. In previous work [37], the same ED was simulated using Arena software and the results obtained are similar to the RPN simulation. This similarity in results validates the RPN simulation outputs and thus the model is considered reliable and ready for future experimentation.Figure 5
Units service time.Figure 6
Resources workload.


## 9. Conclusion and Future Work

Healthcare systems are considered complex and very hard to manage which urge decision makers to always follow up on its daily operations in order to improve and maintain a stable flow of patients. In the literature, researchers proved that Petri net is an efficient and powerful modeling technique in order to describe a real-life concurrent system such as emergency departments without any interruption of the real system.In this study a new type of Petri net modeling is presented, which is useful for all type of queuing systems such as hospitals, restaurants, theaters, etc. This new framework considers only human resources and is calledRPN (Resource Preservation Net). These resources are not consumable and always return to their pools after accomplishing a certain task in order to control system siphons. This RPN is applied to a real-life system: the ED of a general hospital in Lebanon. This ED is formed of two emergency rooms that operate separately and have separate medical resources: ER A and ER B. Only the radiology and billing units of the hospital are shared among the ERs. Here, the RPN describes the flow of patients in the ED from the time he arrives to the system until he is discharged. In this study, cooperative and noncooperative systems are proven to be sound using discrete mathematics. Noncooperative systems mean that units are working smoothly without any interaction between each other and with no cooperation between resources or any other unit. Cooperative systems show the difference between the cooperation of medical resources only or the cooperation of medical resources and other units by sharing the customers among different units such as radiology and billing. Scalability of the workflow is proven mathematically to remain sound, where many ERs or more generally any unit can be added to the overall system in order to improve the operation of the organization, while maintaining a sound cooperation among all units. These mathematical suggestions are presented using several theorems that can be applicable to any type of organization and specifically to any type of emergency department in a healthcare system.As a future work, optimization of the suggested mathematical model will be presented in order to improve the operation and services offered to patients. Workflow optimization includes the study of a multidimensional probabilistic problem where patient reward and system reward are considered.



---

*Source: 4102968-2018-11-19.xml*