A Modest Approach to Modelling and Checking Markov Automata

DOI10.1007/978-3-030-30281-8_4MaRDI QIDQ6488993zbMATH OpenFDO

Authors Yuliya Butkova, Arnd Hartmanns, Holger Hermanns

Publication date 14 March 2024

Full work available at URL https://doi.org/10.1007/978-3-030-30281-8_4

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• A modest approach to Markov automata
• Long-Run Rewards for Markov Automata
• Analysis of timed and long-run objectives for Markov automata
• On the semantics of Markov automata

Cited in

(2)

• A modest Markov automata tutorial
• A modest approach to Markov automata

This page was built for publication: A Modest Approach to Modelling and Checking Markov Automata

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