A modest Markov automata tutorial
From MaRDI portal
Publication:6535989
DOI10.1007/978-3-030-31423-1_8zbMATH Open1539.68135MaRDI QIDQ6535989
Arnd Hartmanns, Holger Hermanns
Publication date: 14 March 2024
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Confluence reduction for Markov automata
- Interactive Markov chains. And the quest for quantified quality
- Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games
- Automatic verification of real-time systems with discrete probability distributions.
- The quest for minimal quotients for probabilistic and Markov automata
- Markov automata with multiple objectives
- A compositional modelling and analysis framework for stochastic hybrid systems
- Cost vs. time in stochastic games and Markov automata
- Efficient Modelling and Generation of Markov Automata
- Analysis of timed and long-run objectives for Markov automata
- Verification of Open Interactive Markov Chains
- Measurability and safety verification for stochastic hybrid systems
- Long-Run Rewards for Markov Automata
- Modelling and Analysis of Markov Reward Automata
- Explicit Model Checking of Very Large MDP Using Partitioning and Secondary Storage
- Optimal Continuous Time Markov Decisions
- Concurrency and Composition in a Stochastic World
- Abstraction-Based Computation of Reward Measures for Markov Automata
- A Semantics for Every GSPN
- Queueing Networks and Markov Chains
- A Modest Approach to Modelling and Checking 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)
