Playing optimally on timed automata with random delays

DOI10.1007/978-3-642-33365-1_5MaRDI QIDQ4649385zbMATH OpenOpenAlexFDO

Authors Nathalie Bertrand, Sven Schewe

Publication date 21 November 2012

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

Full work available at URL https://doi.org/10.1007/978-3-642-33365-1_5

Mathematics Subject Classification ID

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

Recommendations

• Optimal time-abstract schedulers for CTMDPs and continuous-time Markov games
• Optimal time-abstract schedulers for CTMDPs and Markov games
• Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games
• Delayed Nondeterminism in Continuous-Time Markov Decision Processes
• Stochastic Real-Time Games with Qualitative Timed Automata Objectives

Cited in

(2)

• Optimal time-abstract schedulers for CTMDPs and continuous-time Markov games
• scientific article; zbMATH DE number 6862072 (Why is no real title available?)

This page was built for publication: Playing optimally on timed automata with random delays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649385)