Cost vs. time in stochastic games and Markov automata

DOI10.1007/s00165-016-0411-1zbMath1370.68173OpenAlexW2571463671MaRDI QIDQ2403526

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

Publication date: 8 September 2017

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-016-0411-1

zbMATH Keywords

stochastic gamestime boundsMarkov automatacost boundsexpected rewards

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Stochastic games, stochastic differential games (91A15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Numerical analysis of continuous time Markov decision processes over finite horizons
• Interactive Markov chains. And the quest for quantified quality
• Continuous-time stochastic games with time-bounded reachability
• A lattice-theoretical fixpoint theorem and its applications
• Confluence Reduction for Markov Automata
• Efficient Modelling and Generation of Markov Automata
• Analysis of Timed and Long-Run Objectives for Markov Automata
• Modelling and Analysis of Markov Reward Automata
• Optimal Continuous Time Markov Decisions
• A Characterization of Meaningful Schedulers for Continuous-Time Markov Decision Processes
• Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan
• Composition of Stochastic Transition Systems Based on Spans and Couplings
• Abstraction-Based Computation of Reward Measures for Markov Automata
• A Semantics for Every GSPN
• Cost vs. Time in Stochastic Games and Markov Automata
• Maximal Cost-Bounded Reachability Probability on Continuous-Time Markov Decision Processes
• Finite State Continuous Time Markov Decision Processes with a Finite Planning Horizon
• Formal Modeling and Analysis of Timed Systems
• Stochastic Games

This page was built for publication: Cost vs. time in stochastic games and Markov automata