1. Lecture Notes in Computer Science;T Babiak,2012
2. Baier, C., Katoen, J.P.: Principles of Model Checking, vol. 26202649. MIT Press, Cambridge (2008)
3. Bertrand, N., Fearnley, J., Schewe, S.: Bounded satisfiability for PCTL. In: Cégielski, P., Durand, A. (eds.) CSL. LIPICS, vol. 16, pp. 92–106. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2012). http://drops.dagstuhl.de/opus/volltexte/2012/3666
4. Beyene, T., Chaudhuri, S., Popeea, C., Rybalchenko, A.: A constraint-based approach to solving games on infinite graphs. SIGPLAN Not. 49(1), 221–233 (2014). doi:10.1145/2578855.2535860
5. Bloem, R., Jobstmann, B., Piterman, N., Pnueli, A., Sa’ar, Y.: Synthesis of reactive(1) designs. J. Comput. Syst. Sci. 78, 911–938 (2012)