Model Checking Markov Chains Against Unambiguous Buchi Automata
classification
💻 cs.LO
cs.FL
keywords
automatabuchichainscheckingmarkovmodelunambiguousalgorithm
read the original abstract
We give a polynomial-time algorithm for model checking finite Markov chains against omega-regular specifications given as unambiguous Buchi automata.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.