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

DOI10.1007/978-3-319-11936-6_26zbMATH Open1448.68320OpenAlexW2188550283MaRDI QIDQ3457809FDOQ3457809

Authors: Guoxin Su, David Samuel Rosenblum 

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

Recommendations

• Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
• Tools and Algorithms for the Construction and Analysis of Systems
• On the Complexity of Reachability in Parametric Markov Decision Processes
• The complexity of reachability in parametric Markov decision processes
• Reachability problems for Markov chains
• Reachability in Recursive Markov Decision Processes
• Reachability in recursive Markov decision processes

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) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (3)

• Sampling-Based Verification of CTMCs with Uncertain Rates
• 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

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