Pages that link to "Item:Q2373877"

The following pages link to Symbolic model checking for probabilistic timed automata (Q2373877):

Displaying 43 items.

• Expected reachability-time games (Q278757) (← links)
• Symbolic computing in probabilistic and stochastic analysis (Q327047) (← links)
• A survey of timed automata for the development of real-time systems (Q394966) (← links)
• Branching-time model-checking of probabilistic pushdown automata (Q394999) (← links)
• Minimal counterexamples for linear-time probabilistic verification (Q402125) (← links)
• Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata (Q517046) (← links)
• Constraint Markov chains (Q554215) (← links)
• Expressiveness and conciseness of timed automata for the verification of stochastic models (Q782571) (← links)
• Tweaking the odds in probabilistic timed automata (Q832050) (← links)
• Performance analysis of probabilistic timed automata using digital clocks (Q853731) (← links)
• Probabilistic model checking of deadline properties in the IEEE 1394 fireWire root contention protocol (Q1402478) (← links)
• Automatic verification of real-time systems with discrete probability distributions. (Q1603709) (← links)
• Formal verification and quantitative metrics of MPSoC data dynamics (Q1707342) (← links)
• On probabilistic timed automata. (Q1853732) (← links)
• Probabilistic timed graph transformation systems (Q1994363) (← links)
• An extension of the inverse method to probabilistic timed automata (Q2248053) (← links)
• Model checking for probabilistic timed automata (Q2248072) (← links)
• Abstraction and approximation in fuzzy temporal logics and models (Q2355383) (← links)
• Local abstraction refinement for probabilistic timed programs (Q2453108) (← links)
• Parameter synthesis for probabilistic timed automata using stochastic game abstractions (Q2636513) (← links)
• Probabilistic NetKAT (Q2802486) (← links)
• Statistical Approximation of Optimal Schedulers for Probabilistic Timed Automata (Q2814125) (← links)
• Probabilistic model checking of the CSMA/CD protocol using PRISM and APMC (Q2848422) (← links)
• Symbolic Minimum Expected Time Controller Synthesis for Probabilistic Timed Automata (Q2945592) (← links)
• ExplicitPRISMSymm: Symmetry Reduction Technique for Explicit Models in PRISM (Q2948486) (← links)
• Concavely-Priced Probabilistic Timed Automata (Q3184689) (← links)
• Strict Divergence for Probabilistic Timed Automata (Q3184704) (← links)
• Symbolic Simulation-Checking of Dense-Time Automata (Q3510852) (← links)
• Simulation and Bisimulation for Probabilistic Timed Automata (Q3588096) (← links)
• Stochastic Games for Verification of Probabilistic Timed Automata (Q3648833) (← links)
• Symbolic model checking for probabilistic processes (Q4571974) (← links)
• Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints (Q5039515) (← links)
• Stochastic Differential Dynamic Logic for Stochastic Hybrid Programs (Q5200042) (← links)
• Validation of Stochastic Systems (Q5325838) (← links)
• Theoretical Aspects of Computing – ICTAC 2005 (Q5395106) (← links)
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems (Q5464754) (← links)
• Foundations of Software Science and Computational Structures (Q5705914) (← links)
• Formal Modeling and Analysis of Timed Systems (Q5717504) (← links)
• (Q5858720) (← links)
• Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation (Q5896951) (← links)
• Verifying Probabilistic Timed Automata Against Omega-Regular Dense-Time Properties (Q6104804) (← links)
• Distributed parametric model checking timed automata under non-zenoness assumption (Q6108439) (← links)
• Minimal Witnesses for Probabilistic Timed Automata (Q6485908) (← links)