### Abstract

Language | English |
---|---|

Title of host publication | Tools and Algorithms for the Construction and Analysis of Systems |

Subtitle of host publication | 24th International Conference, TACAS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings, Part II |

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 | |

State | Published - 2018 |

### Publication series

Name | Lecture Notes in Computer Science |
---|---|

Publisher | Springer |

Volume | 10806 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Fingerprint

### Cite this

*Tools and Algorithms for the Construction and Analysis of Systems: 24th International Conference, TACAS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings, Part II*(pp. 320-339). (Lecture Notes in Computer Science; Vol. 10806). Cham: Springer. DOI: 10.1007/978-3-319-89963-3_19

}

*Tools and Algorithms for the Construction and Analysis of Systems: 24th International Conference, TACAS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings, Part II.*Lecture Notes in Computer Science, vol. 10806, Springer, Cham, pp. 320-339. DOI: 10.1007/978-3-319-89963-3_19

**Multi-cost Bounded Reachability in MDP.** / Hartmanns, Arnd; Junges, Sebastian; Katoen, Joost-Pieter; Quatmann, Tim.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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 - Tools and Algorithms for the Construction and Analysis of Systems

PB - Springer

CY - Cham

ER -