2000 character limit reached
The Satisfiability Problem for Unbounded Fragments of Probabilistic CTL (1806.11418v1)
Published 29 Jun 2018 in cs.LO
Abstract: We investigate the satisfiability and finite satisfiability problem for probabilistic computation-tree logic (PCTL) where operators are not restricted by any step bounds. We establish decidability for several fragments containing quantitative operators and pinpoint the difficulties arising in more complex fragments where the decidability remains open.
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.
