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”

Approximating the termination value of one-counter MDPs and stochastic games

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F13%3A00065955" target="_blank" >RIV/00216224:14330/13:00065955 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1016/j.ic.2012.01.008" target="_blank" >http://dx.doi.org/10.1016/j.ic.2012.01.008</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.ic.2012.01.008" target="_blank" >10.1016/j.ic.2012.01.008</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Approximating the termination value of one-counter MDPs and stochastic games

  • Original language description

    One-counter MDPs (OC-MDPs) and one-counter simple stochastic games (OC-SSGs) are 1-player, and 2-player turn-based zero-sum, stochastic games played on the transition graph of classic one-counter automata (equivalently, pushdown automata with a 1-letterstack alphabet). A key objective for the analysis and verification of these games is the termination objective, where the players aim to maximize (minimize, respectively) the probability of hitting counter value 0, starting at a given control state and given counter value. Recently, we studied qualitative decision problems ("is the optimal termination value equal to 1?") for OC-MDPs (and OC-SSGs) and showed them to be decidable in polynomial time (in NP intersection coNP, respectively). However, quantitative decision and approximation problems ("is the optimal termination value at least p", or "approximate the termination value within epsilon") are far more challenging.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2013

  • 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

  • Name of the periodical

    Information and Computation

  • ISSN

    0890-5401

  • e-ISSN

  • Volume of the periodical

    222

  • Issue of the periodical within the volume

    January

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    18

  • Pages from-to

    121-138

  • UT code for WoS article

    000313861100010

  • EID of the result in the Scopus database