References

  1. A. Aziz, V. Singhal & F. Balarin (1995): It Usually Works: The Temporal Logic of Stochastic Systems. In: Proc. of CAV: Computer Aided Verification, LNCS 939. Springer, pp. 155–165. Available at http://dx.doi.org/10.1007/3-540-60045-0_48.
  2. D. Beauquier, A. M. Rabinovich & A. Slissenko (2002): A Logic of Probability with Decidable Model-Checking. In: Proc. of CSL: Computer Science Logic, LNCS 2471. Springer, pp. 371–402. Available at http://dx.doi.org/10.1007/3-540-45793-3_21.
  3. Y. Benenson, R. Adar, T. Paz-Elizur, Z. Livneh & e. Shapiro (2003): DNA molecule provides a computing machine with both data and fuel. Proc. National Acad. Sci. USA 100, pp. 2191–2196. Available at http://dx.doi.org/10.1073/pnas.0535624100.
  4. A. Bianco & L. de Alfaro (1995): Model Checking of Probabilistic and Nondeterministic Systems. In: Proc. of FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LNCS 1026. Springer-Verlag, pp. 499–513. Available at http://dx.doi.org/10.1007/3-540-60692-0_70.
  5. J. Filar & K. Vrieze (1997): Competitive Markov Decision Processes. Springer-Verlag. Available at http://www.springer.com/engineering/mathematical/book/978-0-387-94805-8.
  6. V. A. Korthikanti, M. Viswanathan, Y. Kwon & G. Agha (2009): Reasoning about MDPs as transformers of probability distributions. In: Proc. of QEST: Quantitative Evaluation of Systems. IEEE Computer Society, pp. 199–208. Available at http://dx.doi.org/10.1109/QEST.2010.35.
  7. R. Segala (1995): Modeling and Verification of Randomized Distributed Real-Time Systems. MIT. Available at http://profs.sci.univr.it/~segala/www/phd.html. Technical Report MIT/LCS/TR-676.
  8. M. V. Volkov (2008): Synchronizing Automata and the Cerny Conjecture. In: Proc. of LATA: Language and Automata Theory and Applications, LNCS 5196. Springer, pp. 11–27. Available at http://dx.doi.org/10.1007/978-3-540-88282-4_4.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org