Nested Reachability Approximation for Discrete-Time Markov Chains with Univariate Parameters

DOI10.1007/978-3-319-11936-6_26zbMath1448.68320OpenAlexW2188550283MaRDI QIDQ3457809

David Samuel Rosenblum, Guoxin Su

Publication date: 17 December 2015

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-11936-6_26

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

Sequential Convex Programming for the Efficient Verification of Parametric MDPs ⋮ Deniable Functional Encryption

This page was built for publication: Nested Reachability Approximation for Discrete-Time Markov Chains with Univariate Parameters