Complexity of model checking MDPs against LTL specifications

DOI10.4230/LIPIcs.FSTTCS.2017.35zbMath1491.68111OpenAlexW2788909595MaRDI QIDQ5136327

Dileep Kini, Mahesh Viswanathan

Publication date: 25 November 2020

Full work available at URL: https://doi.org/10.4230/lipics.fsttcs.2017.35

zbMATH Keywords

complexityMarkov decision processesmodel checkinglinear temporal logic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cites Work

• Unnamed Item
• Unnamed Item
• Probabilistic Automata for Safety LTL Specifications
• The complexity of probabilistic verification
• Limit-Deterministic Büchi Automata for Linear Temporal Logic
• Deterministic generators and games for Ltl fragments
• CONCUR 2003 - Concurrency Theory

This page was built for publication: Complexity of model checking MDPs against LTL specifications