Sciweavers

86 search results - page 4 / 18
» Equivalence of Labeled Markov Chains
Sort
View
ENTCS
2006
119views more  ENTCS 2006»
13 years 7 months ago
Markovian Testing and Trace Equivalences Exactly Lump More Than Markovian Bisimilarity
The notion of equivalence that is typically used to relate Markovian process terms and to reduce their underlying state spaces is Markovian bisimilarity. The reason is that, besid...
Marco Bernardo
ICW
2005
IEEE
130views Communications» more  ICW 2005»
14 years 1 months ago
A Finite-State Markov Chain Model for Statistical Loss Across a RED Queue
Abstract— In this paper, we present an analytical study targeted at statistically capturing the loss behavior of a RED queue. We utilize a finite-state Markov chain model. Start...
Mohit B. Singh, Homayoun Yousefi'zadeh, Hamid Jafa...
22
Voted
FMCO
2009
Springer
161views Formal Methods» more  FMCO 2009»
13 years 5 months ago
The How and Why of Interactive Markov Chains
This paper reviews the model of interactive Markov chains (IMCs, for short), an extension of labelled transition systems with exponentially delayed transitions. We show that IMCs a...
Holger Hermanns, Joost-Pieter Katoen
CDC
2008
IEEE
125views Control Systems» more  CDC 2008»
14 years 2 months ago
Estimation of non-stationary Markov Chain transition models
— Many decision systems rely on a precisely known Markov Chain model to guarantee optimal performance, and this paper considers the online estimation of unknown, nonstationary Ma...
Luca F. Bertuccelli, Jonathan P. How
MMB
2010
Springer
185views Communications» more  MMB 2010»
13 years 9 months ago
Correctness Issues of Symbolic Bisimulation Computation for Markov Chains
Abstract. Bisimulation reduction is a classical means to fight the infamous state space explosion problem, which limits the applicability of automated methods for verification li...
Ralf Wimmer, Bernd Becker