A modest Markov automata tutorial

DOI10.1007/978-3-030-31423-1_8MaRDI QIDQ6535989zbMATH OpenFDO

Authors Arnd Hartmanns, Holger Hermanns

Publication date 14 March 2024

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A modest approach to Markov automata
• A Modest Approach to Modelling and Checking Markov Automata
• Modelling and analysis of Markov reward automata
• Long-Run Rewards for Markov Automata
• Abstraction-based computation of reward measures for Markov automata

Cites work

• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• A Modest Approach to Modelling and Checking Markov Automata
• A compositional modelling and analysis framework for stochastic hybrid systems
• A semantics for every GSPN
• Abstraction-based computation of reward measures for Markov automata
• Analysis of timed and long-run objectives for Markov automata
• Automatic verification of real-time systems with discrete probability distributions.
• Concurrency and composition in a stochastic world
• Confluence reduction for Markov automata
• Cost vs. time in stochastic games and Markov automata
• Efficient modelling and generation of Markov automata
• Explicit model checking of very large MDP using partitioning and secondary storage
• Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games
• Interactive Markov chains. And the quest for quantified quality
• Long-Run Rewards for Markov Automata
• Measurability and safety verification for stochastic hybrid systems
• Modelling and analysis of Markov reward automata
• Optimal continuous time Markov decisions
• Queueing Networks and Markov Chains
• The quest for minimal quotients for probabilistic and Markov automata
• Verification of open interactive Markov chains

Cited in

(1)

• A modest approach to Markov automata

This page was built for publication: A modest Markov automata tutorial

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