All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

The Finite Satisfiability Problem for PCTL is Undecidable

The result's identifiers

  • Result code in IS VaVaI

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

  • Result on the web

    <a href="http://dx.doi.org/10.1145/3661814.3662145" target="_blank" >http://dx.doi.org/10.1145/3661814.3662145</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1145/3661814.3662145" target="_blank" >10.1145/3661814.3662145</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    The Finite Satisfiability Problem for PCTL is Undecidable

  • Original language description

    We show that the problem of whether a given PCTL formula has a finite model is undecidable. The undecidability result holds even for formulae of the form phi_1 wedge G=1 phi_2 where the validity of phi_1,phi_2 depends only on the states reachable in at most two transitions. Consequently, the problem of whether a given PCTL formula is valid in all finite-state Markov chains is not even semi-decidable.

  • Czech name

  • Czech description

Classification

  • 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)

Result continuities

  • Project

    <a href="/en/project/GA21-24711S" target="_blank" >GA21-24711S: Efficient Analysis and Optimization for Probabilistic Systems and Games</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2024

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science

  • ISBN

    9798400706608

  • ISSN

    1043-6871

  • e-ISSN

  • Number of pages

    14

  • Pages from-to

    1-14

  • Publisher name

    IEEE Computer Society

  • Place of publication

    New York, United States

  • Event location

    Tallinn, Estonia

  • Event date

    Jan 1, 2024

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    001275042100022