The Satisfiability Problem for Probabilistic CTL
[BFKK08] T. Brázdil, V. Forejt, J. Křetínský and A. Kučera. The Satisfiability Problem for Probabilistic CTL. In Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, pages 391-402, IEEE Computer Society. 2008.
- Search for this paper
- Google · Google Scholar