English

Model Checking Markov Chains Against Unambiguous Buchi Automata

Logic in Computer Science 2016-03-29 v2 Formal Languages and Automata Theory

Abstract

We give a polynomial-time algorithm for model checking finite Markov chains against omega-regular specifications given as unambiguous Buchi automata.

Cite

@article{arxiv.1405.4560,
  title  = {Model Checking Markov Chains Against Unambiguous Buchi Automata},
  author = {Michael Benedikt and Rastislav Lenhardt and James Worrell},
  journal= {arXiv preprint arXiv:1405.4560},
  year   = {2016}
}
R2 v1 2026-06-22T04:17:23.443Z