The Satisfiability Problem for Probabilistic CTL.
We study the satisfiability problem for qualitative PCTL (Probabilistic Computation Tree Logic), which is obtained from "ordinary" CTL by replacing the EX, AX, EU, and AU operators with their qualitative counterparts X>0, X=1, U>0, and U=1, respectively. As opposed to CTL, qu...
| Main Authors: | , , , |
|---|---|
| 格式: | Journal article |
| 语言: | English |
| 出版: |
IEEE
2008
|