scientific article; zbMATH DE number 7378576

DOI10.4230/LIPIcs.CONCUR.2018.32MaRDI QIDQ5009450

Alexej Rotar, Jan Křetínský

Publication date: 4 August 2021

Full work available at URL: https://arxiv.org/abs/1806.11418

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

temporal logicsatisfiabilityprobabilistic verificationprobabilistic computation tree logic

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

The satisfiability problem for a quantitative fragment of PCTL ⋮ Satisfiability of quantitative probabilistic CTL: rise to the challenge ⋮ The satisfiability problem for a quantitative fragment of PCTL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A finite model theorem for the propositional \(\mu\)-calculus
• Propositional dynamic logic of regular programs
• A logic for reasoning about time and reliability
• Microcomputer technique.
• On the universal and existential fragments of the \(\mu\)-calculus
• STACS 2005. 22nd annual symposium on theoretical aspects of computer science, Stuttgart, Germany, February 24--26, 2005. Proceedings.
• Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives
• Markov Chains
• The complexity of probabilistic verification
• On the Satisfiability of Some Simple Probabilistic Logics
• Bounded Satisfiability for PCTL
• Probabilistic propositional temporal logics
• Model Checking Probabilistic Pushdown Automata
• STACS 2005
• STACS 2005
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

This page was built for publication: