Efficient Analysis of Probabilistic Programs with an Unbounded Counter (Q5501946): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1975636681 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1102.2529 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Numerical Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Counter Stochastic Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Energy Parity Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Mean-payoff and Energy Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5553606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3262596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rabinizer 2: Small Deterministic Automata for LTL ∖ GU / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3923308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A First Look at Rigorous Probability Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper Bounds for Newton’s Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability with Martingales / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:13, 10 July 2024

scientific article; zbMATH DE number 6472760
Language Label Description Also known as
English
Efficient Analysis of Probabilistic Programs with an Unbounded Counter
scientific article; zbMATH DE number 6472760

    Statements

    Efficient Analysis of Probabilistic Programs with an Unbounded Counter (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 August 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Markov chains
    0 references
    model checking
    0 references
    one-counter automata
    0 references
    0 references
    0 references