Quantitative analysis of probabilistic pushdown automata: Expectations and variances

Javier Esparza, Antonín Kučera, Richard Mayr

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

49 Scopus citations

Abstract

Probabilistic pushdown automata (pPDA) have been identified as a natural model for probabilistic programs with recursive procedure calls. Previous works considered the decidability and complexity of the model-checking problem for pPDA and various probabilistic temporal logics. In this paper we concentrate on computing the expected values and variances of various random variables defined over runs of a given probabilistic pushdown automaton. In particular, we show how to compute the expected accumulated reward and the expected gain for certain classes of reward functions. Using these results, we show how to analyze various quantitative properties of pPDA that are not expressible in conventional probabilistic temporal logics.

Original languageEnglish
Title of host publicationProceedings - 20th Annual IEEE symposium on Logic in Computer Science, LICS 2005
Pages117-126
Number of pages10
DOIs
StatePublished - 2005
Externally publishedYes
Event20th Annual IEEE Symposium on Logic in Computer Science, LICS 2005 - Chicago, IL, United States
Duration: 26 Jun 200529 Jun 2005

Publication series

NameProceedings - Symposium on Logic in Computer Science
ISSN (Print)1043-6871

Conference

Conference20th Annual IEEE Symposium on Logic in Computer Science, LICS 2005
Country/TerritoryUnited States
CityChicago, IL
Period26/06/0529/06/05

Fingerprint

Dive into the research topics of 'Quantitative analysis of probabilistic pushdown automata: Expectations and variances'. Together they form a unique fingerprint.

Cite this