DeepAI AI Chat
Log In Sign Up

Selective Monitoring

by   Radu Grigore, et al.

We study selective monitors for labelled Markov chains. Monitors observe the outputs that are generated by a Markov chain during its run, with the goal of identifying runs as correct or faulty. A monitor is selective if it skips observations in order to reduce monitoring overhead. We are interested in monitors that minimize the expected number of observations. We establish an undecidability result for selectively monitoring general Markov chains. On the other hand, we show for non-hidden Markov chains (where any output identifies the state the Markov chain is in) that simple optimal monitors exist and can be computed efficiently, based on DFA language equivalence. These monitors do not depend on the precise transition probabilities in the Markov chain. We report on experiments where we compute these monitors for several open-source Java projects.


page 1

page 2

page 3

page 4


Markov Observation Models

Herein, the Hidden Markov Model is expanded to allow for Markov chain ob...

Hidden Markov chains and fields with observations in Riemannian manifolds

Hidden Markov chain, or Markov field, models, with observations in a Euc...

Robust Parametric Inference for Finite Markov Chains

We consider the problem of statistical inference in a parametric finite ...

Statistically efficient thinning of a Markov chain sampler

It is common to subsample Markov chain output to reduce the storage burd...

The Distribution Function of the Longest Head Run

In this paper, the open problem of finding a closed analytical expressio...

Variable Length Markov Chain with Exogenous Covariates

Markov Chains with variable length are useful stochastic models for data...

MCPrioQ: A lock-free algorithm for online sparse markov-chains

In high performance systems it is sometimes hard to build very large gra...

Code Repositories