Work

Robust probabilistic temporal logics

Year: 2024

Type: article

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.

Source: Information Processing Letters

DOI: 10.1016/j.ipl.2024.106522

Author: Martin Zimmermann

Institution: Aalborg University

Language: English

Topic: Formal Methods in Verification

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $2,220

Funders: Innovationsfonden, Danish Hydrocarbon Research and Technology Centre, Technical University of Denmark

OpenAlex ID: W4401438790

FWCI: 0.195

Cites: 22

Cited by: 1

Related to: 10