2000 character limit reached
Model Checking Markov Chains Against Unambiguous Buchi Automata (1405.4560v2)
Published 18 May 2014 in cs.LO and cs.FL
Abstract: We give a polynomial-time algorithm for model checking finite Markov chains against omega-regular specifications given as unambiguous Buchi automata.