Publications

Filters: Author is Ferrer Fioriti, Luis María [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.

L. M. Ferrer Fioriti and H. Hermanns, “Probabilistic Termination: Soundness, Completeness, and Compositionality”, in Proceedings of the 42nd Annual {ACM} {SIGPLAN-SIGACT} Symposium on Principles of Programming Languages, {POPL} 2015, Mumbai, India, January 15-17, 2015, 2015.

2014

S. Giro, P. R. D'Argenio, and L. M. Ferrer Fioriti, “Distributed probabilistic input/output automata: Expressiveness, (un)decidability and algorithms”, Theoretical Computer Science, vol. 538, p. 84-102, 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.

2012

L. M. Ferrer Fioriti and H. Hermanns, “Heuristics for Probabilistic Timed Automata with Abstraction Refinement”, in Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance, 2012, vol. 7201, p. 151-165.

L. M. Ferrer Fioriti, E. M. Hahn, H. Hermanns, and B. Wachter, “Variable Probabilistic Abstraction Refinement”, in Automated Technology for Verification and Analysis - 10th International Symposium, ATVA 2012, Thiruvananthapuram, India, October 3-6, 2012. Proceedings, 2012, vol. 7561, p. 300-316.