2000 character limit reached
Model Checking Markov Chains Against Unambiguous Buchi Automata
Published 18 May 2014 in cs.LO and cs.FL | (1405.4560v2)
Abstract: We give a polynomial-time algorithm for model checking finite Markov chains against omega-regular specifications given as unambiguous Buchi automata.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.