State explosion in almost-sure probabilistic reachability (Q846015): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2007.01.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2028222307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Is your model checker on time? On the complexity of model checking for timed modal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of probabilistic verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4270052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of Probabilistic Concurrent Program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic verification of real-time systems with discrete probability distributions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal control of diffusion processes with reflection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847023 / rank
 
Normal rank

Latest revision as of 11:00, 2 July 2024

scientific article
Language Label Description Also known as
English
State explosion in almost-sure probabilistic reachability
scientific article

    Statements

    State explosion in almost-sure probabilistic reachability (English)
    0 references
    0 references
    0 references
    29 January 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    probabilistic systems
    0 references
    model checking
    0 references
    computational complexity
    0 references
    formal methods
    0 references
    timed automata
    0 references
    0 references