The Satisfiability and Validity Problems for Probabilistic CTL

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F24%3A00139282" target="_blank" >RIV/00216224:14330/24:00139282 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1007/978-3-031-72621-7_2" target="_blank" >http://dx.doi.org/10.1007/978-3-031-72621-7_2</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-031-72621-7_2" target="_blank" >10.1007/978-3-031-72621-7_2</a>

Result language

angličtina

Original language name

The Satisfiability and Validity Problems for Probabilistic CTL

Original language description

Probabilistic CTL is obtained from the standard CTL (Computational Tree Logic) by replacing the existential and universal path quantifiers with the probabilistic operator where the probability of runs satisfying a given path formula is bounded by a rational constant. We survey the existing results about the satisfiability and validity problems for probabilistic CTL, and we also present some of the underlying proof techniques.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

—

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2024

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

18th International Conference on Reachability Problems, RP 2024

ISBN

9783031726200

ISSN

0302-9743

e-ISSN

1611-3349

Number of pages

10

Pages from-to

9-18

Publisher name

Springer

Place of publication

Cham

Event location

Vienna, AUSTRIA

Event date

Apr 1, 2024

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

001329982700002