论文信息 - Model Checking Markov Chains Against Unambiguous Buchi Automata - 字舞流文

Model Checking Markov Chains Against Unambiguous Buchi Automata

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

James Worrell | Michael Benedikt | Rastislav Lenhardt | J. Worrell | Michael Benedikt | R. Lenhardt

[1] Mihalis Yannakakis,et al. The complexity of probabilistic verification , 1995, JACM.

[2] Pierre Wolper,et al. An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[3] Pierre Wolper,et al. Simple on-the-fly automatic verification of linear temporal logic , 1995, PSTV.

[4] Grégoire Sutre,et al. An Optimal Automata Approach to LTL Model Checking of Probabilistic Systems , 2003, LPAR.

[5] James Worrell,et al. LTL Model Checking of Interval Markov Chains , 2013, TACAS.