Efficient modelling and generation of Markov automata
DOI10.1007/978-3-642-32940-1_26zbMATH Open1364.68295DBLPconf/concur/TimmerKPS12OpenAlexW2111987809WikidataQ57801061 ScholiaQ57801061MaRDI QIDQ2912690FDOQ2912690
Authors: Mark Timmer, Jaco van de Pol, Mariëlle I. A. Stoelinga, Joost-Pieter Katoen 
Publication date: 25 September 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://research.utwente.nl/en/publications/efficient-modelling-and-generation-of-markov-automata(735d6d1f-f276-4ec9-b432-8ea82b13ba21).html
Recommendations
Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (13)
- A semantics for every GSPN
- A modest approach to Markov automata
- Performance preserving equivalence for stochastic process algebra dtsdPBC
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
- A Tutorial on Interactive Markov Chains
- Sampling different kinds of acyclic automata using Markov chains
- Markov automata with multiple objectives
- Cost vs. time in stochastic games and Markov automata
- Confluence reduction for Markov automata
- Confluence reduction for Markov automata
- A general SOS theory for the specification of probabilistic transition systems
- A modest Markov automata tutorial
- Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata
Uses Software
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)
