Dirac-based reduction techniques for quantitative analysis of discrete-time Markov models

DOI10.1007/978-3-030-57852-7_1OpenAlexW3082939421MaRDI QIDQ1997254

Mohammadsadegh Mohagheghi, Behrang Chaboki

Publication date: 1 March 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-57852-7_1

zbMATH Keywords

Markov decision processesquantitative verificationdiscrete-time Markov chainsprobabilistic model checking

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Theory of computing (68Qxx)

Cites Work

• Ouroboros: a provably secure proof-of-stake blockchain protocol
• The sleepy model of consensus
• Bounds on differential and linear branch number of permutations
• Open-Domain Question–Answering
• A New Classification of 4-bit Optimal S-boxes and Its Application to PRESENT, RECTANGLE and SPONGENT
• Communication Theory of Secrecy Systems*
• Analysis of the Blockchain Protocol in Asynchronous Networks

This page was built for publication: Dirac-based reduction techniques for quantitative analysis of discrete-time Markov models