Regarding nite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal veriication problems. In this paper we present symbolic algorithms to compute the steady-state probabilities for very large nite state machines (up to 10 27 states). These algorithms, based on Algebraic Decision Diagrams (ADDs) | an extension of BDDs that ...

The probabilistic structure for the transient M/E,/2 queue is derived in discrete time, where El, denotes a k-Erlangdistribution. This queue has a twodimensional state-space. Expressions for the expected delay in queue are formulated in terms oftransition probabilities. Results are numerically evaluated for a few cases. The convergence behavior is similar to that seen in previous work on queues...

Multiple transmission lines on a single right of way are commonly used by utilities. The phenomenon of common cause outages was first of all recognized by a Task Force from IEEE subcommittee [1]. The Task Force defined a common mode outage as "an event having a single external cause with multiple failure events, where the events are not consequences of each other". The closed form expressions f...

This paper addresses the problem of constructing multidimensional Markov chains with product form steady state distribution. Product connection theorems are established which guarantee that the product ∏ ν π (ν) nν of steady state probabilities π (ν) nν related to ergodic Markov chains X (ν) = {X(ν)(t) : t ∈ T} represents the steady state probability p(n) = p(n1, n2, . . .) of an ergodic multid...

In this paper, we apply Markov chain techniques to select the best financial stocks listed on Ghana Stock Exchange based mean recurrent times and steady-state distribution for investment portfolio construction. Weekly stock prices from spanning January 2017 December 2020 was used study. A three-state estimate transition matrix, long-run probabilities, price movements one state another. Generall...

In this paper, a new blocked tandem queueing model is given and analysed. The arrival process to Poisson with parameter λ. There one service unit at the first stage of system, time exponentially distributed $μ_1$ parameter. are two parallel units second stage, these parameters $μ_2$ $μ_3$. No queue allowed system. Upon completing customer proceeds if least available. If both busy, blocks which ...

In this paper we present a concept for using presence absence data to recover information on the population dynamics of predator prey systems. We use a highly complex and spatially explicit simulation model of a predator prey mite system to generate simple presence absence data: the number of patches with both prey and predators, with prey only, with predators only, and with neither species, al...

In this paper we establish asymptotics for the basic steady-state distributions in a large class of single-server queues. We consider the waiting time, the workload (virtual waiting time) and the steady-state queue lengths at an arbitrary time, just before an arrival and just after a departure. We start by establishing asymptotics for steady-state distributions of Markov chains of M/GI/1 type. ...

In this paper, a multirate loss model for the calculation of time and call congestion probabilities in a Wideband Code Division Multiple Access (W-CDMA) cell is considered. It utilizes the Bandwidth Reservation (BR) policy and supports calls generated by an infinite or finite number of users. The BR policy achieves QoS equalization by equalizing congestion probabilities among calls of different...