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

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Approximating the termination value of one-counter MDPs and stochastic games Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
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-letter stack 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 (%22is the optimal termination value equal to 1?%22) 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 (%22is the optimal termination value at least p%22, or %22approximate the termination value within epsilon%22) are far more challenging. 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-letter stack 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 (%22is the optimal termination value equal to 1?%22) 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 (%22is the optimal termination value at least p%22, or %22approximate the termination value within epsilon%22) are far more challenging. (en)
Title	Approximating the termination value of one-counter MDPs and stochastic games Approximating the termination value of one-counter MDPs and stochastic games (en)
skos:prefLabel	Approximating the termination value of one-counter MDPs and stochastic games Approximating the termination value of one-counter MDPs and stochastic games (en)
skos:notation	RIV/00216224:14330/13:00065955!RIV14-MSM-14330___
http://linked.open...avai/riv/aktivita	I P
http://linked.open...avai/riv/aktivity	I, P(1M0545), P(GAP202/10/1469)
http://linked.open...iv/cisloPeriodika	January
http://linked.open...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Brázdil, Tomáš Brožek, Václav Kučera, Antonín
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Masarykova univerzita / Fakulta informatiky
http://linked.open...dnocenehoVysledku	61896
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/13:00065955
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Markov decision processes; one-counter automata (en)
http://linked.open.../riv/klicoveSlovo	one-counter automata Markov decision processes
http://linked.open...odStatuVydavatele	NL - Nizozemsko
http://linked.open...ontrolniKodProRIV	[FAD00E2C9934]
http://linked.open...i/riv/nazevZdroje	Information and Computation
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	4 (xsd:int)
http://linked.open...vavai/riv/projekt	Formal methods for analysis and verification of complex systems Institute for Theoretical Computer Science
http://linked.open...UplatneniVysledku	2013
http://linked.open...v/svazekPeriodika	222
http://linked.open...iv/tvurceVysledku	Brožek, Václav Brázdil, Tomáš Etessami, Kousha Kučera, Antonín
http://linked.open...ain/vavai/riv/wos	000313861100010
issn	0890-5401
number of pages	18 (xsd:int)
http://bibframe.org/vocab/doi	10.1016/j.ic.2012.01.008
http://localhost/t...ganizacniJednotka	14330

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 24 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software