The satisfiability problem for a quantitative fragment of PCTL

DOI10.1016/j.jcss.2023.103478OpenAlexW3180885449MaRDI QIDQ6078294

Miroslav Chodil, Antonín Kučera

Publication date: 24 October 2023

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2023.103478

zbMATH Keywords

satisfiabilityPCTLprobabilistic temporal logics

Mathematics Subject Classification ID

Computer science (68-XX)

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