Sciweavers

86 search results - page 1 / 18
» Equivalence of Labeled Markov Chains
Sort
View
IJFCS
2008
130views more  IJFCS 2008»
13 years 4 months ago
Equivalence of Labeled Markov Chains
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 observat...
Laurent Doyen, Thomas A. Henzinger, Jean-Fran&cced...
JMLR
2006
103views more  JMLR 2006»
13 years 4 months ago
A Graphical Representation of Equivalence Classes of AMP Chain Graphs
This paper deals with chain graph models under alternative AMP interpretation. A new representative of an AMP Markov equivalence class, called the largest deflagged graph, is prop...
Alberto Roverato, Milan Studený
ENTCS
2006
119views more  ENTCS 2006»
13 years 4 months ago
Trace Machines for Observing Continuous-Time Markov Chains
In this paper, we study several linear-time equivalences (Markovian trace equivalence, failure and ready trace equivalence) for continuous-time Markov chains that refer to the pro...
Verena Wolf, Christel Baier, Mila E. Majster-Ceder...
AI
2006
Springer
13 years 8 months ago
Trace Equivalence Characterization Through Reinforcement Learning
In the context of probabilistic verification, we provide a new notion of trace-equivalence divergence between pairs of Labelled Markov processes. This divergence corresponds to the...
Josee Desharnais, François Laviolette, Kris...
QEST
2008
IEEE
13 years 11 months ago
Hintikka Games for PCTL on Labeled Markov Chains
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 se...
Harald Fecher, Michael Huth, Nir Piterman, Daniel ...