Abstraction-Based Computation of Reward Measures for Markov Automata

DOI10.1007/978-3-662-46081-8_10zbMath1432.68217OpenAlexW91315594MaRDI QIDQ5172642

Bettina Braitling, Luis María Ferrer Fioriti, Bernd Becker, Holger Hermanns, Ralf Wimmer, Hassan Hatefi

Publication date: 4 February 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46081-8_10

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

Cost vs. time in stochastic games and Markov automata

This page was built for publication: Abstraction-Based Computation of Reward Measures for Markov Automata