Robust Probabilistic Temporal Logics

06/09/2023

∙

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

READ FULL TEXT

Robust Probabilistic Temporal Logics

Probabilistic Model Checking and Autonomy

Model Checking Temporal Properties of Recursive Probabilistic Programs

Model checking and model synthesisfrom partial models: a logic-based perspective

Responsibility and verification: Importance value in temporal logics

Robust Positivity Problems for low-order Linear Recurrence Sequences

Model Checking for Fragments of Halpern and Shoham's Interval Temporal Logic Based on Track Representatives

Robust Computation Tree Logic

Robust Probabilistic Temporal Logics

Related Research

Probabilistic Model Checking and Autonomy

Model Checking Temporal Properties of Recursive Probabilistic Programs

Model checking and model synthesisfrom partial models: a logic-based perspective

Responsibility and verification: Importance value in temporal logics

Robust Positivity Problems for low-order Linear Recurrence Sequences

Model Checking for Fragments of Halpern and Shoham's Interval Temporal Logic Based on Track Representatives

Robust Computation Tree Logic