The satisfiability and validity problems for probabilistic CTL

DOI10.1007/978-3-031-72621-7_2MaRDI QIDQ7405566zbMATH OpenFDO

Authors Antonin Kučera

Publication date 2024

Full work available at URL https://doi.org/10.1007/978-3-031-72621-7_2

zbMATH Keywords

probabilistic CTLprobabilistic temporal logicssatisfiability

Mathematics Subject Classification ID

Temporal logic (03B44) Probability and inductive logic (03B48) Specification and verification (program logics, model checking, etc.) (68Q60) Computational aspects of satisfiability (68R07)

Cites work

• A finite model theorem for the propositional \(\mu\)-calculus
• A logic for reasoning about time and reliability
• Bounded satisfiability for PCTL
• Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives
• scientific article; zbMATH DE number 1142326 (Why is no real title available?)
• scientific article; zbMATH DE number 765034 (Why is no real title available?)
• scientific article; zbMATH DE number 7280017 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• Model checking of probabilistic and nondeterministic systems
• Model checking of recursive probabilistic systems
• Model Checking Probabilistic Pushdown Automata
• On the satisfiability of some simple probabilistic logics
• Propositional dynamic logic of regular programs
• Reasoning with time and chance
• STACS 2005
• The finite satisfiability problem for PCTL is undecidable
• The satisfiability problem for a quantitative fragment of PCTL
• The satisfiability problem for unbounded fragments of probabilistic CTL

This page was built for publication: The satisfiability and validity problems for probabilistic CTL

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