Analyzing probabilistic pushdown automata (Q2248071): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the Complexity of Numerical Analysis / 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: Q4551151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5674726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5322945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability analysis of pushdown automata: Application to model-checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discounted Properties of Probabilistic Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Counter Stochastic Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Termination Value of One-Counter MDPs and Stochastic Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching-Time Model-Checking of Probabilistic Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability in recursive Markov decision processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Runtime Analysis of Probabilistic Programs with Unbounded Recursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2004 - Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5524074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTING LEAST FIXED POINTS OF PROBABILISTIC SYSTEMS OF POLYNOMIALS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars / 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: Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of deciding Tarski algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic for reasoning about time and reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5727090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549616 / 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: Q5807665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lattice-theoretical fixpoint theorem and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability with Martingales / rank
 
Normal rank

Latest revision as of 17:29, 8 July 2024

scientific article
Language Label Description Also known as
English
Analyzing probabilistic pushdown automata
scientific article

    Statements

    Analyzing probabilistic pushdown automata (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 June 2014
    0 references
    Markov chains
    0 references
    pushdown automata
    0 references
    model checking
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references