Probabilistic Computation Tree Logic (PCTL) is the established temporal logic for probabilistic verification of discrete-time Markov chains. Probabilistic model checking is a technique that verifies or refutes whether a property specified in this logic holds in a Markov chain. But Markov chains are often infinite or too large for this technique to apply. A standard solution to this problem is t...

Article history: Received 10 May 2012 Received in revised form 28 November 2012 Accepted 22 April 2013 Available online 25 April 2013

background: hepatitis b (hb) is a major global mortality. accurately predicting the trend of the disease can provide an appropriate view to make health policy disease prevention. this paper aimed to apply three different to predict monthly incidence rates of hb. methods: this historical cohort study was conducted on the hb incidence data of hamadan province, the west of iran, from 2004 to 2012....

A framework for finite-dimensional quantum Markov chains on Hilbert spaces is introduced. Quantum Markov chains generalize both classical Markov chains with possibly hidden states and existing models of quantum walks on finite graphs. Quantum Markov chains are based on Markov operations that may be applied to quantum systems and include quantum measurements, for example. It is proved that quant...

In networked control systems, time delay and data dropout can degrade the performance of the control system and even destabilize the system. In the present paper, the Extended Kalman filter is employed to compensate the effects of time delay and data dropout in feedforward and feedback paths of networked control systems. In the proposed method, the extended Kalman filter is used as an observer ...

In the present paper, we construct quantum Markov chains (QMC) over Comb graphs. As an application of this construction, it is proved existence disordered phase for Ising type models (within QMC scheme) Moreover, also established that associated has clustering property with respect to translations graph. We stress paper first one where a nontrivial example non-regular graphs given.

We consider the model checking problem for interval Markov chains with open intervals. Interval Markov chains are generalizations of discrete time Markov chains where the transition probabilities are intervals, instead of constant values. We focus on the case where the intervals are open. At first sight, open intervals present technical challenges, as optimal (min, max) value for reachability m...

In this paper, we obtain the Rényi entropy rate for irreducible-aperiodic Markov chains with countable state space, using the theory of countable nonnegative matrices. We also obtain the bound for the rate of Rényi entropy of an irreducible Markov chain. Finally, we show that the bound for the Rényi entropy rate is the Shannon entropy rate.