J 2024

The satisfiability problem for a quantitative fragment of PCTL

CHODIL, Miroslav and Antonín KUČERA

Basic information

Original name

The satisfiability problem for a quantitative fragment of PCTL

Authors

CHODIL, Miroslav (703 Slovakia, belonging to the institution) and Antonín KUČERA (203 Czech Republic, guarantor, belonging to the institution)

Edition

Journal of Computer and System Sciences, SAN DIEGO, Elsevier, 2024, 0022-0000

Other information

Language

English

Type of outcome

Article in a journal

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

United States of America

Confidentiality degree

is not subject to a state or trade secret

References:

Impact factor

Impact factor: 1.100 in 2022

Organization unit

Faculty of Informatics

DOI

UT WoS

001097220800001

Keywords in English

Satisfiability; Probabilistic temporal logics; PCTL

Tags

International impact, Reviewed
Changed: 18/11/2024 12:50, prof. RNDr. Antonín Kučera, Ph.D.

Abstract

V originále

We propose a generic method for proving the decidability of the finite satisfiability problem for PCTL fragments and demonstrate its applicability in several non-trivial examples.(c) 2023 Elsevier Inc. All rights reserved.

Links

GA21-24711S, research and development project
Name: Efektivní analýza a optimalizace pravděpodobnostních systémů a her (Acronym: Efektivní analýza a optimalizace pravděpodobnostní)
Investor: Czech Science Foundation
MUNI/A/1081/2022, interní kód MU
Name: Modelování, analýza a verifikace (2023)
Investor: Masaryk University
MUNI/A/1592/2023, interní kód MU
Name: Modelování, analýza a verifikace (2024)
Investor: Masaryk University, Modeling, analysis, and verification (2024)
MUNI/A/1608/2023, interní kód MU
Name: Zapojení studentů Fakulty informatiky do mezinárodní vědecké komunity 24
Investor: Masaryk University