Robust Probabilistic Temporal Logics

2023/06/09 by Zimmermann, Martin
#FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic in Computer Science (cs.LO)

paper · doi:10.48550/arxiv.2306.05806

Abstract

We robustify PCTL and PCTL*, the most important specification languages for probabilistic systems, and show that robustness does not increase the complexity of their model-checking problems.

Related

• HyperPCTL: A Temporal Logic for Probabilistic Hyperproperties
• Model-checking branching-time properties of probabilistic automata and probabilistic one-counter automata
• Model-Checking PCTL Properties of Stateless Probabilistic Pushdown Systems
• A Probabilistic Variant of Projection Temporal Logic
• Probabilistic Model Checking for Propositional Projection Temporal Logic