Reliability Analysis of a Fuel Supply System in Automobile Engine

Similar documents
RELIABILITY ANALYSIS OF A FUEL SUPPLY SYSTEM IN AN AUTOMOBILE ENGINE

Stochastic Analysis of a Two-Unit Cold Standby System with Arbitrary Distributions for Life, Repair and Waiting Times

COST-BENEFIT ANALYSIS OF A SYSTEM OF NON- IDENTICAL UNITS UNDER PREVENTIVE MAINTENANCE AND REPLACEMENT

Stochastic Modelling of a Computer System with Software Redundancy and Priority to Hardware Repair

Reliability Analysis of Two-Unit Warm Standby System Subject to Hardware and Human Error Failures

Probabilistic Analysis of a Desalination Plant with Major and Minor Failures and Shutdown During Winter Season

Cost-Benefit Analysis of a System of Non-identical Units under Preventive Maintenance and Replacement Subject to Priority for Operation

Reliability and Economic Analysis of a Power Generating System Comprising One Gas and One Steam Turbine with Random Inspection

OPTIMIZATION OF COST MAINTENANCE AND REPLACEMENT FOR ONE-UNIT SYSTEM RELIABILITY MODEL WITH POST REPAIR

STOCHASTIC MODELLING OF A COMPUTER SYSTEM WITH HARDWARE REDUNDANCY SUBJECT TO MAXIMUM REPAIR TIME

Stochastic and Cost-Benefit Analysis of Two Unit Hot Standby Database System

Stochastic Analysis of a Cold Standby System with Server Failure

Reliability Analysis of a Single Machine Subsystem of a Cable Plant with Six Maintenance Categories

Stochastic analysis of edible oil refinery industry

Comparative Analysis of Two-Unit Hot Standby Hardware-Software Systems with Impact of Imperfect Fault Coverages

Reliability Analysis of a Two Dissimilar Unit Cold Standby System with Three Modes Using Kolmogorov Forward Equation Method

Research Article Stochastic Analysis of a Two-Unit Cold Standby System Wherein Both Units May Become Operative Depending upon the Demand

A Comparative Study of Profit Analysis of Two Reliability Models on a 2-unit PLC System

ANALYSIS FOR A PARALLEL REPAIRABLE SYSTEM WITH DIFFERENT FAILURE MODES

Stochastic Modeling of a Computer System with Software Redundancy

Comparative study of two reliability models on a two -unit hot standby system with unannounced failures

3-Unit System Comprising Two Types of Units with First Come First Served Repair Pattern Except When Both Types of Units are Waiting for Repair

STOCHASTIC ANALYSIS OF A TWO UNIT SYSTEM WITH VACATION FOR THE REPAIR FACILITY AFTER m REPAIRS

Analysis for Parallel Repairable System with Degradation Facility

Stochastic Modeling of Repairable Redundant System Comprising One Big Unit and Three Small Dissimilar Units

Unique Journal of Engineering and Advanced Sciences Available online: Research Article

by: Mohammad El-Moniem Soleha

International Journal on Mechanical Engineering and Robotics (IJMER)

Stochastic outlook of two non-identical unit parallel system with priority in repair

Review Paper Machine Repair Problem with Spares and N-Policy Vacation

Analysis of a Machine Repair System with Warm Spares and N-Policy Vacations

Availability and Reliability Analysis for Dependent System with Load-Sharing and Degradation Facility

Probabilistic Analysis of a Computer System with Inspection and Priority for Repair Activities of H/W over Replacement of S/W

Reliability of an (M, M) Machining System with Spares

Reliability Analysis of a Seven Unit Desalination Plant with Shutdown during Winter Season and Repair/Maintenance on FCFS Basis

Markov Chain Profit Modelling and Evaluation between Two Dissimilar Systems under Two Types of Failures

IEOR 4106: Introduction to Operations Research: Stochastic Models Spring 2011, Professor Whitt Class Lecture Notes: Tuesday, March 1.

Availability. M(t) = 1 - e -mt

STOCHASTIC REPAIR AND REPLACEMENT OF A STANDBY SYSTEM

Linmin Hu, Jiandong Li and Wenming Fang. Received November 2007; accepted January 2008

COMPARATIVE RELIABILITY ANALYSIS OF FIVE REDUNDANT NETWORK FLOW SYSTEMS

Batch Arrival Queuing Models with Periodic Review

Renewal theory and its applications

Stochastic Processes

Markov Reliability and Availability Analysis. Markov Processes

Queueing. Chapter Continuous Time Markov Chains 2 CHAPTER 5. QUEUEING

Reliability Engineering I

A hybrid Markov system dynamics approach for availability analysis of degraded systems

International Journal on Mechanical Engineering and Robotics (IJMER)

Reading: Karlin and Taylor Ch. 5 Resnick Ch. 3. A renewal process is a generalization of the Poisson point process.

Exercises Stochastic Performance Modelling. Hamilton Institute, Summer 2010

An M/M/1 Queue in Random Environment with Disasters

RELIABILITY OF REPAIRABLE k out of n: F SYSTEM HAVING DISCRETE REPAIR AND FAILURE TIMES DISTRIBUTIONS

1. Reliability and survival - basic concepts

2905 Queueing Theory and Simulation PART III: HIGHER DIMENSIONAL AND NON-MARKOVIAN QUEUES

Stochastic process. X, a series of random variables indexed by t

Dependable Computer Systems

Chapter 8. Calculation of PFD using Markov

Chapter 5. Continuous-Time Markov Chains. Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan

Cost Analtsis for a Nuclear Power Plant with Standby Redundant Reactor Vessel

Monte Carlo Simulation for Reliability Analysis of Emergency and Standby Power Systems

Contents Preface The Exponential Distribution and the Poisson Process Introduction to Renewal Theory

IEOR 6711: Stochastic Models I, Fall 2003, Professor Whitt. Solutions to Final Exam: Thursday, December 18.

STEADY-STATE BEHAVIOR OF AN M/M/1 QUEUE IN RANDOM ENVIRONMENT SUBJECT TO SYSTEM FAILURES AND REPAIRS. S. Sophia 1, B. Praba 2

Statistics 150: Spring 2007

An M/M/1 Retrial Queue with Unreliable Server 1

Markov Repairable Systems with History-Dependent Up and Down States

Availability Analysis of Refining System of a Sugar Plant Using Markov Process

Recap. Probability, stochastic processes, Markov chains. ELEC-C7210 Modeling and analysis of communication networks

Exam of Discrete Event Systems

Asymptotic Confidence Limits for a Repairable System with Standbys Subject to Switching Failures

EE 445 / 850: Final Examination

Markov Processes Hamid R. Rabiee

Chapter 2 SOME ANALYTICAL TOOLS USED IN THE THESIS

Markov Chains (Part 4)

MODELLING AND ESTIMATION STUDY OF COMPLEX RELIABILITY SYSTEMS

Availability Optimization for Coal Handling System using Genetic Algorithm

Reliability evaluation of a repairable system under fuzziness

57:022 Principles of Design II Final Exam Solutions - Spring 1997

Reliability and Availability Analysis of Uncaser System in A Brewary Plant

2. Transience and Recurrence

RELIABILITY AND AVAILABILITY ANALYSIS OF TWO DISSIMILAR UNITS BY USING LAPLACE TRANSFORMS Khaled Moh.El-said 1, Amany S. Mohamed 2, Nareman.

Reliability Analysis of Pharmaceutical Plant Using Matlab-Tool

Markovian techniques for performance analysis of computer and communication systems

Redundant Array of Independent Disks

Optimal Time and Random Inspection Policies for Computer Systems

The Transition Probability Function P ij (t)

Irreducibility. Irreducible. every state can be reached from every other state For any i,j, exist an m 0, such that. Absorbing state: p jj =1

T. Liggett Mathematics 171 Final Exam June 8, 2011

Queuing Theory. Richard Lockhart. Simon Fraser University. STAT 870 Summer 2011

GI/M/1 and GI/M/m queuing systems

1 IEOR 4701: Continuous-Time Markov Chains

Failure modeling and maintenance optimization for a railway line

Example: physical systems. If the state space. Example: speech recognition. Context can be. Example: epidemics. Suppose each infected

CDA6530: Performance Models of Computers and Networks. Chapter 3: Review of Practical Stochastic Processes

Glossary availability cellular manufacturing closed queueing network coefficient of variation (CV) conditional probability CONWIP

An Overview of Methods for Applying Semi-Markov Processes in Biostatistics.

Multi-State Availability Modeling in Practice

ISyE 6650 Probabilistic Models Fall 2007

Operations Research Letters. Instability of FIFO in a simple queueing system with arbitrarily low loads

Transcription:

ISBN 978-93-84468-19-4 Proceedings of International Conference on Transportation and Civil Engineering (ICTCE'15) London, March 21-22, 2015, pp. 1-11 Reliability Analysis of a Fuel Supply System in Automobile Engine Chitranjan Sharma Associate Professor, Department of Mathematics, Holkar Science PG College, Indore, India Email: drcsharma3@gmail.com Abstract: The present paper deals with the analysis of a fuel supply system in an automobile engine of a four wheeler which is having both the option of fuel i.e. PETROL and CNG. Since CNG is cheaper than petrol so the priority is given to consume CNG as compared to petrol. An automatic switch is used to start petrol supply at the time of failure of CNG supply. Using regenerative point technique with Markov renewal process, the reliability characteristics which are useful to system designers are obtained. Keywords: Reliability, Redundancy, Repair Time, Transition Probability, Regenerative Points, Markov Renewal Process. 1. Introduction Many authors working in the field of system reliability have analysed various engineering systems by using different sets of assumptions. Several authors developed and analysed many hypothetical systems, but there is a need to work on the systems which are used very commonly and related to the real practical situation. Goel et al. (1985) provided studied a system with intermittent repair and inspection under abnormal weather and also provided cost benefit analysis of the system. Joorel (1990) calculated MTSF and availability analysis of a complex system composed of two sub-systems in series subject to random shocks with single repair facility. Reddy and Rao (1993) showed how to optimize the parallel systems subject to two modes of failure and repair provision. Agnihotri et al. (2008) studied and carried out reliability analysis of a system of boiler used in Readymade garment industry. Chander and Singh (2009) studied a reliability model of 2-out-of-3 redundant system subject to degradation after repair. Agnihotri et al. (2010) presented reliability analysis of a system of wheels in a four wheeler. Marko Gerbec (2010) introduced reliability analysis of a natural gas pressure regularity installation. EL-Damcese and Tamraz, N.S. (2012) presented analysis of a parallel redundant system with different failure mode. Keeping the above in view, we in the present chapter analysed a system of fuel supply system in an automobile engine of a four wheeler which is having both the option of fuel i.e. PETROL and CNG. Since CNG is cheaper than petrol so the priority is given to consume CNG as compared to petrol. An automatic switch is used to start petrol supply at the time of failure of CNG supply. Using regenerative point technique with Markov renewal process, the following reliability characteristics which are useful to system designers are obtained. Transition and steady state transition probabilities (2) Mean Sojourn times in various states (3) Mean time to system failure (MTSF) (4) Point wise and Steady state availability of the system (5) Expected Busy period of the repairman in (0,t] (6) Expected number of visits by the repairman in (0,t] http://dx.doi.org/10.17758/ur.u0315301 1

2. Model Description And Assumptions The fuel system of an automobile engine consists of both the facilities i.e. CNG and petrol supply. Since CNG is cheaper than petrol so the priority will be given to CNG for both use, and repair, to run the four wheeler. Initially the four wheeler starts operation with CNG and the petrol facility is kept as standby. Both CNG and petrol has only two modes i.e. normal and failure. Whenever CNG system fails petrol starts operation instantaneously with the help of an automatic switch, provided that the switch is good at the time of need, otherwise the petrol supply will wait until the switch is repaired. Probability that the automatic switch will be in good position at the time of need is fixed. Since the consumption of petrol is too costly as compared to CNG, so there is a provision of rest to petrol supply after continuous working for a random amount of time. A single repair facility is available in the system to repair the jobs related to CNG, petrol supply and automatic switch. The failure time distributions of CNG and petrol supply are exponential with different parameters while the repair time distributions of jobs related to CNG, petrol and automatic switch are arbitrary. Also the distribution of time after which rest will be provided to petrol and its rest time are exponential with different parameter. 3. Notation and Symbols C NS : CNG is in normal supply P NS : Petrol is in normal supply P S : Petrol supply is in standby position C fr : Failed CNG supply under repair C fwr : Failed CNG supply waiting for repair P rest : Petrol is in rest position P fr : Failed petrol supply under repair P fwr : Failed petrol supply waiting for repair AS r : Automatic switch under repair : Constant failure rate of CNG supply : Constant failure rate of petrol supply : Constant rate of completing rest for petrol supply : Constant rate of time after which rest is to be provide to petrol supply g(.), G(.) : pdf and cdf of repair time distribution of CNG supply h(.), H(.) : pdf and cdf of repair time distribution of petrol supply k(.), K(.) : pdf and cdf of repair time distribution of automatic switch p(=1-q) : Probability that automatic switch will be in good position at the time of need. Using the above notation and symbols the following are the possible states of the fuel system of an automobile engine system: Up States S 0 (C NS, P S ) S 1 (C fr, P NS ) S 5 (C NS, P rest ) http://dx.doi.org/10.17758/ur.u0315301 2

S 6 (C NS, P fr ) Down States S 2 (C fwr, P S, AS r ) S 3 (C fr, P rest ) S 4 (C fr, P fwr ) The transitions between the above states are shown in Figure.1. 4. Transition Probabilities Let T 0 (=0), T 1,T 2,... be the epochs at which the system enters the states S i E. Let X n denotes the state entered at epoch T n+1 i.e. just after the transition of T n. Then {T n,x n } constitutes a Markov-renewal process with state space E and Q ik (t) = Pr[X n+1 = S k, T n+1 - T n t X n = S i ] is semi Markov-Kernal over E. The stochastic matrix of the embedded Markov chain is P = p ik = lim Q ik (t) = Q() t Thus p 01 = p p 02 = q p 10 = (+) p 13 = (+) p 14 = p (4) 16 = [1- (+)] p 21 = p 46 = 1 p 30 = [ (+)- ()] p 33 = [(--) - (+) + (+) ()] http://dx.doi.org/10.17758/ur.u0315301 3

p (1,4) 36 = [(--) - (+) + (+) ()] p 35 = () p 50 = p 53 = p 60 = 1 - () p 64 = ().(3-16) 5. Mean Sojourn Times The mean time taken by the system in a particular state S i before transiting to any other state is known as mean sojourn time and is defined as i = 0 P[T>t] dt T is the time of stay in state S i by the system. To calculate mean sojourn time I in state S i, we assume that so long as the system is in state S i, it will not transit to any other state. Therefore; 0 = 1 = [1 - (+)] 2 = 0 (t)dt = m 1 (say) 3 = [1 - ()] 4 = 0 (t)dt = m 2 (say) 5 = 6 = [1 - ()].(17-23) Contribution to Mean Sojourn Time For the contribution to mean sojourn time in state S i E and non-regenerative state occurs, before transiting to S j E, i.e., m ij = - t.q ij (t) dt = -q * ij (0) Therefore, m 01 = p. 0 t.e -t dt m 02 = q. 0 t.e -t dt m 10 = 0 t.e -(+)t g(t)dt m 13 =. 0 t.e -(+)t (t)dt m 14 = 0 t.e -(+)t (t)dt m 21 = 0 t.k(t)dt m 35 = 0 t.e -t g(t)dt m 46 = 0 t.g(t)dt m 50 = 0 t.e -(+)t dt m 53 = 0 t.e -(+)t dt m 60 = 0 t.e -t h(t)dt m 64 = 0 t.e -t (t)dt http://dx.doi.org/10.17758/ur.u0315301 4

m (4) 16 = 0 t.(1 e -(+)t ) dg(t) m 30 = 0 t.(e -(+)t e -t ) dg(t) m 33 = 0 t.(e -(+)t e -t ) (t) dt m (1,4) 36 = 0 t.[(--) - e -(+)t (+)e -t ]dg(t).(24-39) Hence using (24-39) the following relations can be verified as follows m 01 + m 02 = p. 0 t.e -t dt + q. 0 t.e -t dt = 0 t.e -t dt = = 0 m 10 + m 13 + m (4) 16 = 0 t.e -(+)t dg(t) +. 0 t.e -(+)t (t)dt + 0 t.(1 e -(+)t ) dg(t) = n 1 (say) m 21 = 0 t.k(t)dt = 2 = m 1 m 35 + m 30 + m 33 + m (1,4) 36 = 0 t.e -t dg(t) + 0 t.(e -(+)t e -t ) dg(t) + 0 t.(e -(+)t e -t ) (t) dt + 0 t.[(--) - e -(+)t (+)e -t ]dg(t) = n 2 (say) m 46 = 0 t.g(t)dt = 4 = m 2 m 50 + m 53 = 0 t.e -(+)t dt + 0 t.e -(+)t dt = = 5 m 60 + m 64 = 0 t.e -t dh(t) + 0 t.e -t (t)dt = [1 - ()] = 6.(40-46) http://dx.doi.org/10.17758/ur.u0315301 5

6. Reliability and Mean Time to System Failure To obtain the reliability of the system we regard all the failed states as absorbing states. If T i be the time to system failure when it starts operation from state S i then the reliability of the system is given by R i (t) = Pr[T i >t] Using the probabilistic arguments in view of reliability the following recursive relations can be easily obtained. R 0 (t) = Z 0 (t) + q 01 (t) R 1 (t) + q 02 (t) R 2 (t) R 1 (t) = Z 1 (t) + q 10 (t) R 0 (t) + q 13 (t) R 3 (t) R 2 (t) = Z 2 (t) + q 21 (t) R 1 (t) R 3 (t) = Z 3 (t) + q 30(t) R 0 (t) + q 33(t) R 3 (t) + q 35 (t) R 5 (t) R 5 (t) R 5 (t) = Z 5 (t) + q 50 (t) R 0 (t) + q 53 (t) R 3 (t) R 6 (t) = Z 6 (t) + q 60 (t) R 0 (t) Z 0 (t) = e -t Z 1 (t) = e -(+)t (t).(47-52) Z 2 (t) = (t) Z 3 (t) = [e -(+)t (+)e -t )] (t) Z 5 (t) = e -(+)t Z 6 (t) = e -t (t).(53-58) Taking Laplace transform of the above equations (47-52) and solving them for R* 0 (s) by omitting the argument s for brevity, we get R* 0 (s) = N 1 (s)/d 1 (s).(59) N 1 (s) = (1 q* 33 -q* 35 q* 53 )(Z* 0 + Z* 1 q* 01 + Z* 1 q* 02 q* 21 and + Z* 2 q* 02 ) + q* 13 (Z* 3 + Z* 5 q* 35 )(q* 01 + q* 02 q* 21 ).(60) D 1 (s) = (1 q* 33 -q* 35 q* 53 )(1 - q* 01 q* 10 - q* 02 q* 21 q* 10 ) - q* 13 (q* 30 + q* 35 q* 50 )(q* 01 + q* 02 q* 21 ).(61) Now the reliability of the system can be obtained by taking inverse Laplace transform of (59) for well known failure time distributions. Also the Mean time to system failure (MTSF) when the system starts from the state S 0 can be obtained as Now, E(T 0 ) = lim R* 0 (s) = N 1 (0)/D 1 (0) s0.(62) Z* 0 (0) = 0 e -t dt = = 0 Z* 1 (0) = 0 e -(+)t (t)dt = [1 - (+)] = 1 http://dx.doi.org/10.17758/ur.u0315301 6

Z* 2 (0) = 0 (t)dt = m 1 Z* 3 (0) = 0 [e -(+)t (+)e -t )] (t)dt = L (say) Z 5 (t) = 0 e -(+)t dt = = 5 Therefore, and Z 6 (t) = 0 e -t (t) dt = [1 - ()] = 6.(63-68) N 1 (0) = (1 p 33 -p 35 p 53 )( 0 + 1 + m 1 p 02 ) + p 13 (L + 5 p 35 ) D 1 (0) = p 14 (1 p 33 p 35 p 53 ) + p 13 p (1,4) 36 Hence, E(T 0 ) = N 1 /D 1 N 1 and D 1 are same as in (69) and (70). 7. Mean Up-Time of The System.(71).(69).(70) Let A i (t) be the probability that starting from state S i the system will remains up at epoch t. Using probabilistic arguments the following recursive relations can be easily obtained A 0 (t) = M 0 (t) + q 01 (t)a 1 (t) + q 02 (t)a 2 (t) A 1 (t) = M 1 (t) + q 10 (t)a 0 (t) + q 13 (t)a 3 (t) + q (4) 16(t)A 6 (t) A 2 (t) = q 21 (t)a 1 (t) A 3 (t) = M 3 (t) + q 30(t)A 0 (t) + q 33(t)A 3 (t) + q 35 (t)a 5 (t) + q (1,4) 36(t)A 6 (t) A 4 (t) = q 46 (t)a 6 (t) A 5 (t) = q 50 (t)a 0 (t) + q 53 (t)a 3 (t) A 6 (t) = M 6 (t) + q 60 (t)a 0 (t) + q 64 (t)a 4 (t).(72-78) M 0 (t) = e -t M 1 (t) = e -(+)t (t) M 3 (t) = e -(++)t (t) M 6 (t) = e -t (t).(79-82) Taking laplace transform of above equations (72-78) and solving for pointwise availability A* 0 (s), by omitting the arguments s for brevity, one gets N 2 (s) A* 0 (s) =.(83) D 2 (s) N 2 (s) = (1 - q* 46 q* 64 )(1 - q* 33 - q* 35 q* 53 )[M* 0 + M* 1 (q* 01 + q* 02 q* 21 )] + q* 13 (q* 01 + q* 02 q* 21 ) [(1 - q* 46 q* 64 )q* 35 M* 5 + q* (1,4) 36M* 6 ] + M* 6 q* (4) 16(q* 01 http://dx.doi.org/10.17758/ur.u0315301 7

and + q* 02 q* 21 )(1 - q* 33 - q* 35 q* 53 ).(84) D 2 (s) = (1 - q* 46 q* 64 )(1 - q* 33 - q* 35 q* 53 )[1 q* 01 (q* 01 + q* 02 q* 21 )] - q* 13 (q* 01 + q* 02 q* 21 )[(1 - q* 46 q* 64 ).(1 - q* 33 - q* 35 q* 53 )- q* (1,4) 36(1 - q* 60 - q* 46 q* 64 )].(85) Thus, Also, - (q* 01 + q* 02 q* 21 )(1 - q* 33 - q* 35 q* 53 )q* (4) 16q* 60 D 2 (0) = p 60 (1 p 33 p 35 p 53 )( 0 + n 1 + m 1 p 02 ) + [p 13 p (1,4) 36 + p (4) 16(1 p 33 p 35 p 53 )( 6 + m 2 p 64 ).(86) M* 0 (0) = 0 e -t dt = 1/ = 0 M* 1 (0) = 0 e -(+)t (t) dt = 1 and then Therefore, M* 3 (0) = 0 (e -(+)t - e -t ). (t)dt = = L 1 (say) M* 6 (0) = 0 e -t (t) dt = 6.(87-90) N 2 (0) = (1 - p 33 - p 35 p 53 )[p 60 ( 0 + 1 ) + p (4) 16 6 ] + p 13 [p (1,4) 36 6 + p 60 (p 35 5 + L 1 )].(91) A 0 = lim U 0 (t) = lim s.u* 0 (s) t s0 = lim N 2 (s)/d 2 (s) = N 2 /D 2.(92) s0 Where N 2 and D 2 are same as in equations (92) and (86) respectively. 8. Mean Down-Time Of The System Let B i (t) be the probability that starting from regenerative down state S j the system will remains down at epoch t. Using probabilistic arguments the following recursive relations among Bi(t) s can be easily obtained B 0 (t) = q 01 (t)b 1 (t) + q 02 (t)b 2 (t) B 1 (t) = q 10 (t)b 0 (t) + q 13 (t)b 3 (t) + q (4) 16(t)B 6 (t) B 2 (t) = M 2 (t) + q 21 (t)b 1 (t) B 3 (t) = M 3 (t) + q 30 (t)b 0 (t) + q 33(t)B 3 (t) + q 35 (t)b 5 (t) + q (1,4) 36(t)B 6 (t) B 4 (t) = q 46 (t)b 6 (t) B 5 (t) = q 50 (t)b 0 (t) + q 53 (t)b 3 (t) B 6 (t) = q 60 (t)b 0 (t) + q 64 (t)b 4 (t).(93-99) M 2 (t) = (t) M 3 (t) = e -t (t).(100-101) http://dx.doi.org/10.17758/ur.u0315301 8

Taking Laplace transform of above equations (93-99) and solving them for B* 0 (s), by omitting the arguments s for brevity, one gets N 3 (s) B* 0 (s) =.(102) D 3 (s) N 3 (s) = (1 - q* 46 q* 64 )(1 - q* 33 - q* 35 q* 53 )M* 2 q* 02 + q* 13 (q* 01 + q* 02 q* 21 )(1 - q* 46 q* 64 )M* 3.(103) and D 3 (s) is same as D 2 (s) in equation (85). Now, Then, Therefore, M* 2 (0) = 0 (t) dt = 2 = m 1 M* 3 (0) = 0 e -t (t) dt = 3.(104-105) N 3 (0) = p 60 [(1 - p 33 - p 35 p 53 )p 02 m 1 + p 13 3 ] B 0 = lim A 0 (t) = lim s.b* 0 (s) t s0.(106) = lim N 3 (s)/d 3 (s) = N 3 (0)/D 3 (0) = N 3 /D 3.(107) s0 N 3 is same as in (106) and D 3 is as D 2 in (86). 9. Expected Number of Repairs of Failed Unit Let we define, V i (t) as the expected number of repairs by the repairman in (0,t] given that the system initially started from regenerative state S i at t=0. Then following recurrence relations among V i (t) s can be obtained as; V 0 (t) = Q 01 (t)$v 1 (t) + Q 02 (t)$v 2 (t) V 1 (t) = Q 10 (t)$[1 + V 0 (t)] + Q 13 (t)$v 3 (t) + Q (4) 16(t)$[1+V 6 (t)] V 2 (t) = Q 21 (t)$v 1 (t) V 3 (t) = Q 30(t)$[1 + V 0 (t)] + Q 33(t)$V 3 (t) + Q 35 (t)$[1 + V 5 (t)] + Q (1,4) 36(t)$[1+ V 6 (t)] V 4 (t) = Q 46 (t)$[1 + V 6 (t)] V 5 (t) = Q 50 (t)$v 0 (t) + Q 53 (t)$v 3 (t) V 6 (t) = Q 60 (t)$[1 + V 0 (t)] + Q 64 (t)$v 4 (t).(108-114) Taking laplace stieltjes transform of the above equations (108-114) and the solution of expressed by omitting the argument s for brevity as 0(s) may be 0(s) = N 4 (s)/d 4 (s)...(115) Where N 4 (s) = (1-46 64)(1-33 - 35 53)( 10 + (4) 16 )( 01 http://dx.doi.org/10.17758/ur.u0315301 9

+ 02 21) + (4) 16 ( 46 64 + 60)(1-33 - 35 53)( 01 + 02 21) + 01 13[( 30 + 35 And + (1,4) 36 )(1-46 64) + (1,4) 36 ( 46 64 + 60)].(116) D 4 (s) = (1-46 64)(1-33 - 35 53)[1-10( 01 + 02 21)] - 13( 01 + 02 21)[(1-46 64)(1-33 - 35 53) - (1,4) 36 )(1-60 - 46 64)] - ( 01 + 02 21)(1 - Now, (4) 33-35 53) 16 60.(117) N 4 (0) = (1 - p 33 - p 35 p 53 )(p 60 (1 p 13 ) + p (4) 16) + p 01 p 13 [p 60 (1 p 33) + p (1,4) 36].(118) Therefore, in steady state the expected number of repairs for failed unit is V 0 = lim [V 0 (t)/t] = lim s 0(s) = N 4 /D 4...(119) t s 0 N 4 is same as (118) and D 4 is same as D 2 in (86). 10. Expected Number of Repairs of Automatic Switch Let we define, V i (t) as the expected number of repairs for automatic switch by the repairman in (0,t] given that the system initially started from regenerative state S i at t=0. Then following recurrence relations among V i (t) s can be obtained as; V 0 (t) = Q 01 (t)$v 1 (t) + Q 02 (t)$v 2 (t) V 1 (t) = Q 10 (t)$v 0 (t) + Q 13 (t)$v 3 (t) + Q (4) 16(t)$V 6 (t) V 2 (t) = Q 21 (t)$v 1 (t) V 3 (t) = Q 30(t)$V 0 (t) + Q 33(t)$V 3 (t) + Q 35 (t)$v 5 (t) + Q (1,4) 36(t)$V 6 (t) V 4 (t) = Q 46 (t)$v 6 (t) V 5 (t) = Q 50 (t)$v 0 (t) + Q 53 (t)$v 3 (t) V 6 (t) = Q 60 (t)$v 0 (t) + Q 64 (t)$v 4 (t).(120-126) http://dx.doi.org/10.17758/ur.u0315301 10

Taking laplace stieltjes transform of the above equations (120-126) and the solution of expressed as by omitting the argument s for brevity is 0(s) may be 0(s) = N 5 (s)/d 5 (s)...(127) N 5 (s) = (1-46 64)(1 - and D 5 (s) is same as in D 4 (s) in (117). Now, N 5 (0) = p 60 p 02 (1 - p 33 - p 35 p 53 ) 33-35 53) 02 21.(128).(129) Therefore, in steady state the expected number of repairs of automatic switch is V 0 = lim [V 0 (t)/t] = lim s 0(s) = N 5 /D 5...(130) t s 0 N 5 is same as (129) and D 4 is same as D 2 in (86). 11. Conclusion The paper provides the reliability characteristics such as MTSF, Availability, Busy Period Analysis, etc. by using regenerative point technique with Markov renewal process, of a fuel supply system in an automobile engine of a four wheeler which is having both the option of fuel i.e. PETROL and CNG. 12. References [1] Agnihotri, R.K, Khare, A. and Jain, S. (2008). Reliability analysis of a system of boiler used in Readymade garment industry: J. Reliab. and Stat. Studies., Vol. 1, 33-41 [2] Agnihotri, R.K, Sharma, G. and Jain, S. (2010). Reliability analysis of a system of wheels in a four wheeler: Int. J. Agricult. Stat. Sci., Vol. 6, No. 1,, 259-268. [3] Chander, S. and Singh M. (2009). Reliability modeling of 2-out-of-3 redundant system subject to degradation after repair: Journal of Reliability and Statistical Studies, 2(2), p. 91-104. [4] EL-Damcese, M.A. and Tamraz, N.S. (2012). Analysis of a parallel redundant system with different failure mode: RSS, Vol. 5, Issue, pp. 95-106. [5] Goel, L.R., Sharma, G.C. and Gupta, P. (1985). Cost benefit analysis of a system with intermittent repair and inspection under abnormal weather: Microelectron Reliab., 25, 665-668. http://dx.doi.org/10.1016/0026-2714(85)90397-x [6] Joorel, J.P.S. (1990). MTSF and availability analysis of a complex system composed of two sub-systems in series subject to random shocks with single repair facility: Microelectron Reliab., 30, 463-466 http://dx.doi.org/10.1016/0026-2714(90)90399-8 [7] Marko Gerbec (2010). A Reliability Analysis of a Natural gas Pressure Regularity Installation: Reliab. Engg. & System Safety, Vol. 95, Issue 11, pp. 1154-165. http://dx.doi.org/10.1016/j.ress.2010.06.022 [8] Reddy, D.R. and Rao, D.V.B. (1993). Optimisation of parallel systems subject to two modes of failure and repair provision: OPSEARCH, Vol. 30, pp. 249-255. http://dx.doi.org/10.17758/ur.u0315301 11