Efficient modelling and generation of Markov automata
From MaRDI portal
Publication:2912690
Recommendations
Cited in
(12)- A general SOS theory for the specification of probabilistic transition systems
- Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata
- Cost vs. time in stochastic games and Markov automata
- A modest approach to Markov automata
- Sampling different kinds of acyclic automata using Markov chains
- A semantics for every GSPN
- A Tutorial on Interactive Markov Chains
- A modest Markov automata tutorial
- Confluence reduction for Markov automata
- Confluence reduction for Markov automata
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
- Performance preserving equivalence for stochastic process algebra dtsdPBC
This page was built for publication: Efficient modelling and generation of Markov automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2912690)