Satisfiability of quantitative probabilistic CTL: rise to the challenge

DOI10.1007/978-3-031-22337-2_18zbMath1528.68216OpenAlexW4312390837MaRDI QIDQ6113985

Jan Křetínský, Miroslav Chodil, Antonín Kučera

Publication date: 10 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-22337-2_18

zbMATH Keywords

satisfiabilityPCTLprobabilistic temporal logics

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using branching time temporal logic to synthesize synchronization skeletons
• A finite model theorem for the propositional \(\mu\)-calculus
• Propositional dynamic logic of regular programs
• A logic for reasoning about time and reliability
• The satisfiability problem for a quantitative fragment of PCTL
• Faster statistical model checking for unbounded temporal properties
• On the universal and existential fragments of the \(\mu\)-calculus
• Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives
• Quantitative Languages
• Better Quality in Synthesis through Quantitative Objectives
• Reasoning with time and chance
• A really temporal logic
• The complexity of probabilistic verification
• Linear Distances between Markov Chains
• On the Satisfiability of Some Simple Probabilistic Logics
• Bounded Satisfiability for PCTL
• Probabilistic propositional temporal logics
• Model Checking Probabilistic Pushdown Automata
• Correct Hardware Design and Verification Methods
• STACS 2005
• STACS 2005
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

This page was built for publication: Satisfiability of quantitative probabilistic CTL: rise to the challenge