Publications

Export 8 results:
Sort by: Author Title [ Type (Asc)] Year
Filters: Author is Ralf Wimmer  [Clear All Filters]
Conference Paper
B. Braitling, L. M. Ferrer Fioriti, H. Hatefi, R. Wimmer, B. Becker, and H. Hermanns, “Abstraction-Based Computation of Reward Measures for Markov Automata”, in Verification, Model Checking, and Abstract Interpretation - 16th International Conference, {VMCAI} 2015, Mumbai, India, January 12-14, 2015. Proceedings, 2015.
N. Jansen, et al., “Accelerating Parametric Probabilistic Verification”, in Quantitative Evaluation of Systems (QEST'14), 2014.
C. Dehnert, N. Jansen, R. Wimmer, E. Ábrahám, and J. - P. Katoen, “Fast Debugging of PRISM Models”, in Int. Symp. on Automated Technology for Verification and Analysis (ATVA'14), 2014.
R. Wimmer, N. Jansen, A. Vorpahl, E. Ábrahám, J. - P. Katoen, and B. Becker, “High-Level Counterexamples for Probabilistic Automata”, in Quantitative Evaluation of Systems, QEST 2013, 2013, vol. 8054, p. 39-54.
B. Braitling, L. M. Ferrer Fioriti, H. Hatefi, R. Wimmer, B. Becker, and H. Hermanns, “MeGARA: Menu-based Game Abstraction and Abstraction Refinement of Markov Automata”, in Proceedings Twelfth International Workshop on Quantitative Aspects of Programming Languages and Systems, {QAPL} 2014, Grenoble, France, 12-13 April 2014., 2014.
Journal Article
R. Wimmer, N. Jansen, E. Ábrahám, and J. - P. Katoen, “High-level Counterexamples for Probabilistic Automata”, Logical Methods in Computer Science, vol. 11, 2015.
R. Wimmer, N. Jansen, E. Ábrahám, J. - P. Katoen, and B. Becker, “Minimal counterexamples for linear-time probabilistic verification”, Theoretical Computer Science, vol. 549, p. 61 - 100, 2014.
N. Jansen, et al., “Symbolic counterexample generation for large discrete-time Markov chains”, Sci. Comput. Program., vol. 91, p. 90-114, 2014.