A | B | C | D | E | F 
 G | H | I | J | K | L | M 
 N | O | P | Q | R | S | T 
 U | V | W | X | Y | Z 
max planck institut
mpii logo Minerva of the Max Planck Society


Hashemi, Vahid


Vahid Hashemi

Max-Planck-Institut für Informatik
Dependable Systems and Software Group
Campus E1 3, Room 511
66123 Saarbrücken, Germany

Email: hashemi@mpi-inf.mpg.de
Phone: +49 681 302 5621
Fax: +49 681 302 5636  

I am currently a Ph.D. student in the chair of Dependable Systems and Software Group at Saarland University and I am most happy to have Prof. Dr.-Ing. Holger Hermanns as my supervisor. I'm in general interested in the synergy between design and analysis of algorithms and probabilistic verification. In particular, I'm working on the stochastic modelling, optimal control and quantitative verification of parametric probabilistic systems. These involves topics such as efficient decision algorithms for behavioral equivalences, controller synthesis and so on. Currently, my Ph.D. is supported by International Max Planck Research School for Computer Science (IMPRS-CS).

I completed my BSc. in Pure Mathematics at Shiraz University and my MSc. in Applied Mathematics from University of Tehran.

 Research Interests

Selected Publications 

Full list of publications is availabe in my DBLP and ResearchGate.

  1. Reformulation of the Linear Program for Completely Ergodic MDPs with Average Cost Criteria
    Hashemi V.,
    In Journal Optimization Letters, 2017 (to appear).

  2. Compositional Reasoning for Interval Markov Decision Processes
    Hashemi V., Hermanns H., and Turrini A.,

  3. Exploiting Robust Optimization for Interval Probabilistic Bisimulation
    Hashemi V., Hahn E. M., Hermanns H., and Turrini A.,
    In Proc. QEST'16, LNCS 9826, pages 55-71, 2016.

  4. Towards a Combinatorial Approach for Undiscounted MDPs
    Hashemi V.,
    In Proc. ACM SAC’16, ACM, pages 1708-1709, 2016.

  5. Compositional Bisimulation Minimization for Interval Markov Decision Processes
    Hashemi V., Hermanns H., Song L.,Subramani K., Turrini A., and Wojciechowski P.,
    In Proc. LATA'16, LNCS 9618, pages 114-126, 2016.

  6. Reward-Bounded Reachability Probability for Uncertain Weighted MDPs
    Hashemi V., Hermanns H., and Song L.,
    In Proc. VMCAI’16, LNCS 9583, pages 351-371, 2016.

  7. Deciding Probabilistic Automata Weak Bisimulation: Theory and Practice
    Ferrer Fioriti L. M., Hashemi V., Hermanns H., and Turrini A.,
    In Journal Formal Aspects of Computing, 28: pages 109-143, 2016.

  8. Probabilistic Bisimulations for PCTL Model Checking of Interval MDPs
    Hashemi V., Hatefi H., and Krcál J.,
    In Proc. SynCoP’14, EPTCS 145, pages 19-33, 2014.

  9. On the Efficiency of Deciding Probabilistic Automata Weak Bisimulation
    Hashemi V., Hermanns H., and Turrini A.,
    In Journal Electronic Communications of EASST, Volume 66, 2013.

  10. Computing Behavioral Relations for Probabilistic Concurrent Systems
    Gebler D., Hashemi V., and Turrini A.,
    In Proc. ROCKS’12, LNCS, pages 117-155, 2012.