Reward-bounded reachability probability for uncertain weighted MDPs
In this paper we present a decision algorithm for computing maximal/minimal reward-
bounded reachability probabilities in weighted MDPs with uncertainties. Even though an …
bounded reachability probabilities in weighted MDPs with uncertainties. Even though an …
Deciding probabilistic automata weak bisimulation: theory and practice
LM Ferrer Fioriti, V Hashemi, H Hermanns… - Formal Aspects of …, 2016 - Springer
Weak probabilistic bisimulation on probabilistic automata can be decided by an algorithm
that needs to check a polynomial number of linear programming problems encoding weak …
that needs to check a polynomial number of linear programming problems encoding weak …
Exploiting robust optimization for interval probabilistic bisimulation
Verification of PCTL properties of MDPs with convex uncertainties has been investigated
recently by Puggelli et al. However, model checking algorithms typically suffer from the state …
recently by Puggelli et al. However, model checking algorithms typically suffer from the state …
Polynomial-time alternating probabilistic bisimulation for interval MDPs
Abstract Interval Markov decision processes (IMDPs) extend classical MDPs by allowing
intervals to be used as transition probabilities. They provide a powerful modelling tool for …
intervals to be used as transition probabilities. They provide a powerful modelling tool for …
[PDF][PDF] SMC4PEP: Stochastic Model Checking of Product Engineering Processes
H Hage, E Seferis, V Hashemi… - … Approaches to Software …, 2022 - library.oapen.org
Product Engineering Processes (PEPs) are used for describing complex product
developments in big enterprises such as automotive and avionics industries. The Business …
developments in big enterprises such as automotive and avionics industries. The Business …
[PDF][PDF] Robust SOS specifications of probabilistic processes
ED Gebler - 2015 - research.vu.nl
Doing a PhD is a wonderful journey of constant challenges. First, I would like to thank my
supervisors Wan Fokkink and Pedro R. D'Argenio for their continued support and the great …
supervisors Wan Fokkink and Pedro R. D'Argenio for their continued support and the great …
Decision algorithms for modelling, optimal control and verification of probabilistic systems
V Hashemi - 2017 - publikationen.sulb.uni-saarland.de
Markov Decision Processes (MDPs) constitute a mathematical framework for modelling
systems featuring both probabilistic and nondeterministic behaviour. They are widely used …
systems featuring both probabilistic and nondeterministic behaviour. They are widely used …
[PDF][PDF] Polynomial-Time Alternating Probabilistic Bisimulation for
Interval Markov decision processes (IMDPs) extend classical MDPs by allowing intervals to
be used as transition probabilities. They provide a powerful modelling tool for probabilistic …
be used as transition probabilities. They provide a powerful modelling tool for probabilistic …