An Extension For PRISM Model Checker To Reduce Computation Time For Steady State Probability Analysis

Author(s):  
Debjani Ghosh ◽  
Satya Sankalp Gautam ◽  
Mayank Pandey
Author(s):  
S. Shanmugasundaram, Et. al.

In this paper we study the M/M/1 queueing model with retrial on network. We derive the steady state probability of customers in the network, the average number of customers in the all the three nodes in the system, the queue length, system length using little’s formula. The particular case is derived (no retrial). The numerical examples are given to test the correctness of the model.


1995 ◽  
Vol 8 (2) ◽  
pp. 151-176 ◽  
Author(s):  
Attahiru Sule Alfa ◽  
K. Laurie Dolhun ◽  
S. Chakravarthy

We consider a single-server discrete queueing system in which arrivals occur according to a Markovian arrival process. Service is provided in groups of size no more than M customers. The service times are assumed to follow a discrete phase type distribution, whose representation may depend on the group size. Under a probabilistic service rule, which depends on the number of customers waiting in the queue, this system is studied as a Markov process. This type of queueing system is encountered in the operations of an automatic storage retrieval system. The steady-state probability vector is shown to be of (modified) matrix-geometric type. Efficient algorithmic procedures for the computation of the rate matrix, steady-state probability vector, and some important system performance measures are developed. The steady-state waiting time distribution is derived explicitly. Some numerical examples are presented.


Author(s):  
Caston Sigauke ◽  
Delson Chikobvu

Uncertainty in electricity demand is caused by many factors. Large changes are usually attributed to extreme weather conditions and the general random usage of electricity by consumers. More understanding requires a detailed analysis using a stochastic process approach. This paper presents a Markov chain analysis to determine stationary distributions (steady state probabilities) of large daily changes in peak electricity demand. Such large changes pose challenges to system operators in the scheduling and dispatching of electrical energy to consumers. The analysis used on South African daily peak electricity demand data from 2000 to 2011 and on a simple two-state discrete-time Markov chain modelling framework was adopted to estimate steady-state probabilities of two states: positive inter-day changes (increases) and negative inter-day changes (decreases). This was extended to a three-state Markov chain by distinguishing small positive changes and extreme large positive changes. For the negative changes, a decrease state was defined. Empirical results showed that the steady state probability for an increase was 0.4022 for the two-state problem, giving a return period of 2.5 days. For the three state problem, the steady state probability of an extreme increase was 0.0234 with a return period of 43 days, giving approximately nine days in a year that experience extreme inter-day increases in electricity demand. Such an analysis was found to be important for planning, load shifting, load flow analysis and scheduling of electricity, particularly during peak periods.


Sign in / Sign up

Export Citation Format

Share Document