Publications

Filters: Author is Bernd Becker [Clear All Filters]

2015

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.

2014

N. Jansen, et al., “Accelerating Parametric Probabilistic Verification”, in Quantitative Evaluation of Systems (QEST'14), 2014.

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.

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.

2013

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.