Model checking for probabilistic timed automata (Q2248072): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4036557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model-checking in dense real-time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal paths in weighted timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of the inverse method to probabilistic timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4965815 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5137353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On probabilistic timed automata. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4264103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2763979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking of probabilistic and nondeterministic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal infinite scheduling for multi-priced timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5437180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updatable timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3336675 / 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: What good are digital clocks? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic model checking for real-time systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive Markov chains. And the quest for quantified quality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concavely-Priced Probabilistic Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking Probabilistic Timed Automata with One or Two Clocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A game-based abstraction-refinement framework for Markov decision processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4965870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Games for Verification of Probabilistic Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance analysis of probabilistic timed automata using digital clocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536598 / 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: Probabilistic model checking of deadline properties in the IEEE 1394 fireWire root contention protocol / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic model checking for probabilistic timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2849849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation through probabilistic testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-abstracted bisimulation: Implicit specifications and decidability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strict Divergence for Probabilistic Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking timed Büchi automata emptiness efficiently / rank
 
Normal rank

Latest revision as of 17:29, 8 July 2024

scientific article
Language Label Description Also known as
English
Model checking for probabilistic timed automata
scientific article

    Statements

    Model checking for probabilistic timed automata (English)
    0 references
    0 references
    30 June 2014
    0 references
    probabilistic timed automata
    0 references
    probabilistic model checking
    0 references
    probabilistic real-time systems
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers