New habitat-based models for spread of hantavirus are developed which account for interspecies interaction. Existing habitat-based models do not consider interspecies pathogen transmission, a primary route for emergence of new infectious diseases and reservoirs in wildlife and man. The modeling of interspecies transmission has the potential to provide more accurate predictions of disease persis...

Markov chains are one of the most important kinds of models in Simulation. A fast iterative algorithm for the steady state solution of continuous-time Markov chains (CTMCs) was introduced by Horton and Leutenegger [HL94]. The so-called multi-level algorithm utilizes ideas from algebraic multigrid to provide an efficient alternative to the currently used Gauss-Seidel and successive overrelaxatio...

Our goal is to develop an algorithm for the automated study of the dynamics of Probabilistic Boolean Network (PBN) representation of genes. Model checking is an automated method for the verification of properties on systems. Continuous Stochastic Logic (CSL), an extension of Computation Tree Logic (CTL), is a model-checking tool that can be used to specify measures for Continuous-time Markov Ch...

We study a quantum switch that distributes tripartite entangled states to sets of users. The entanglement switching process requires two steps: First, each user attempts generate bipartite between itself and the switch, second, performs local operations measurement create multipartite for set three In this work, we simple variant system, wherein has infinite memory links connect users are ident...

The train braking system with redundant components has an essential effect on driver safety. In this paper, we consider the failure of K-out-of-N brake motors during operation and recovery by preventive maintenance. Two Continuous Time Markov Chains (CTMC) are used to model working process maintenance corresponding real situation train. Considering intermittent daily cyclical overhaul nested re...

We design a dynamic rate scheduling policy of Markov type via the solution (a social optimal Nash equilibrium point) to a utility-maximization problem over a randomly evolving capacity set for a class of generalized processor-sharing queues living in a random environment, whose job arrivals to each queue follow a doubly stochastic renewal process (DSRP). Both the random environment and the rand...

In this lecture we will discuss Markov Chains in continuous time. Continuous time Markov Chains are used to represent population growth, epidemics, queueing models, reliability of mechanical systems, etc. In Continuous time Markov Process, the time is perturbed by exponentially distributed holding times in each state while the succession of states visited still follows a discrete time Markov ch...

The paper presents the analysis of integrated voice/data slotted code division multiple access (CDMA) system with soft handoff. Some important characteristics of the cellular configuration in soft handoff systems are used to propose a new design of an efficient call admission control (CAC) in CDMA systems. In particular, voice communications and data transmissions are considered. Voice terminal...

For continuous-time Markov chains, the model-checking problem with respect to continuous-time stochastic logic (CSL) has been introduced and shown to be decidable by Aziz, Sanwal, Singhal and Brayton in 1996 [1, 2]. Their proof can be turned into an approximation algorithm with worse than exponential complexity. In 2000, Baier, Haverkort, Hermanns and Katoen [4, 5] presented an efficient polyno...