Analysis of Timed and Long-Run Objectives for Markov Automata

DOI10.2168/LMCS-10(3:17)2014zbMath1342.68135arXiv1407.7356OpenAlexW2172279531WikidataQ57800783 ScholiaQ57800783MaRDI QIDQ2921114

Holger Hermanns, Hassan Hatefi, Dennis Guck, Mark Timmer, Joost-Pieter Katoen

Publication date: 30 September 2014

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.7356

zbMATH Keywords

continuous timequantitative analysisMarkov automataexpected timelongrun averagetimed reachability

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) 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)

Related Items

Markov automata with multiple objectives, Cost vs. time in stochastic games and Markov automata, Fault trees on a diet: automated reduction by graph rewriting, Long-Run Rewards for Markov Automata, Confluence reduction for Markov automata, Attribute-Based Signatures for Circuits from Bilinear Map, Multi-objective optimization of long-run average and total rewards

Uses Software

• MAMA
• SCOOP