Work

Multi-weighted Markov Decision Processes with Reachability Objectives

Year: 2018

Type: article

Abstract: In this paper, we are interested in the synthesis of schedulers in double-weighted Markov decision processes, which satisfy both a percentile constraint over a weighted reachability condition, and a quantitative constraint on the expected value of a random variable defined using a weighted reachability condition. This problem is inspired by the modelization of an electric-vehicle charging problem. We study the cartography of the problem, when one parameter varies, and show how a partial cartography can be obtained via two sequences of opimization problems. We discuss completeness and feasability of the method.

Source: Electronic Proceedings in Theoretical Computer Science

DOI: 10.4204/eptcs.277.18

Authors: Patricia Bouyer, Mauricio González, Nicolas Markey, Mickael Randour

Institutions: Centre National de la Recherche Scientifique, Université Paris-Saclay, Institut national de recherche en sciences et technologies du numérique, Institut de Recherche en Informatique et Systèmes Aléatoires, Université de Rennes, University of Mons

Language: English

Topic: Formal Methods in Verification

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funder: Fonds De La Recherche Scientifique - FNRS

OpenAlex ID: W2890350829

FWCI: 0.703

Cites: 17

Cited by: 6

Related to: