Modelling and performance analysis of clinical pathways using the stochastic process algebra PEPA

Abstract

Background

Hospitals nowadays have to serve numerous patients with limited medical staff and equipment while maintaining healthcare quality. Clinical pathway informatics is regarded as an efficient way to solve a series of hospital challenges. To date, conventional research lacks a mathematical model to describe clinical pathways. Existing vague descriptions cannot fully capture the complexities accurately in clinical pathways and hinders the effective management and further optimization of clinical pathways.

Method

Given this motivation, this paper presents a clinical pathway management platform, the Imperial Clinical Pathway Analyzer (ICPA). By extending the stochastic model performance evaluation process algebra (PEPA), ICPA introduces a clinical-pathway-specific model: clinical pathway PEPA (CPP). ICPA can simulate stochastic behaviours of a clinical pathway by extracting information from public clinical databases and other related documents using CPP. Thus, the performance of this clinical pathway, including its throughput, resource utilisation and passage time can be quantitatively analysed.

Results

A typical clinical pathway on stroke extracted from a UK hospital is used to illustrate the effectiveness of ICPA. Three application scenarios are tested using ICPA: 1) redundant resources are identified and removed, thus the number of patients being served is maintained with less cost; 2) the patient passage time is estimated, providing the likelihood that patients can leave hospital within a specific period; 3) the maximum number of input patients are found, helping hospitals to decide whether they can serve more patients with the existing resource allocation.

Conclusions

ICPA is an effective platform for clinical pathway management: 1) ICPA can describe a variety of components (state, activity, resource and constraints) in a clinical pathway, thus facilitating the proper understanding of complexities involved in it; 2) ICPA supports the performance analysis of clinical pathway, thereby assisting hospitals to effectively manage time and resources in clinical pathway.

Introduction

Today, hospitals are asked to serve more and more patients while maintaining the quality of healthcare with limited medical staff and equipment. This situation causes many serious problems, including overcrowded emergency departments, delayed treatment of urgent patients, long waiting time and decreasing satisfaction of both doctors and patients [1]. Within such a context, it becomes essential to apply information and communications technology (ICT) to achieve more efficient hospital management. Health informatics (also named clinical informatics) applies ICT to healthcare and biomedicine for promoting public health, facilitating hospital management and reducing healthcare cost [2]. Among its various branches, clinical pathway, emerging in the 1980s [3], is a popular tool to outline the sequence and timing of actions necessary to a desired outcome with optimal efficiency [4]. The sequence of clinical actions performed by a multidisciplinary team moves a patient with a specific diagnosis progressively through a clinical experience to a desired healthcare effect [4, 5].

Clinical pathway focuses on improving the efficiency of the healthcare process for patients, especially those with acute diseases. A number of factors affect clinical pathways, including changing amount of incoming patients, uncertain diagnosis duration and other unpredictable events. To date, the lack of formal modelling methods in existing techniques [6–13] means the description of clinical pathway is rather vague which results that the complex behaviours involved in clinical pathway cannot be adequately understood by hospital managers. For such an issue, a mathematical model is required to accurately describe these behaviours of a clinical pathway. A novel platform for more efficient clinical pathway management, therefore, is proposed in this paper. The paper features four key elements:

• 1. A clinical pathway management platform, Imperial Clinical Pathway Analyser (ICPA), is introduced for quantitatively analysing clinical pathway. This platform can construct models of clinical pathway using existing clinical data and conducts performance analysis based on these models. The analysis results can benefit hospitals by providing crucial information for clinical pathway management.

• 2. Developed from performance evaluation process algebra (PEPA) [14], a stochastic model clinical pathway PEPA (CPP) is introduced to accurately describe different aspects of a clinical pathway, including its state transitions and treatment activities as well as their associated resources and constraints.

• 3. Using CPP, performance analysis of a clinical pathway can be conducted. The analysis results provide a variety of useful information in the clinical pathway. Firstly, resource utilisation can help hospitals to optimise resource allocation. Secondly, the passage time under different patient inputs shows patients' expected residing time in hospitals. Thirdly, the maximum number of input patients reveals the capacity of hospitals.

• 4. A stroke clinical pathway obtained from Charing Cross Hospital of Imperial College London is demonstrated. We choose this example for medical and economic reasons. Firstly, stroke is a typical acute disease and the third most common cause of death worldwide. Hence any delay in treatment may result in severe disability [15, 16]. Secondly, according to a recent National Audit Office report, 4-6% of the total NHS expenditure in the UK is spent on stroke treatment. It is predicted that the better management of stroke care can bring £20 m in annual savings, 550 fewer deaths and 1700 fewer cases of disability in the UK [17, 18].

Motivation

The stroke clinical pathway investigated in this paper is for illustrative purposes. Stroke is a complex disease requiring a systematic integration of services, e.g. primary care, ambulance services, acute treatment and rehabilitation, post-acute rehabilitation, and often long-term health and care support in the community. Due to its complexity and requirement of various services, the stroke clinical pathway presents a significant challenge to existing generally fragmented health and social care services. Moving from the current fragmented approach to an integrated stroke system is a complex task. As simulation models are useful during the planning stage of complex service re-configuration, modelling methods are in demand to simulate and optimize the stroke clinical pathway. Figure 1 displays the abstraction of a general stroke clinical pathway, obtained from Charing Cross hospital of Imperial College London. A new 999 call from a patient or other hospitals initiates an instance of this pathway. The information flow is summarized as follows:

Figure 1

An example of the stroke clinical pathway.

• 1. First, an ambulance scheduled by London Ambulance Service (LAS) picks up the patient, where a Fitness and Anthropometric Scoring Template (FAST) test is carried out.

• 2. The patient is sent to the accident and emergency (A&E) resuscitation department and referred to the stroke team, if the FAST test shows s/he potentially has a stroke. Otherwise s/he is sent to the normal emergency department.

• 3. Next, if the patient is further diagnosed to have a stroke, s/he is sent to the CT department; otherwise s/he is transferred to the normal A&E department.

• 4. If a CT scan shows the patient does not have a stroke, s/he will be switched to the non-stroke treatment department. If the patient has a haemorrhagic stroke, s/he is transferred to the Hyper-Acute Stroke Unit (HASU). If the patient has an ischemic stroke, clinicians need to further determine whether the patient needs thrombolysis therapy.

• 5. Afterwards, the patient is sent to the HASU to be cared by occupational therapists for two or three days.

• 6. Finally, the patient is discharged from hospital, and the community therapy team takes over.

As every patient has his/her own journey, modulated by clinical issues and availability of resources, the clinical pathway in Figure 1 is a model of a highly dynamic system. To model such a system, two challenges need to be addressed:

• 1. There are many uncertainties in the clinical pathway, so that a model may need to simulate pathways in a stochastic manner. For example, the stroke clinical pathway in Figure 1 has a changing number of incoming patients, and the time spent in each department for different patients may vary significantly. Patients with different diagnoses will be transferred to different departments, taking different routes through the pathway. Therefore a modelling method, which can cope with these complexities, is required.

• 2. Performance analysis for different scenarios should be supported. For example, patients would be interested in the expected time they would spend in hospital, while hospitals need to estimate the maximum number of patients they can treat every day and manage the clinical pathway in a cost-effective way. Thus a clinical pathway management platform, which can explicitly evaluate the clinical pathway performance, such as passage time and throughput, would be of interest.

Related work

The general impact of information technology on the clinical pathway like the influence of IT support on the satisfaction of both patients and medical staff is studied [8–10]. The clinical pathway can be implemented manually on paper [11] or electronically [12]. With a good understanding of the clinical pathway, a set of evidence-based recommendations forming guidelines for clinical practice can be developed to both formalize and optimize the care process [13]. Thus IT techniques embedded into clinical pathways can efficiently decrease undesired practice variability and improve clinician performance.

Some researchers further propose methods of modelling the clinical pathway. By using quantitative models, the influence of individual resources on overall pathway performance can be evaluated directly. However, little work has been done in the area of modelling clinical pathways with the aim of quantitatively improving system performance. Although in [19], a pathway model to facilitate the stroke care planning process is introduced, without a mathematical representation, the model performance cannot be shown explicitly. The work has been done in [20] applies the workflow graph to model the clinical pathway. Using this model, a similarity function is proposed to evaluate the temporal equivalence of two clinical pathways in order to reduce a complex pathway scenario into a simple one. In [21], ontology is used to describe the clinical pathway. This model allows the hierarchical representation of the clinical pathway, e.g., a clinical pathway can be described as a combination of a high-level outcome flow and a detailed workflow with care time constraints. However, the work done in [20] and [21] cannot build a model to explicitly measure the performance of the clinical pathway, such as throughput and passage time. Some researchers focus on analysing time and resource information in clinical pathway using stochastic Petri net. In [22], Rui et al. introduce the Probabilistic Time Constraint WorkFlow Nets (PTCWF-nets) to model a process. A static analysis method is then proposed to analyse each activity's probability of meeting its time constraints (e.g., deadline) in a process before the process is actually executed. In addition, they develop a dynamic method during the execution of the process [23]. This method can update remaining activities' probabilities of successful execution whenever some activities are completed and their actual durations are known. Time schedulability is only one aspect of performance analysis in clinical pathway and it is closely related to another aspect: resource analysis. In [24], they further apply PTCWF-nets to manage resources. Their approach can schedule a clinical pathway among multiple available resources and allocate each activity to an optimal resource, i.e., the resource that has the highest probability to finish the activity in time. Authors in [25] also attempt to model clinical pathway using Petri net. They introduce performance trees to provide a standard unifying framework for expressing performance measures and performance requirements. Benefit from performance trees, the Petri net model for clinical pathway can provide estimation of steady state distribution and passage time.

Besides the work has been done to model the clinical pathway using Petri net, process algebra is also introduced to formally specify the interactions of different entities in the clinical pathway [26]. Process algebra is a mathematical framework used to describe a complex parallel system. In this framework, both the behaviour and properties of the system are described in the form of algebra, facilitating accurate definition and rigorous reasoning about the system in mathematics. PEPA is an enhanced process algebra mainly used to describe and analyse the performance of concurrent systems [14]. It inherits most characteristics of process calculus while incorporating features to specify a stochastic model, which potentially behaves as a continuous time Markov process. Comparing PEPA with other frequently used modelling tools, a queuing network offers compositionality but lacks formal definition, while a Petri net has formal definition without good compositionality. Thus in paper [27], PEPA is used to model the healthcare system. Based on PEPA, the execution duration and throughput of the clinical pathway can be evaluated. However, the role of resources, which constrain the activities and further limit pathway outcome, is not explicitly shown in this model. Therefore, this paper proposes a general clinical pathway model based on the CPP to analyse the performance of system and optimize pathway output.

The remainder of this paper is organised as follows: the Method Section introduces the architecture of ICPA, defines the CPP model, and presents key theories in conducting performance analysis on clinical pathway; the Results Section reports our experimental tests of the CPP model's effectiveness; finally, the Conclusion Section summarises our work.

Method

A novel clinical pathway management platform, ICPA, is proposed to effectively manage clinical data and provide feedback to hospitals, aiming to improve healthcare systems by constructing models of clinical pathways. The architecture of ICPA is shown in Figure 2. Hospitals, treating various patients, take records of patients' treatment processes. The collected clinical data is stored in clinical pathway databases. As the specific disease studied in this paper is stroke, ICPA uses national stroke related databases, such as the Stroke Improvement National Audit Programme (SINAP) database [28], and the database containing stroke clinical data in Charing Cross hospital to parameterize the stroke clinical pathway model. By constructing the stroke clinical pathway model using our formal modelling method CPP, ICPA can analyse the performance of the clinical pathway, where throughput and passage time are estimated. Using analysis results, hospitals can efficiently reconfigure the clinical pathway. Hence, ICPA is a useful clinical pathway platform for hospitals to understand problems and find bottlenecks in the disease treatment process.

Figure 2

The architecture of ICPA platform.

The core element of ICPA is the CPP modelling method. In ICPA the constructed model, whose modelling language should follow the rules of PEPA, is first checked by the CPP Model Checker. By applying the CPP modelling method, the clinical pathway can be modelled in a stochastic manner where the time duration of each activity in the disease treatment process is a variable. Furthermore, the CPP method supports multiple parallel patients, enabling competition among patients for the same treatment resources. As the underlying stochastic model of CPP is a continuous time Markov Chain, the steady state distribution and an estimation of passage time can be produced. In the following subsections, technical details of the CPP modelling method will be discussed.

Definition of CPP

Inheriting and developed from PEPA, the basic elements of CPP are state components, resource components and activities. A state component represents the status of a patient by showing in which department the patient is being treated. A resource component is used to specify the state of each resource, which can be either busy or idle. The third component is the activity, which decides transitions between different state components. As each activity relies on one or more resources, the state transition can only take place when the associated resource components are in their idle states. Therefore, the number of resources constrains the frequency of state transitions and limits the system throughput. The model defined by CPP which represents states and resources separately is suitable for resource optimization and status monitoring of patients. Definitions of CPP are as follows.

Definition 1. In CPP, the clinical pathway is represented by a five-tuple, < S, R, Act, C, F _C >, where:

• S is a finite set of states s ∈ S, showing places that patients are being treated;

• R is a finite set of resources, r ∈ R, required during treatment;

• Act is a finite set of activities a ∈ Act; Each activity, a, is represented by a two-tuple (α, rate), where α is the action type and rate is one over the mean value of execution duration which is an exponentially distributed random variable;

• C is a set of constraints c ∈ C;

• F _C is a set of functions that determine action rate: rate = f (c_{r 1}, c_{r 2}, . . . , c _rn ) where f ∈ F _C , c _ri ∈ C and 1 ≤ i ≤ n.

Definition 2. In CPP, the set S and R are basic components. Given that these components can be commonly denoted as P or Q, the syntax of the terms in CPP can be defined as follows:

(1)

• The sequential operator '.' defines the order of P and Q;

• The choice operator '+' indicates competition between P and Q;

• The cooperation operatordetermines the interaction between P and Q over the action set L.

For example, P\stackrel{def}{=}\left(\alpha ,rate\right).Q means that the component P becomes Q with the completion of the activity (α, rate). The expression P + Q represents that the system can behave either as P or Q. It enables all the activities of P and Q, and the first completed activity determines how the system behaves. The cooperation operator in the expression forms the basis of composition and can specify two components working cooperatively with shared activities defined in L.

Three key parts of the CPP model

The CPP model consists of three key parts, namely state definition, resource specification and system description, which are used to show how the number of resources in the healthcare system affects the total throughput and the overall response-time for treatment.

• 1. State definition The state definition part shows how patients proceed through healthcare system. It consists of multiple state components representing places that patients are being treated. Based on their corresponding pathology states, patients with different diagnosis results are transferred to various departments. Two related state components are connected by sequential and choice operators. The sequential operator shows the time sequence of states, while the choice operator represents competition between two states. Here is an example of the state component definition:

  It shows that patient can move from the state Patient_{place 1}to Patient_{place 2}or Patient_{place 3}with probabilities of ρ_{place 2}and ρ_{place 3}after the completion of the activity whose action type is α.

  Patien{t}_{place1}\stackrel{def}{=}\left(\alpha ,{\rho }_{place2}*rat{e}_{\alpha }\right).Patien{t}_{place2}+\left(\alpha ,{\rho }_{place3}*rat{e}_{\alpha }\right).Patien{t}_{place3}

  (2)

• 2. Resource specification The resource specification part defines all resources including equipment and medical staff required by state components. Transition between different state components requires the availability of corresponding resources. Assume the resource Resource_{place 1}needed by the state component Patient_{place 1}is defined as

  where Resource_busy_{place 1}represents that the resource is currently busy in completing the activity whose action type is α, while Resource _idle_{place 1}shows the resource is currently idle waiting for the completion of activity whose action type is β. The activities with action type of β and α can occur in:

  where the state Patient_{place 0}is the previous state of Patient_{place 1}and Patient_{place 2}is the next state of Patient_{place 1}. With completion of the activity whose action type is β, patients can move from Patient_{place 0}to Patient_{place 1}. Meanwhile, the resource required by Patient_{place 1}becomes busy in treating the patient. After the treatment, denoted as the activity with the action type of α, the resource becomes idle again waiting to treat another patient.

  \begin{array}{cc}\hfill Resource\text{\_}idl{e}_{place1}& \stackrel{def}{=}\left(\beta ,rat{e}_{\beta }\right).Resourc{e}_{-}bus{y}_{place1}\hfill \\ \hfill Resource\text{\_}bus{y}_{place1}& \stackrel{def}{=}\left(\alpha ,rat{e}_{\alpha }\right).Resourc{e}_{-}idl{e}_{place1}\hfill \end{array}

  (3)
  \begin{array}{cc}\hfill Patien{t}_{place0}& \stackrel{def}{=}\left(\beta ,rat{e}_{\beta }\right).Patien{t}_{place1}\hfill \\ \hfill Patien{t}_{place1}& \stackrel{def}{=}\left(\alpha ,rat{e}_{\alpha }\right).Patien{t}_{place2}\hfill \end{array}

  (4)

• 3. System description The last part of the CPP model is the system description part, describing the whole clinical pathway by using the cooperation operator to denote interactions between components. Suppose only one patient defined in Eqn.4 and one resource component defined in Eqn.3 are involved in the CPP model. The cooperation between state component Patient_{place 0}and the resource component Resource_idle_{place 1}can be represented as

  where β and α are the action types on which two components Patient_{place 0}and Resource _ idle_{place 1}synchronise. More specifically, the patient which is currently in the initial state Patient_{palce 0}can only be scheduled to the following states when successive treatments are carried out.

  As the healthcare system usually contains multiple patients and multiple copies of resources, it is necessary to represent parallel patients and resources as follows:

  where || is the parallel combinator, equivalent to , showing that two components are in parallel. Therefore, we can describe the system which consists of multiple Patient_{place 0}and Resource _idle_place1 in the form of

  Although definitions in Eqn.3,4,7 can emphasize the influence of resource on patient health care process, it has a limitation. When all copies of the resource are in their busy state Resource _busy_{place 1}, a new coming patient cannot be transferred from Patient_{place 0}to Patient_{place 1}. The patient will be stuck in the state Patient_{place 0}until at least one copy of resource become idle enabling it transfer to Patient_{place 1}and then to Patient_{place 2}. In reality, even if all the copies of resource are busy, we still want the new coming patient to be able to move from Patient_{place 0}to Patient_{place 1}and then stay in Patient_{place 1}waiting for at least one copy of the resource becoming idle. Therefore, we need to revise the resource definition part by inserting an additional resource as follows:

  Then the system description part is:

  The number of copies of the inserted resource Wait_room 0_idle should be sufficiently large to guarantee that at least one copy is available at any time, that is Num_{Wait_room 0}≥ Num _Patient . Moreover, the action rate rate _γ must be large enough to enable instant transition from Wait _room 0_busy to Wait _room 0_idle whenever at least one copy of resource is in its idle state Resource _idle_{place 1}.

  With definitions in Eqn.4,8,9, the CPP model for a simple clinical pathway can be constructed. For more complex clinical pathway, we can augment this model to contain more state components and more resources.

  

  (5)
  \begin{array}{cc}\hfill Patien{t}_{place0}\left[Nu{m}_{Patient}\right]& \stackrel{def}{=}\underset{Nu{m}_{Patient}}{\underset{}{Patien{t}_{place0}\left|\right|...\left|\right|Patien{t}_{place0}}}\hfill \\ \hfill Resourc{e}_{-}idl{e}_{place1}\left[Nu{m}_{Re\mathsf{\text{s}}ource1}\right]& \stackrel{def}{=}\underset{Nu{m}_{Resource1}}{\underset{}{Resource\text{\_}idl{e}_{place1}\left|\right|...\left|\right|Resource\text{\_}idl{e}_{place1}}}\hfill \end{array}

  (6)
  

  (7)
  \begin{array}{cc}\hfill Wait\text{\_}room0\text{\_}idle& \stackrel{def}{=}\left(\beta ,rat{e}_{\beta }\right).Wait\text{\_}room0\text{\_}busy\hfill \\ \hfill Wait\text{\_}room0\text{\_}busy& \stackrel{def}{=}\left(\gamma ,rat{e}_{\gamma }\right).Wait\text{\_}room0\text{\_}idle\hfill \\ \hfill Resource\text{\_}idl{e}_{place1}& \stackrel{def}{=}\left(\gamma ,rat{e}_{\gamma }\right).Resource\text{\_}bus{y}_{place1}\hfill \\ \hfill Resource\text{\_}bus{y}_{place1}& \stackrel{def}{=}\left(\alpha ,rat{e}_{\alpha }\right).Resource\text{\_}idl{e}_{place1}\hfill \end{array}

  (8)
  

  (9)

Key techniques of performance analysis using CPP

Rooted in a continuous time Markov process [14], CPP model can be used to estimate the performance of clinical pathway including throughput (the number of patients that the healthcare system can serve every day) and resource utilisation (the percentage of time that a resource is in use).

The underlying stochastic process

The basic idea of a Markov process is that the distribution of time until the next state change is independent of the time which has elapsed since the last state change. Let the state transition rate between states S _i and S _j be

q_{S_i,Sj}=\sum _{{}_{\alpha }\in S_i\underrightarrow{\alpha }{S}_j}rat{e}_{\alpha }

(10)

If there are no direct connections between these two states, then the transition rate q_{S_i,S_j}=0. Let X(t) = S _i indicate that at time instance t, the system behaves as S _i . After a tiny amount of time δt, the probability that the system is in state S _j is

Pr\left(X\left(t+\delta t\right)=Sj|X\left(t\right)=S_i\right)=q_{S_i,Sj}*\delta t+O\left(\delta t\right),i\ne j

(11)

where O(δt) goes to zero faster than δt. Suppose that the infinitesimal generator for the process Q is a square matrix whose off-diagonal elements are q_{S_i,S_j} and diagonal elements are formed as the negative sum of the non-diagonal elements of each row, q_{S_i,S_i}=-\sum _{j\ne i}{q}_{S_i,S_j}. The evolution of the continuous time Markov process is represented by a first order differential equation [29]:

P^{\prime }\left(t\right)=Q*P\left(t\right)=P\left(t\right)*Q,where\mathit{ P}\left(0\right)=I

(12)

where P(t) is a square matrix with (i, j)th entry p_{i, j}standing for the probability Pr(X(t) = S _j |X(0) = S _i ). As performance analysis is usually concerned with system behaviour over a significant period of time, it is necessary to study the steady state behaviour of the system. If the steady state distribution exists, then the proportion of time that the process spends in state S _j is represented as:

{\pi }_j=\underset{t\to \top }{\mathsf{\text{lim}}}Pr\left(X\left(t\right)=S_j|X\left(0\right)=S_0\right)

(13)

Therefore, we can define:

\prod =\underset{t\to \top }{\mathsf{\text{lim}}}P\left(t\right)=\left[\begin{array}{cccc}\hfill {\pi }_1\hfill & \hfill {\pi }_2\hfill & \hfill \cdots \hfill & \hfill {\pi }_N\hfill \\ \hfill {\pi }_1\hfill & \hfill {\pi }_2\hfill & \hfill \cdots \hfill & \hfill {\pi }_N\hfill \\ \hfill ⋮\hfill & \hfill ⋮\hfill & \hfill ⋮\hfill \\ \hfill {\pi }_1\hfill & \hfill {\pi }_2\hfill & \hfill \cdots \hfill & \hfill {\pi }_N\hfill \end{array}\right]

(14)

where N is the total number of states, subject to the normalisation condition \sum _i{\pi }_i=1. Then Eqn.12 becomes:

\begin{array}{c}{\text{Π}}^{\prime }=\text{Π}*Q=\left[\begin{array}{cccc}\hfill {\pi }_1\hfill & \hfill {\pi }_2\hfill & \hfill \cdots \hfill & \hfill {\pi }_N\hfill \\ \hfill {\pi }_1\hfill & \hfill {\pi }_2\hfill & \hfill \cdots \hfill & \hfill {\pi }_N\hfill \\ \hfill ⋮\hfill & \hfill ⋮\hfill & \hfill ⋮\hfill \\ \hfill {\pi }_1\hfill & \hfill {\pi }_2\hfill & \hfill \cdots \hfill & \hfill {\pi }_N\hfill \end{array}\right]\left[\begin{array}{cccc}\hfill q_{S_1,S_1}\hfill & \hfill q_{S_1,S_2}\hfill & \hfill \cdots \hfill & \hfill q_{S_1,S_N}\hfill \\ \hfill q_{S_2,S_1}\hfill & \hfill q_{S_2,S_2}\hfill & \hfill \cdots \hfill & \hfill q_{S_2,S_N}\hfill \\ \hfill ⋮\hfill & \hfill ⋮\hfill & \hfill ⋮\hfill \\ \hfill q_{S_N,S_1}\hfill & \hfill q_{S_N,S_2}\hfill & \hfill \cdots \hfill & \hfill q_{S_N,S_N}\hfill \end{array}\right]=0\\ \left[\begin{array}{cccc}\hfill {\pi }_1\hfill & \hfill {\pi }_2\hfill & \hfill \cdots \hfill & \hfill {\pi }_N\hfill \end{array}\right]\left[\begin{array}{c}\hfill q_{S_1,S_i}\hfill \\ \hfill q_{S_2,S_i}\hfill \\ \hfill ⋮\hfill \\ \hfill q_{S_N,S_i}\hfill \end{array}\right]=0\mathsf{\text{ for }}i=1,\dots ,N\end{array}

(15)

As q_{S_i,S_i}=-\sum _{j\ne i}{q}_{S_i,S_j}, then Equ.15 can be simplified to:

\underset{\mathsf{\text{flux}}\mathsf{\text{out}}\mathsf{\text{of}}\mathsf{\text{state}}{S}_i}{\underset{}{{\pi }_i*\sum _{j\ne i}{q}_{S_i,S_j}}}=\underset{\mathsf{\text{flux}}\mathsf{\text{into}}\mathsf{\text{state}}{S}_{\mathsf{\text{i}}}}{\underset{}{\sum _{j\ne i}{\pi }_j*q_{S_j,S_i}}}

(16)

We can therefore use Eqn.10,16 to obtain steady state distribution.

Here is a simple example to explain the above process. Suppose the system behaviour can be modeled by a two state Markov process whose state transition diagram is shown in Figure 3. Then the generator matrix is as follows:

Figure 3

The state transition diagram of a two state Markov process.

Q=\left[\begin{array}{cc}\hfill -7\hfill & \hfill 7\hfill \\ \hfill 6\hfill & \hfill -6\hfill \end{array}\right]

(17)

We can therefore get steady state distribution from:

\begin{array}{c}{\pi }_1*7={\pi }_2*6\\ {\pi }_1+{\pi }_2=1\end{array}

(18)

which is:

\pi =\left[{\pi }_1,{\pi }_2\right]=\left[0.46,0.54\right]

(19)

Calculating the resource utilisation and system throughput

The steady state distribution π _i stands for the proportion of time that the process spends in state S _i . By finding in which state S _i the resource is busy, we can calculate the resource utilisation. For example, if the resource at place _i is busy in state S₁, S₃ and S₄, then its utilisation can be obtained by π(Resource_busy _placei ) = π(1) + π(3) + π(4). If this resource has multiple copies, we can calculate its average utilisation by

Utilisatio{n}_{Resourc{e}_{placei}}=\left(\sum _{j=1}^{Nu{m}_{Resourcei}}\pi {\left(Resource\text{\_}bus{y}_{placei}\right)}_j\right)/Nu{m}_{Resourc{e}_{placei}}

(20)

where Nu{m}_{Resourc{e}_{placei}} is the total number of Resource _placei copies.

In the clinical pathway model, suppose that there is a patient who completes the activity with the action type λ leaves the hospital. The throughput of pathway is estimated by the expected number of completed activities with action type λ. Given the definition of resource Resource _placeN in the last place of the care process as follows:

\begin{array}{cc}\hfill Resourc{e}_{-}idl{e}_{placeN}& \stackrel{def}{=}\left(\sigma ,rat{e}_{\sigma }\right).Resourc{e}_{-}bus{y}_{placeN}\hfill \\ \hfill Resourc{e}_{-}bus{y}_{placeN}& \stackrel{def}{=}\left(\lambda ,rat{e}_{\lambda }\right).Resourc{e}_{-}idl{e}_{placeN}\hfill \end{array}

(21)

where the completion of activity (λ, rate_λ) enables the resource to become idle. Then the throughput T can be represented by:

T=rat{e}_{\lambda }*Utilisatio{n}_{Resource\text{\_}bus{y}_{placeN}}

(22)

showing that the system throughput is associated with the utilisation of the resource whose state transition depends on the type λ activity.

Let us introduce the CPP model for a simple clinical pathway (see Figure 4) to show how to analyze the resource utilisation and throughput. Suppose the CPP model is defined as follows:

Figure 4

A simple clinical pathway. Patient in the place₀ can be transferred to place₁ with the completion of β activity. When the resource in the place₁ is available, patient can be treated and returns to place₀ after α activity.

(23)

The equilibrium state can only be maintained if the Markov process is irreducible that every state can be reached from all other states. Therefore CPP constructs a cyclic model in which the discharged patient will return to its initial state Patient_{place 0}. The state space of this simple CPP model is shown in Figure 5, where each state is represented by a five-tuple. For example, in state S₅: (0, 1, i, b, i), the first element 0 represents the first patient is in the place₀; the second element 1 represents the second patient is in the place₁; the third element i represents the first waiting room is idle; the fourth element b represents the second waiting room is busy; and the last element i represents the resource in the place₁ is idle.

Figure 5

The state transition diagram of a simple CPP model.

The generator matix Q has the following form:

Q=\left[\begin{array}{cccccccccc}\hfill -2\hfill & \hfill 0.5\hfill & \hfill 0.5\hfill & \hfill 0.5\hfill & \hfill 0.5\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill -1001\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill & \hfill 1000\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill -1001\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill & \hfill 1000\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill -1001\hfill & \hfill 0\hfill & \hfill 1\hfill & \hfill 0\hfill & \hfill 1000\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill -1001\hfill & \hfill 1\hfill & \hfill 0\hfill & \hfill 1000\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill -1000\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 500\hfill & \hfill 500\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill -4\hfill & \hfill 0\hfill & \hfill 0.5\hfill & \hfill 0.5\hfill \\ \hfill 3\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill -4\hfill & \hfill 0.5\hfill & \hfill 0.5\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 1.5\hfill & \hfill 0\hfill & \hfill 1.5\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill -3\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 1.5\hfill & \hfill 0\hfill & \hfill 1.5\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill -3\hfill \end{array}\right]

(24)

from which we can get the steady state distribution:

\begin{array}{c}\left[{\pi }_1,{\pi }_2,{\pi }_3,{\pi }_4,{\pi }_5,{\pi }_6,{\pi }_7,{\pi }_8,{\pi }_9,{\pi }_{10}\right]\hfill \\ =\left[0.5284,3.523*10^{-4},3.523*10^{-4},3.523*10^{-4},3.523*10^{-4},1.409*10^{-6},0.1761,0.1761,0.05895,0.05895\right]\hfill \end{array}

(25)

Therefore, we can obtain resource utilisation and throughput:

\begin{array}{cc}\hfill Utilisatio{n}_{Resourc{e}_{place1}}& =\pi \left(Resourc{e}_{-}bus{y}_{place1}\right)={\pi }_7+{\pi }_8+{\pi }_9+{\pi }_{10}=0.47\hfill \\ \hfill T& =3*Utilisatio{n}_{Resourc{e}_{place1}}=1.41\hfill \end{array}

(26)

We can use PEPA eclipse plugin [30] to simulate the developed CPP model, from which resource utilization and throughput can be directly obtained.

Critical assessments-state explosion problem

When there are many patients and multiple copies of resources involved in the system description part, the state explosion problem occurs. For instance, when there are eight patients, eight waiting rooms and three resources in Figure 4 clinical pathway, the number of states increases from 10 to 75582. Then the dimension of generator matrix Q becomes 75582 × 75582. Hence, calculating steady state distribution by solving Eqn.16 turns out to be computational intensive and requires large storage space. To address these problems, this paper uses two methods which are state aggregation and fluid analysis.

It has been pointed out in [31, 32], by exploiting the strong equivalence relations, we can generate the aggregated CTMC where the number of states can be reduced. Consider again the simple CPP model in Eqn.23. As the states S₂, S₃, S₄ and S₅ shows that there is one patient in place 1, one patient in place 0, one waiting room is busy and the resource is idle, the aggregated state S_2^{\prime } can be used to represent them without considering which patient is in place 1 and which waiting room is occupied:

(27)

Similarly, we use S_4^{{}^{\prime }} to represent S₇ and S₈, and S_5^{{}^{\prime }} to represent S₉ and S₁₀:

(28)

Therefore, the number of aggregated states is reduced to 5. The state transition diagram is shown in Figure 6, and the generator matrix Q' is as follows:

Figure 6

The aggregated state transition diagram of a simple CPP model.

Q^{\prime }=\left[\begin{array}{ccccc}\hfill -2\hfill & \hfill 2\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill -1001\hfill & \hfill 1\hfill & \hfill 1000\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill -1000\hfill & \hfill 1000\hfill & \hfill 0\hfill \\ \hfill 3\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill -4\hfill & \hfill 1\hfill \\ \hfill 0\hfill & \hfill 3\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill -3\hfill \end{array}\right]

(29)

We can get steady state distribution as:

\pi =\left[{\pi }_1,{\pi }_2,{\pi }_3,{\pi }_4,{\pi }_5\right]=\left[0.5284,0.001409,1.409*10^{-6},0.3523,0.1179\right]

(30)

and further obtain resource utilisation and throughput:

\begin{array}{cc}\hfill Utilisatio{n}_{Resourc{e}_{place1}}& =\pi \left(Resource\text{\_}bus{y}_{place1}\right)={\pi }_4+{\pi }_5=0.47\hfill \\ \hfill T& =3*Utilisatio{n}_{Resourc{e}_{place1}}=1.41\hfill \end{array}

(31)

which are similar with Eqn.26.

Although the number of states can be reduced by using the aggregation method (implemented in PEPA eclipse plugin), when the amounts of patients and resources become extremely large, the state aggregation method cannot solve the state explosion problem well. Hence, fluid analysis of stochastic process model is used in [27] to analyze systems of size 10¹⁰⁰⁰ states and beyond. This approach approximates the state space by using a set of ordinary differential equations to describe the time evolution of state components. Assume that, the mean number of component P _i at time t is denoted as N (P _i (t)), then a differential equation can be used to represent the changes in N(P _i (t)) as:

N{\left(P_i\left(t\right)\right)}^{\prime }=-\sum _{j:P_i\underrightarrow{(\alpha .,)}{P}_j}\mathsf{\text{rate of }}\alpha \mathsf{\text{ - action}}\mathsf{\text{leaving }}{P}_i+\sum _{j:P_j\underrightarrow{(\beta .,)}{P}_i}\mathsf{\text{rate of }}\beta \mathsf{\text{ - action}}\mathsf{\text{entering }}{P}_i

(32)

A set of differential equations to present the CPP model in Eqn.23 is as follows:

\begin{array}{cc}\hfill N{\left(Patien{t}_{place0}\left(t\right)\right)}^{\prime }& =-1*min\left(N\left(Patien{t}_{place0}\left(t\right)\right),N\left(Wait\text{\_}room0\text{\_}idle\left(t\right)\right)\right)\hfill \\ +3*N\left(Resource\text{\_}bus{y}_{place1}\left(t\right)\right)\hfill \\ \hfill N{\left(Patien{t}_{place1}\left(t\right)\right)}^{\prime }& =1*min\left(N\left(Patien{t}_{place0}\left(t\right)\right),N\left(Wait\text{\_}room0\text{\_}idle\left(t\right)\right)\right)\hfill \\ -3*N\left(Resource\text{\_}bus{y}_{place1}\left(t\right)\right)\hfill \\ \hfill N{\left(Wait\text{\_}room0\text{\_}idle\left(t\right)\right))}^{\prime }& =-1*min\left(N\left(Wait\text{\_}room0\text{\_}idle\left(t\right)\right)\right),N\left(Patien{t}_{place0}\left(t\right)\right))\hfill \\ +1000*N\left(Resourc{e}_{idle}\left(t\right)\right),N\left(\left(Wait\text{\_}room\text{\_}busy\left(t\right)\right)\right)\hfill \\ \hfill N{\left(Wait\text{\_}room0\text{\_}busy\left(t\right)\right))}^{\prime }& =1*min\left(N\left(Wait\text{\_}room0\text{\_}idle\left(t\right)\right)\right),N\left(Patien{t}_{place0}\left(t\right)\right))\hfill \\ -1000*N\left(Resourc{e}_{idle}\left(t\right)\right),N\left(\left(Wait\text{\_}room0\text{\_}busy\left(t\right)\right)\right)\hfill \\ \hfill N{\left(Resource\text{\_}idl{e}_{place1}\left(t\right)\right)}^{\prime }& =3*N\left(Resource\text{\_}bus{y}_{place1}\left(t\right)\right)\hfill \\ -1000*min\left(N\left(Resource\text{\_}idl{e}_{place1}\left(t\right)\right),N\left(Wait\text{\_}room0\text{\_}busy\left(t\right)\right)\right)\hfill \\ \hfill N{\left(Resource\text{\_}bus{y}_{place1}\left(t\right)\right)}^{\prime }& =-3*N\left(Resource\text{\_}bus{y}_{place1}\left(t\right)\right)\hfill \\ +1000*min\left(N\left(Resource\text{\_}idl{e}_{place1}\left(t\right)\right),N\left(Wait\text{\_}room0\text{\_}busy\left(t\right)\right)\right)\hfill \end{array}

(33)

where the initial conditions are:

\begin{array}{cc}\hfill N\mathsf{\text{(}}Patien{t}_{place0}\left(0\right))& \hfill \mathsf{\text{ = }}\mathsf{\text{2}}\\ \hfill N\mathsf{\text{(}}Patien{t}_{place1}\left(0\right))& \hfill \mathsf{\text{ = }}\mathsf{\text{0}}\\ \hfill N\left(Wai{t}_{-}room{0}_{-}idle\left(0\right)\right)& \hfill =2\\ \hfill N\mathsf{\text{(}}Wai{t}_{-}room{\mathsf{\text{0}}}_{-}busy(0))& \hfill =\mathsf{\text{0}}\\ \hfill N\mathsf{\text{(}}Resourc{e}_{-}idl{e}_{place\mathsf{\text{1}}}\left(0\right))& \hfill =\mathsf{\text{1}}\\ \hfill N\mathsf{\text{(}}Resourc{e}_{-}bus{y}_{place\mathsf{\text{1}}}(0))& \hfill =\mathsf{\text{0}}\end{array}

(34)

By solving these equations, we can obtain the time evolution of each component. The details of fluid analysis can be found in [33]. By exploring the time evolution of P _i , we can find the mean time that P _i reaches its maximum. For example, Figure 7 shows N(Resource_busy_{place 1}(t)), whose maximum can be reached within two days. With the introduction of fluid analysis, state explosion problem can be addressed.

Figure 7

The numerical solution to the ODEs representing the mean number of Resource_busy _{place 1} over time.

Calculating passage time

Based on fluid analysis, the mean passage time of a patient to be discharged can be estimated by using a stochastic probe [34]. For example, if we are interested in the time by which a Patient_{place 0}component has done its first α activity, we can attach a probe to Patient_{place 0}to remember whether it has performed α activity. The probe can be defined as follows:

\begin{array}{cc}\hfill NotFinished& \stackrel{def}{=}\left(\alpha ,3\right).Finished\hfill \\ \hfill Finished& \stackrel{def}{=}\left(\alpha ,3\right).Finished\hfill \end{array}

(35)

We can replace the Patient_{place 0}component in the system description part of the CPP model by the synchronised component . The modified differential equations are:

(36)

where the initial conditions are:

(37)

By summing the counts of all patient components of the form , we can get an approximation to the cumulative density function (CDF) for the time it takes for an individual Patient_{place 0}component to perform its first α action (see Figure 8). In this paper, we use a tool, Grouped PEPA Analyser, developed in [35] to simulate the CPP model. This tool can estimate resource utilisation and passage time based on fluid analysis.

Figure 8

The CDF of the passage time of a patient performing the first α action.

Results

In this section, the CPP modelling method is applied to model the stroke clinical pathway. It begins with the parameter settings of experiment. Then detailed description of the CPP model for stroke clinical pathway is shown. By simulating the pathway using the CPP modelling method, we can optimize the resource allocation, estimate the passage time and find the maximum throughput with the current resource distribution.

Experiment setup

In order to improve stroke service in London, the NHS investigates seven HASUs opened in 2010 including the one in Charing Cross Hospital. To ensure appropriate and consistent measurements, the SINAP database is used. Among the datasets published by NHS [36], the HASU activity data which contains clinical information for HASU in Charing Cross Hospital is shown in Table 1. It can be used to calculate transition probabilities in Figure 1. For example, there are 116 stroke patients, 27 stroke mimic patients and 15 TIA patients. Then in Figure 1, the transition probability for the patient from A&E to A&E referral is 27/(116+15+27) = 17%. Similarly, the transition probability from CT scan to A&E referral is 15/(116+27) = 10%.

Table 1 HASU activity data from NHS [36]

To build the formal model of stroke clinical pathway, parameters involved in pathway including execution time of each care activity and the number of resources available at each department should be estimated in advance. Some of them can be directly obtained from Table 1, where we can find the number of beds available in HASU is 20 and the median length of stay in HASU is 2 days. Moreover, NHS records the average time from 999 call to arrive hospital to be 62 minutes. As the FAST test is carried out on ambulance, the mean time of FAST test is therefore assumed to be 1 hour. Other parameters such as the number of stroke teams in A&E and CT scanners are not extracted directly from NHS databases, and they are estimated by consulting related documents and stroke experts. In this paper, we assume that there are 3 stroke teams and 3 CT scanners in Charing Cross Hospital. The number of ambulances is set to be unlimited, ignoring the influence of the ambulance in the model. Moreover, the mean lengths of stay in A&E and CT scan departments are assumed to be 0.75 hour and 3 hours, respectively. All the parameters and their value are summarized in Table 2.

Table 2 The settings of experiment

This paper applies CPP to model the main stream of the pathway where only the patients who can finally go to the HASU are analyzed. Hence the pathway in Figure 1 is simplified as it is shown in Figure 9.

Figure 9

Simplified stroke clinical pathway.

The CPP model of the stroke clinical pathway

The pathway model contains three parts, which are state definition, resource specification and system description. The CPP representation of these three parts is as follows.

• 1. State definition

  \begin{array}{cc}\hfill Patien{t}_{Home}& \stackrel{def}{=}\left(have\text{\_}stroke,r_{income}\right).Patien{t}_{LAS};\hfill \\ \hfill Patien{t}_{LAS}& \stackrel{def}{=}\left(do\text{\_}FAST,r_{do\text{\_}FAST}\right).Patien{t}_{A\text{\_}E\text{\_}Re\mathsf{\text{s}}us};\hfill \\ \hfill Patien{t}_{A\text{\_}E\text{\_}Re\mathsf{\text{s}}us}& \stackrel{def}{=}\left(asses\text{\_}and\text{\_}investigate,r_{assess\text{\_}and\text{\_}investigate}\right).Patien{t}_{CT\text{\_}scan};\hfill \\ \hfill Patien{t}_{CT\text{\_}scan}& \stackrel{def}{=}\left(scan,r_{scan}\right).Normal\text{\_}treat;\hfill \\ \hfill Patien{t}_{Normal\text{\_}treat}& \stackrel{def}{=}\left(treat\text{\_}HASU,r_{treat\text{\_}HASU}\right).Patien{t}_{Home};\hfill \end{array}

  (38)

• 2. Resource specification

  \begin{array}{cc}\hfill Stroke\text{\_}team\text{\_}idle& \stackrel{def}{=}\left(do\text{\_}FAST,r_{do\text{\_}FAST}\right).Stroke\text{\_}team\text{\_}busy;\hfill \\ \hfill Stroke\text{\_}team\text{\_}busy& \stackrel{def}{=}\left(assess\text{\_}and\text{\_}investigate,r_{assess\text{\_}and\text{\_}investigate}\right).Stroke\text{\_}team\text{\_}idle;\hfill \\ \hfill Wait\text{\_}room1\text{\_}idle& \stackrel{def}{=}\left(assess\text{\_}and\text{\_}investigate,r_{assess\text{\_}and\text{\_}investigate}\right).Wait\text{\_}room1\text{\_}busy;\hfill \\ \hfill Wait\text{\_}room1\text{\_}busy& \stackrel{def}{=}\left(wait\text{\_}scan,r_{wait\text{\_}for\text{\_}calling}\right).Wait\text{\_}room1\text{\_}idle;\hfill \\ \hfill Scan\text{\_}idle& \stackrel{def}{=}\left(wait\text{\_}scan,r_{wait\text{\_}for\text{\_}calling}\right).Scan\text{\_}busy;\hfill \\ \hfill Scan\text{\_}busy& \stackrel{def}{=}\left(scan,r_{scan}\right).Scan\text{\_}idle;\hfill \\ \hfill Wai{t}_{-}room{2}_{-}idle& \stackrel{def}{=}\left(scan,r_{scan}\right).Wai{t}_{-}room{2}_{-}busy;\hfill \\ \hfill Wai{t}_{-}room{2}_{-}busy& \stackrel{def}{=}\left(wait\text{\_}bed,r_{wait\text{\_}for\text{\_}calling}\right).Wai{t}_{-}room{2}_{-}idle;\hfill \\ \hfill Bed\text{\_}idle& \stackrel{def}{=}\left(wait\text{\_}bed,r_{wait\text{\_}for\text{\_}calling}\right).Bed\text{\_}busy;\hfill \\ \hfill Bed\text{\_}busy& \stackrel{def}{=}\left(treat\text{\_}HASU,r_{treat\text{\_}HASU}\right).Bed\text{\_}idle;\hfill \end{array}

  (39)

• 3. System description The third part is the system description as follows:

  

  (40)

In order to get the average patient incoming rate to 4, the parameter Num _patient is set to 1000 and r _income is 0.004.

Three performance analysis scenarios

Three scenarios are tested in this subsection to show the application of the CPP model in performance analysis. The CPP model can detect the optimal resource allocation, estimate the passage time and determine the maximum throughput of the healthcare system.

Scenario 1: Resource optimization

Initially there are 3 stroke teams, 3 scanners and 20 beds available in the stroke clinical pathway. As the average patient input is around 4, it may happen that the resource utilisation is low. Hence, we investigate the influence of resource quantity on system throughput. By varying the numbers of stroke teams, scanners and beds, we can find from Figure 10 that the largest throughput that can be achieved is 3.95 patients/day, slightly smaller than 4 patients/day. We cannot have the maximum throughput value exactly equal to the number of input patients. It can be explained from the definition of parallel input patients Patient _Home [Num _patient ], where Num _patient is 1000 and the input rate is 0.004. Theoretically, the number of input patients per day should be 1000 * 0.004 = 4. On the first day, 4 patients on average fall ill and are treated sequentially through the clinical pathway. As the mean time for the patient staying in HASU department is 2 days, it is possible that these 4 patients are still in the pathway on the next day. Hence, they cannot return to the state Patient _Home on the second day, meaning that the number of patients at Patient _Home is slightly smaller than 1000. Therefore, there is a trivial difference between the maximum throughput and the number of input patients. However, this small difference does not influence the performance analysis process.

Figure 10

Resource optimization of clinical pathway. The number of scanners varies from 1 to 3 and the number of beds ranges between 1 and 20 in each graph. The number of stroke team is set to 1 in (a), 2 in (b) and 3 in (c) respectively. The maximum throughput of 3.95 can be achieved in (a), where there are 1 stroke team, 1 scanner and 8 beds.

Figure 10 is used to show how our performance analysis result guides medical staff to find optimal resource allocation, i.e., the amount of resource is kept minimal while still maintaining the maximum throughput in the clinical pathway. The three 3D graphs look similar and they actually demonstrate the process of reducing redundant resources while keeping the throughput unchanged. In these 3D graphs, we give two examples. In the first example, the numbers of beds and scanners are reduced from 20/3 to 8/1, respectively. This example shows that twelve redundant bed resources and two scanner resources can be removed and the clinical pathway's throughput is not influenced. The second example further reduces two redundant stroke team resources and keeps the throughput unchanged.

We can obtain the optimal number of each resource in Table 3 and find that the resource utilisation can be increased while the system throughput is maintained. It is notable that the CPP model can find the optimal resource allocation with varying number of input patients. For example, with an input of 4 patients per day, the optimal resource allocation is 1 stroke team, 1 scanner and 8 beds; if the input rate increases to 0.006, meaning that there are 6 patients falling ill every day, the optimal resource allocation is found to be 1 stroke team, 1 scanner and 12 beds.

Table 3 Comparison of resource utilisation: The utilisations of resources resulting from the model with initial and optimal parameter sets are compared.

Scenario 2: Passage time estimation

Besides estimating the system throughput and resource utilisation, CPP model can further predict the mean passage time of a patient with the introduction of a stochastic probe as follows:

\begin{array}{cc}\hfill NotFinished& \stackrel{def}{=}\left(treat\text{\_}HASU,r_{treat\text{\_}HASU}\right).Finished;\hfill \\ \hfill Finished& \stackrel{def}{=}\left(treat\text{\_}HASU,r_{treat\text{\_}HASU}\right).Finished;\hfill \end{array}

(41)

The state NotFinished becomes Finished once the activity whose action type is treat_HASU is completed. When we attach this probe to the patient state component as follows:

(42)

the mean time of a patient from falling ill to leaving the HASU can be obtained. Figure 11 shows the probability that a patient is discharged from the HASU within a specific time duration when there is 1 stroke team, 1 scanner and 8 beds available. We can see that 90% of patients can be discharged within 2.5 days and only 14% of patients can be discharged within 1 day. Estimation of the whole passage time not only tells patients when they can be discharged, but also informs doctors the resource occupation time.

Figure 11

Passage time. It shows the probability that a patient can be discharged within a specific time. This figure is obtained when the model uses an optimal parameter set. When the model uses the initial parameter set, we get the same figure, showing that the system passage time remains the same.

Scenario 3: Maximum input estimation

We can also examine the maximum throughput with different parameter settings. For example, if the pathway model uses the initial parameters, in Figure 12 we can see that when the number of input patients increases from 1 to 100, the maximum throughput is around 10 patients/day. When the input number is 10, the throughput reaches 9.74 patients/day, slightly smaller than the maximum value (this difference has been discussed in the Resource optimization subsection). Any further increase in the number of input patients has trivial contribution to the system throughput.

Figure 12

Maximum throughput. By varying the number of input patients, the maximum system throughput can be obtained, where the model uses the initial parameter settings.

Therefore, by simulating the CPP model, we can find the maximum number of input patients that can be supported by the healthcare system. This maximum input estimation is significant for hospital to determine whether it can accept more stroke patients or not. For example, suppose there are already 10 patients on average coming to the hospital from the surrounding area. If the national health community asks whether this hospital can serve patients from larger area, meaning that more than 10 patients will arrive every day, by estimating the maximum input this hospital can determine whether this is possible and whether more resources are required to support the increased number of patients.

Conclusions

This paper introduces a clinical pathway management platform, ICPA, whose core element is the stochastic model CPP. CPP can unambiguously describe a variety of elements in a clinical pathway. Using CPP, the clinical pathway can be quantitatively analyzed and this performance analysis can provide a range of useful information for facilitating clinical pathway management. A real-world stroke clinical pathway, obtained from Charing Cross hospital of Imperial College London, is employed to demonstrate the practical applicability of ICPA. Three scenarios were tested to show that ICPA can assist hospitals to improve healthcare system by 1) reducing redundant resources 2) predicting patient passage time 3) estimating the maximum patient input. The approach presented in this paper can be used effectively to manage the clinical pathways within one hospital. There are multiple revenues for extending the work and we discuss four possible directions below.

• 1. CPP model can be extended to incorporate survival analysis by collecting clinical data including patient recovery speed and survival rate. The augmented model can then be used to examine the influence of treatment delay on patients' recovery processes. Therefore, the results from the ICPA can be used to increase patient recovery probability and decrease the recovery time.

• 2. Multiple hospitals can be managed concurrently using ICPA. At present, there are seven hospitals in London with HASU departments to treat stroke patients. ICPA can be extended to combine their clinical data to build a uniform model. By analysing this model, patients can be dynamically scheduled to different hospitals in order to optimise their treatment process.

• 3. The stroke clinical pathway discussed in this paper is described in the coarse granularity. With clinical data, ICPA can be applied to analyse an element in the clinical pathway in the fine granularity. For example, the HASU department, one element of the stroke clinical pathway, needs to treat patients with multiple therapies. If this type of information can be obtained and modelled by CPP, ICPA can view HASU as a clinical pathway and conducts performance analysis on it.

• 4. A user friendly interface can be build to facilitate medical staff's access to ICPA. Currently, ICPA only provides analysis results such as optimal resource allocation to medical staff. By interpreting these performance analysis results, medical staff can optimally re-allocate medical resources and re-configure treatment process. In the future, we plan to develop a user portal to help medical staff construct the clinical pathway model by themselves.