The Satisfiability Problem for Unbounded Fragments of Probabilistic CTL.
Jan KretínskýAlexej RotarPublished in: CONCUR (2018)
Keyphrases
- satisfiability problem
- temporal logic
- mazurkiewicz traces
- model checking
- np complete
- computation tree logic
- modal logic
- sat problem
- phase transition
- search algorithm
- pspace complete
- stochastic local search algorithms
- guarded fragment
- finite domain
- belief revision
- sat instances
- bounded model checking
- decision procedures