Computing expected runtimes for constant probability programs (Q2305420): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2969916489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4943605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The solution of linear probabilistic recurrence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of Integer Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Counter Stochastic Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Expected Termination Time in One-Counter Markov Decision Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing probabilistic pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated recurrence analysis for almost-linear expected-runtime bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic invariants for probabilistic termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4679023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5798359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of triangular Integer loops is decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of nondeterministic probabilistic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing expected runtimes for constant probability programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2744679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hardness of Almost–Sure Termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic recurrence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstraction, Refinement and Proof for Probabilistic Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Termination of Integer Linear Loops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4315289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5731217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verified tail bounds for randomized programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank

Latest revision as of 02:07, 22 July 2024

scientific article
Language Label Description Also known as
English
Computing expected runtimes for constant probability programs
scientific article

    Statements

    Computing expected runtimes for constant probability programs (English)
    0 references
    0 references
    0 references
    0 references
    10 March 2020
    0 references
    0 references
    probabilistic programs
    0 references
    expected runtimes
    0 references
    (positive) almost sure termination
    0 references
    complexity
    0 references
    decidability
    0 references
    0 references
    0 references
    0 references