References

  1. C. Baier, B. R. Haverkort, H. Hermanns & J.-P. Katoen (2003): Model-Checking Algorithms for Continuous-Time Markov Chains. IEEE Trans. Software Eng. 29(6), pp. 524–541, doi:10.1109/TSE.2003.1205180.
  2. E. Bartocci, R. Grosu, P. Katsaros, C.R. Ramakrishnan & S.A. Smolka (2011): Model Repair for Probabilistic Systems. In: TACAS 2011, Lecture Notes in Computer Science 6605. Springer, pp. 326–340, doi:10.1007/978-3-642-19835-9_30.
  3. M. Ceska, F. Dannenberg, M. Z. Kwiatkowska & N. Paoletti (2014): Precise Parameter Synthesis for Stochastic Biochemical Systems. In: Computational Methods in Systems Biology - 12th International Conference, CMSB, pp. 86–98, doi:10.1007/978-3-319-12982-2_7.
  4. T. Chen, E. M. Hahn, T. Han, M. Kwiatkowska, H. Qu & L. Zhang (2013): Model Repair for Markov Decision Processes. In: Proc. 7th International Symposium on Theoretical Aspects of Software Engineering (TASE). IEEE CS Press, pp. 85–92, doi:10.1109/TASE.2013.20.
  5. C. Daws (2004): Symbolic and Parametric Model Checking of Discrete-Time Markov Chains. In: Theoretical Aspects of Computing - ICTAC 2004, Lecture Notes in Computer Science 3407. Springer Berlin Heidelberg, pp. 280–294, doi:10.1007/978-3-540-31862-0_21.
  6. E. M. Hahn, H. Hermanns, B. Wachter & L. Zhang (2010): PARAM: A Model Checker for Parametric Markov Models. In: Computer Aided Verification, 22nd International Conference, CAV, pp. 660–664, doi:10.1007/978-3-642-14295-6_56.
  7. E. M. Hahn, H. Hermanns & L. Zhang (2011): Probabilistic reachability for parametric Markov models. STTT 13(1), pp. 3–19, doi:10.1007/s10009-010-0146-x.
  8. T. Han, J.-P. Katoen & A. Mereacre (2008): Approximate Parameter Synthesis for Probabilistic Time-Bounded Reachability. In: Proceedings of the 29th IEEE Real-Time Systems Symposium, RTSS, pp. 173–182, doi:10.1109/RTSS.2008.19.
  9. J.-P. Katoen, I.S. Zapreev, E.M. Hahn, H. Hermanns & D.N. Jansen (2011): The Ins and Outs of the Probabilistic Model Checker MRMC. Perform. Eval. 68(2), pp. 90–104, doi:10.1016/j.peva.2010.04.001.
  10. M. Z. Kwiatkowska, G. Norman & D. Parker (2011): PRISM 4.0: Verification of Probabilistic Real-Time Systems. In: Computer Aided Verification - 23rd International Conference, CAV, pp. 585–591, doi:10.1007/978-3-642-22110-1_47.
  11. K. Mehlhorn (1984): Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness. EATCS Monographs on Theoretical Computer Science 2. Springer, doi:10.1007/978-3-642-69897-2.
  12. S. Pathak, E. Ábrahám, N. Jansen, A. Tacchella & J.-P. Katoen (2015): A Greedy Approach for the Efficient Repair of Stochastic Models. In: NASA Formal Methods - 7th Int. Symposium, pp. 295–309, doi:10.1007/978-3-319-17524-9_21.
  13. B.-S.-K. Tati & M. Siegle (2015): Parameter and Controller Synthesis for Markov Chains with Actions and State Labels. In: 2nd International Workshop on Synthesis of Complex Parameters (SynCoP'15), OASIcs 44, pp. 63–76, doi:10.4230/OASIcs.SynCoP.2015.63.

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