Model Checking of Recursive Probabilistic Systems

DOI10.1145/2159531.2159534zbMath1351.68159OpenAlexW2142921329MaRDI QIDQ2946660

Kousha Etessami, Mihalis Yannakakis

Publication date: 17 September 2015

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2159531.2159534

zbMATH Keywords

Markov chainsmodel checkingtemporal logicBüchi automatapushdown systemsstochastic context-free grammarsprobabilistic systemsrecursive systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 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)

Related Items (9)

The satisfiability problem for a quantitative fragment of PCTL ⋮ Model Checking Probabilistic Systems ⋮ Branching-time model-checking of probabilistic pushdown automata ⋮ A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes ⋮ Deciding Fast Termination for Probabilistic VASS with Nondeterminism ⋮ Language equivalence of probabilistic pushdown automata ⋮ The satisfiability problem for a quantitative fragment of PCTL ⋮ Recursive Markov Decision Processes and Recursive Stochastic Games ⋮ Unnamed Item

This page was built for publication: Model Checking of Recursive Probabilistic Systems