Results 1  10
of
645,221
Equivalence of Labeled Markov Chains
, 2008
"... We consider the equivalence problem for labeled Markov chains (LMCs), where each state is labeled with an observation. Two LMCs are equivalent if every finite sequence of observations has the same probability of occurrence in the two LMCs. We show that equivalence can be decided in polynomial time, ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
We consider the equivalence problem for labeled Markov chains (LMCs), where each state is labeled with an observation. Two LMCs are equivalent if every finite sequence of observations has the same probability of occurrence in the two LMCs. We show that equivalence can be decided in polynomial time
Comparing CTL and PCTL on Labeled Markov Chains
 In Proc. PROCOMET'98, IFIP. Chapman
, 1998
"... We interpret modal mucalculus formulas in a nonstandard way as expectations over labeled Markov chains. In this semantics fixedpoints are computed in an iterative incremental/decremental fashion. This provides the foundation for a symbolic model checking algorithm for CTL over labeled Markov chai ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We interpret modal mucalculus formulas in a nonstandard way as expectations over labeled Markov chains. In this semantics fixedpoints are computed in an iterative incremental/decremental fashion. This provides the foundation for a symbolic model checking algorithm for CTL over labeled Markov
D.: Hintikka Games for PCTL on Labeled Markov Chains
 In: Proc. of QEST 2008, IEEE Computer Society
"... We present Hintikka games for formulae of the probabilistic temporal logic PCTL and countable labeled Markov chains as models, giving an operational account of the denotational semantics of PCTL on such models. Winning strategies have a decent degree of compositionality in the parse tree of a PCTL f ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
We present Hintikka games for formulae of the probabilistic temporal logic PCTL and countable labeled Markov chains as models, giving an operational account of the denotational semantics of PCTL on such models. Winning strategies have a decent degree of compositionality in the parse tree of a PCTL
Model checking action and statelabelled Markov chains
 DSN’04, Proceedings of International Conference on Dependable Systems and Networks
, 2004
"... In this paper we introduce the logic asCSL, an extension of continuous stochastic logic (CSL), which provides powerful means to characterise execution paths of action and statelabelled Markov chains. In asCSL, path properties are characterised by regular expressions over actions and stateformulas ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
In this paper we introduce the logic asCSL, an extension of continuous stochastic logic (CSL), which provides powerful means to characterise execution paths of action and statelabelled Markov chains. In asCSL, path properties are characterised by regular expressions over actions and state
A Truly Concurrent Synchronization Product of Labelled Markov Chains
, 2005
"... In this paper we introduce a product operation on labeled Markov chains. Whereas this kind of product is most usually achieved under an interleaving semantics, for instance in the framework of probabilistic automata, our construction stays within the trueconcurrent semantics. Hence the product of t ..."
Abstract
 Add to MetaCart
In this paper we introduce a product operation on labeled Markov chains. Whereas this kind of product is most usually achieved under an interleaving semantics, for instance in the framework of probabilistic automata, our construction stays within the trueconcurrent semantics. Hence the product
International Journal of Foundations of Computer Science c ○ World Scientific Publishing Company Equivalence of Labeled Markov Chains ∗
"... Communicated by Editor’s name We consider the equivalence problem for labeled Markov chains (LMCs), where each state is labeled with an observation. Two LMCs are equivalent if every finite sequence of observations has the same probability of occurrence in the two LMCs. We show that equivalence can b ..."
Abstract
 Add to MetaCart
Communicated by Editor’s name We consider the equivalence problem for labeled Markov chains (LMCs), where each state is labeled with an observation. Two LMCs are equivalent if every finite sequence of observations has the same probability of occurrence in the two LMCs. We show that equivalence can
Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
 Biometrika
, 1995
"... Markov chain Monte Carlo methods for Bayesian computation have until recently been restricted to problems where the joint distribution of all variables has a density with respect to some xed standard underlying measure. They have therefore not been available for application to Bayesian model determi ..."
Abstract

Cited by 1330 (24 self)
 Add to MetaCart
Markov chain Monte Carlo methods for Bayesian computation have until recently been restricted to problems where the joint distribution of all variables has a density with respect to some xed standard underlying measure. They have therefore not been available for application to Bayesian model
Markov chains for exploring posterior distributions
 Annals of Statistics
, 1994
"... Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at ..."
Abstract

Cited by 1122 (6 self)
 Add to MetaCart
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at
Results 1  10
of
645,221