A modest Markov automata tutorial
From MaRDI portal
Publication:6535989
DOI10.1007/978-3-030-31423-1_8zbMATH Open1539.68135MaRDI QIDQ6535989FDOQ6535989
Authors: Arnd Hartmanns, Holger Hermanns 
Publication date: 14 March 2024
Recommendations
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?)
- Optimal continuous time Markov decisions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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.
- Verification of open interactive Markov chains
- Concurrency and composition in a stochastic world
- Queueing Networks and Markov Chains
- Efficient modelling and generation of Markov automata
- Analysis of timed and long-run objectives for Markov automata
- Confluence reduction for Markov automata
- A semantics for every GSPN
- Measurability and safety verification for stochastic hybrid systems
- A compositional modelling and analysis framework for stochastic hybrid systems
- Modelling and analysis of Markov reward automata
- The quest for minimal quotients for probabilistic and Markov automata
- Long-Run Rewards for Markov Automata
- Cost vs. time in stochastic games and Markov automata
- Abstraction-based computation of reward measures for Markov automata
- Explicit model checking of very large MDP using partitioning and secondary storage
- A Modest Approach to Modelling and Checking Markov Automata
Cited In (1)
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)
