1. PRISM website,
http://www.prismmodelchecker.org
2. Alur, R., Dill, D.L.: A theory of timed automata. TCS 126(2), 183–235 (1994)
3. Amparore, E.G., Donatelli, S.: Model checking CSLTA with deterministic and stochastic Petri Nets. In: Dependable Systems and Networks (DSN), pp. 605–614 (2010)
4. Baier, C., Bertrand, N., Bouyer, P., Brihaye, T., Grösser, M.: Almost-sure model checking of infinite paths in one-clock timed automata. In: LICS, pp. 217–226 (2008)
5. Baier, C., Cloth, L., Haverkort, B.R., Kuntz, M., Siegle, M.: Model checking Markov chains with actions and state labels. IEEE TSE 33(4), 209–224 (2007)