The satisfiability problem for a quantitative fragment of PCTL

DOI10.1007/978-3-030-86593-1_10OpenAlexW3200370358MaRDI QIDQ2140493

Yanyan Li

Publication date: 20 May 2022

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

zbMATH Keywords

satisfiabilityPCTLprobabilistic temporal logics

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Satisfiability of quantitative probabilistic CTL: rise to the challenge

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Propositional dynamic logic of regular programs
• A logic for reasoning about time and reliability
• Temporal logic in specification. Altrincham, UK, April 8-10, 1987. Proceedings
• Model Checking of Recursive Probabilistic Systems
• Model checking of probabilistic and nondeterministic systems
• Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives
• Reasoning with time and chance
• On the Satisfiability of Some Simple Probabilistic Logics
• Bounded Satisfiability for PCTL
• Model Checking Probabilistic Pushdown Automata
• STACS 2005

This page was built for publication: The satisfiability problem for a quantitative fragment of PCTL