Rewarding probabilistic hybrid automata

DOI10.1145/2461328.2461375zbMath1362.68172OpenAlexW2078477686MaRDI QIDQ2986936

Ernst Moritz Hahn, Holger Hermanns

Publication date: 16 May 2017

Published in: Proceedings of the 16th international conference on Hybrid systems: computation and control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2461328.2461375

zbMATH Keywords

performance evaluationmodel checkingabstractionnondeterminismperformabilitycontinuous timeprobabilistic automatonsimulation relationexpected rewardsprobabilistic hybrid automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Enhancing model checking in verification by AI techniques
• Receding horizon control for temporal logic specifications
• Model Repair for Probabilistic Systems
• Markov decision processes and regular events
• A Fully Automated Framework for Control of Linear Systems from Temporal Logic Specifications
• Controlling a Class of Nonlinear Systems on Rectangles
• Diagnostic Information for Realizability

This page was built for publication: Rewarding probabilistic hybrid automata