Sojourn times in finite Markov processes

From MaRDI portal
Publication:4207453

DOI10.2307/3214379zbMath0688.60059OpenAlexW2001451246MaRDI QIDQ4207453

Gerardo Rubino, Bruno Sericola

Publication date: 1989

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/752f98397cb8e562be5863e283a5dfb75a92d409




Related Items (19)

Occupation frequencies for irreducible finite semi-Markov processes with reliability applicationsNumerically stable methods for the computation of exit rates in Markov chainsOn Block Skip Free Transition Matrices and First Passage TimesOn the mean and variance of cover times for random walks on graphsSub-stochastic matrix analysis for bounds computation -- theoretical resultsOn the derivative counting processes of first- and second-order aggregated semi-Markov systemsHealthcare-associated \textit{Clostridium difficile} infections are sustained by disease from the communityMulti-point and multi-interval bounded-covering availability measures for aggregated Markovian repairable systems\(H_\infty\) control for networked control systems with time delays and packet dropoutsOn the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculiThe joint distribution of sojourn times in finite semi-Markov processesReliability of repairable multi-state two-phase mission systems with finite number of phase switchesA necessary condition for weak lumpability in finite Markov processesOn a counting variable in the theory of discrete-parameter Markov chainsApproximation of sojourn-times via maximal couplings: motif frequency distributionsReliability of Supply Between Production LinesCase for First Courses on Finite Markov Chain Modeling to Include Sojourn Time Cycle ChartBalanced partitions for Markov chainsMission Availability For Repairable Semi-Markov Systems: Analytical Results And Computational Implementation







This page was built for publication: Sojourn times in finite Markov processes