Decidability of Approximate Skolem Problem and Applications to Logical Verification of Dynamical Properties of Markov Chains

DOI10.1145/2666772zbMath1354.68168OpenAlexW2020183404WikidataQ59196625 ScholiaQ59196625MaRDI QIDQ2946750

No author found.

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/2666772

zbMATH Keywords

Markov chainstemporal logicSkolem problem

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) 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) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

Decidable and expressive classes of probabilistic automata

Uses Software

• PRISM
• MRMC
• LiQuor

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate Verification of the Symbolic Dynamics of Markov Chains
• A Logic of Probability with Decidable Model Checking
• Temporalization of Probabilistic Propositional Logic
• Symbolic model checking for probabilistic processes
• Decision Problems for Linear Recurrence Sequences
• Validation of Stochastic Systems

This page was built for publication: Decidability of Approximate Skolem Problem and Applications to Logical Verification of Dynamical Properties of Markov Chains