Branching-time model-checking of probabilistic pushdown automata (Q394999): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q60 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q45 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q87 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6251115 / rank
 
Normal rank
Property / zbMATH Keywords
 
probabilistic systems
Property / zbMATH Keywords: probabilistic systems / rank
 
Normal rank
Property / zbMATH Keywords
 
pushdown automata
Property / zbMATH Keywords: pushdown automata / rank
 
Normal rank
Property / zbMATH Keywords
 
branching-time logics
Property / zbMATH Keywords: branching-time logics / rank
 
Normal rank
Property / zbMATH Keywords
 
model-checking
Property / zbMATH Keywords: model-checking / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2013.07.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2088970711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results on branching-time pushdown model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discounted Properties of Probabilistic Pushdown Automata / 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: Qualitative Reachability in Stochastic BPA Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing probabilistic pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005. 22nd annual symposium on theoretical aspects of computer science, Stuttgart, Germany, February 24--26, 2005. Proceedings. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking Probabilistic Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking LTL with regular valuations for pushdown systems / 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: Automata, Languages and Programming / 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: Model Checking of Recursive Probabilistic Systems / 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: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3322961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472439 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:36, 7 July 2024

scientific article
Language Label Description Also known as
English
Branching-time model-checking of probabilistic pushdown automata
scientific article

    Statements

    Branching-time model-checking of probabilistic pushdown automata (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 January 2014
    0 references
    probabilistic systems
    0 references
    pushdown automata
    0 references
    branching-time logics
    0 references
    model-checking
    0 references

    Identifiers