References

  1. Christel Baier, Boudewijn R. Haverkort, Holger Hermanns & Joost-Pieter Katoen (2003): Model-Checking Algorithms for Continuous-Time Markov Chains. IEEE Trans. on Software Engineering 29(6), pp. 524–541, doi:10.1109/TSE.2003.1205180.
  2. Hichem Boudali, Pepijn Crouzen & Mariëlle Stoelinga (2010): A Rigorous, Compositional, and Extensible Framework for Dynamic Fault Tree Analysis. IEEE Trans. Dependable Sec. Comput. 7(2), pp. 128–143, doi:10.1109/TDSC.2009.45.
  3. Marco Bozzano, Alessandro Cimatti, Joost-Pieter Katoen, Viet Yen Nguyen, Thomas Noll & Marco Roveri (2011): Safety, Dependability and Performance Analysis of Extended AADL Models. Computer Journal 54(5), pp. 754–775, doi:10.1093/comjnl/bxq024.
  4. Nicolas Coste, Holger Hermanns, Etienne Lantreibecq & Wendelin Serwe (2009): Towards Performance Prediction of Compositional Models in Industrial GALS Designs. In: Proc. of CAV, LNCS 5643. Springer, pp. 204–218, doi:10.1007/978-3-642-02658-4_18.
  5. Pedro R. D'Argenio, Bertrand Jeannet, Henrik E. Jensen & Kim G. Larsen (2002): Reduction and Refinement Strategies for Probabilistic Analysis. In: Proc. of PAPM-PROBMIV, pp. 57–76, doi:10.1007/3-540-45605-8_5.
  6. Yuxin Deng & Matthew Hennessy (2013): On the semantics of Markov automata. Information and Computation 222, pp. 139–168, doi:10.1016/j.ic.2012.10.010.
  7. Josee Desharnais, Radha Jagadeesan, Vineet Gupta & Prakash Panangaden (2002): The Metric Analogue of Weak Bisimulation for Probabilistic Processes. In: Proc. of LICS. IEEE CS, pp. 413–422, doi:10.1109/LICS.2002.1029849.
  8. Christian Eisentraut, Holger Hermanns, Joost-Pieter Katoen & Lijun Zhang (2013): A Semantics for Every GSPN. In: Proc. of Petri Nets, LNCS 7927. Springer, pp. 90–109, doi:10.1007/978-3-642-38697-8_6.
  9. Christian Eisentraut, Holger Hermanns & Lijun Zhang (2010): Concurrency and Composition in a Stochastic World. In: Proc. of CONCUR, LNCS 6269. Springer, pp. 21–39, doi:10.1007/978-3-642-15375-4_3.
  10. Christian Eisentraut, Holger Hermanns & Lijun Zhang (2010): On Probabilistic Automata in Continuous Time. In: Proc. of LICS. IEEE CS, pp. 342–351, doi:10.1109/LICS.2010.41.
  11. Sanjay Ghemawat, Howard Gobioff & Shun-Tak Leung (2003): The Google file system. In: Proc. of the ACM Symp. on Operating Systems Principles (SOSP). ACM Press, pp. 29–43, doi:10.1145/945445.945450.
  12. D. Guck (2012): Quantitative Analysis of Markov Automata. RWTH Aachen University.
  13. Dennis Guck, Tingting Han, Joost-Pieter Katoen & Martin R. Neuhäußer (2012): Quantitative Timed Analysis of Interactive Markov Chains. In: Proc. of NFM, LNCS 7226. Springer, pp. 8–23, doi:10.1007/978-3-642-28891-3_4.
  14. Dennis Guck, Hassan Hatefi, Holger Hermanns, Joost-Pieter Katoen & Mark Timmer (2013): Modelling, Reduction and Analysis of Markov Automata. In: Proc. of QEST, LNCS 8054. Springer, pp. 55–71, doi:10.1007/978-3-642-40196-1_5.
  15. Hassan Hatefi & Holger Hermanns (2012): Model Checking Algorithms for Markov Automata. ECEASST 53, doi:10.1007/978-3-642-40213-5_16.
  16. Boudewijn R. Haverkort, Matthias Kuntz, Anne Remke, S. Roolvink & Mariëlle Stoelinga (2010): Evaluating repair strategies for a water-treatment facility using Arcade. In: Proc. of DSN. IEEE, pp. 419–424, doi:10.1109/DSN.2010.5544290.
  17. Holger Hermanns (2002): Interactive Markov Chains – The Quest for Quantified Quality. LNCS 2428. Springer, doi:10.1007/3-540-45804-2.
  18. Mark Kattenbelt, Marta Z. Kwiatkowska, Gethin Norman & David Parker (2010): A game-based abstraction-refinement framework for Markov decision processes. Formal Methods in System Design 36(3), pp. 246–280, doi:10.1007/s10703-010-0097-6.
  19. Marco Ajmone Marsan, Gianni Conte & Gianfranco Balbo (1984): A Class of Generalized Stochastic Petri Nets for the Performance Evaluation of Multiprocessor Systems. ACM Trans. Comput. Syst. 2(2), pp. 93–122, doi:10.1145/190.191.
  20. John F. Meyer, Ali Movaghar & William H. Sanders (1985): Stochastic Activity Networks: Structure, Behavior, and Application. In: Proc. of PNPM. IEEE CS, pp. 106–115.
  21. Martin R. Neuhäußer (2010): Model checking nondeterministic and randomly timed systems. RWTH Aachen University and University of Twente.
  22. Roberto Segala (1995): Modeling and Verification of Randomized Distributed Real-Time Systems. MIT.
  23. Lloyd S Shapley (1953): Stochastic games. Proceedings of the National Academy of Sciences of the United States of America 39(10), pp. 1095, doi:10.1073/pnas.39.10.1095.
  24. Mark Timmer, Joost-Pieter Katoen, Jaco van de Pol & Mariëlle Stoelinga (2012): Efficient Modelling and Generation of Markov Automata. In: Proc. of CONCUR, LNCS 7454. Springer, pp. 364–379, doi:10.1007/978-3-642-32940-1_26.
  25. Mark Timmer, Jaco van de Pol & Mariëlle Stoelinga (2013): Confluence Reduction for Markov Automata. In: Proc. of FORMATS, LNCS 8053. Springer, pp. 243–257, doi:10.1007/978-3-642-40229-6_17.
  26. Björn Wachter (2011): Refined probabilistic abstraction. Saarland University.
  27. Björn Wachter & Lijun Zhang (2010): Best Probabilistic Transformers. In: Proc. of VMCAI, LNCS 5944. Springer, pp. 362–379, doi:10.1007/978-3-642-11319-2_26.
  28. Lijun Zhang & Martin R. Neuhäußer (2010): Model Checking Interactive Markov Chains. In: Proc. of TACAS, LNCS 6015. Springer, pp. 53–68, doi:10.1007/978-3-642-12002-2_5.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org