Multi-cost Bounded Reachability in MDP

Arnd Hartmanns; Sebastian Junges; Joost-Pieter Katoen; Tim Quatmann

doi:10.1007/978-3-319-89963-3_19

Multi-cost Bounded Reachability in MDP

Arnd Hartmanns, Sebastian Junges, Joost-Pieter Katoen, Tim Quatmann

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

18 Citations (Scopus)

334 Downloads (Pure)

Abstract

We provide an efficient algorithm for multi-objective model-checking problems on Markov decision processes (MDPs) with multiple cost structures. The key problem at hand is to check whether there exists a scheduler for a given MDP such that all objectives over cost vectors are fulfilled. Reachability and expected cost objectives are covered and can be mixed. Empirical evaluation shows the algorithm’s scalability. We discuss the need for output beyond Pareto curves and exploit the available information from the algorithm to support decision makers.

Original language	English
Title of host publication	Proceedings of the 24th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2018)
Editors	Dirk Beyer, Marieke Huisman
Place of Publication	Cham
Publisher	Springer
Pages	320-339
Number of pages	20
ISBN (Electronic)	978-3-319-89963-3
ISBN (Print)	978-3-319-89962-6
DOIs	https://doi.org/10.1007/978-3-319-89963-3_19
Publication status	Published - 2018

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	10806
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Access to Document

10.1007/978-3-319-89963-3_19

Multi-cost boundedFinal published version, 2.48 MB

https://doi.org/10.1007/978-3-319-89963-3_19

Cite this

Hartmanns, A., Junges, S., Katoen, J.-P., & Quatmann, T. (2018). Multi-cost Bounded Reachability in MDP. In D. Beyer, & M. Huisman (Eds.), Proceedings of the 24th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2018) (pp. 320-339). (Lecture Notes in Computer Science; Vol. 10806). Springer. https://doi.org/10.1007/978-3-319-89963-3_19

@inproceedings{36721b57a67a4bb3b363341908a693ca,

title = "Multi-cost Bounded Reachability in MDP",

abstract = "We provide an efficient algorithm for multi-objective model-checking problems on Markov decision processes (MDPs) with multiple cost structures. The key problem at hand is to check whether there exists a scheduler for a given MDP such that all objectives over cost vectors are fulfilled. Reachability and expected cost objectives are covered and can be mixed. Empirical evaluation shows the algorithm{\textquoteright}s scalability. We discuss the need for output beyond Pareto curves and exploit the available information from the algorithm to support decision makers.",

author = "Arnd Hartmanns and Sebastian Junges and Joost-Pieter Katoen and Tim Quatmann",

note = "Open Access",

year = "2018",

doi = "10.1007/978-3-319-89963-3_19",

language = "English",

isbn = "978-3-319-89962-6",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "320--339",

editor = "Dirk Beyer and Marieke Huisman",

booktitle = "Proceedings of the 24th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2018)",

address = "Germany",

}

Hartmanns, A, Junges, S, Katoen, J-P & Quatmann, T 2018, Multi-cost Bounded Reachability in MDP. in D Beyer & M Huisman (eds), Proceedings of the 24th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2018). Lecture Notes in Computer Science, vol. 10806, Springer, Cham, pp. 320-339. https://doi.org/10.1007/978-3-319-89963-3_19

Multi-cost Bounded Reachability in MDP. / Hartmanns, Arnd; Junges, Sebastian; Katoen, Joost-Pieter et al.
Proceedings of the 24th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2018). ed. / Dirk Beyer; Marieke Huisman. Cham: Springer, 2018. p. 320-339 (Lecture Notes in Computer Science; Vol. 10806).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Multi-cost Bounded Reachability in MDP

AU - Hartmanns, Arnd

AU - Junges, Sebastian

AU - Katoen, Joost-Pieter

AU - Quatmann, Tim

N1 - Open Access

PY - 2018

Y1 - 2018

N2 - We provide an efficient algorithm for multi-objective model-checking problems on Markov decision processes (MDPs) with multiple cost structures. The key problem at hand is to check whether there exists a scheduler for a given MDP such that all objectives over cost vectors are fulfilled. Reachability and expected cost objectives are covered and can be mixed. Empirical evaluation shows the algorithm’s scalability. We discuss the need for output beyond Pareto curves and exploit the available information from the algorithm to support decision makers.

AB - We provide an efficient algorithm for multi-objective model-checking problems on Markov decision processes (MDPs) with multiple cost structures. The key problem at hand is to check whether there exists a scheduler for a given MDP such that all objectives over cost vectors are fulfilled. Reachability and expected cost objectives are covered and can be mixed. Empirical evaluation shows the algorithm’s scalability. We discuss the need for output beyond Pareto curves and exploit the available information from the algorithm to support decision makers.

U2 - 10.1007/978-3-319-89963-3_19

DO - 10.1007/978-3-319-89963-3_19

M3 - Conference contribution

SN - 978-3-319-89962-6

T3 - Lecture Notes in Computer Science

SP - 320

EP - 339

BT - Proceedings of the 24th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2018)

A2 - Beyer, Dirk

A2 - Huisman, Marieke

PB - Springer

CY - Cham

ER -

Multi-cost Bounded Reachability in MDP

Abstract

Publication series

Access to Document

Fingerprint

Cite this