Pages that link to "Item:Q2373877"
From MaRDI portal
The following pages link to Symbolic model checking for probabilistic timed automata (Q2373877):
Displayed 16 items.
- Expected reachability-time games (Q278757) (← links)
- A survey of timed automata for the development of real-time systems (Q394966) (← links)
- Minimal counterexamples for linear-time probabilistic verification (Q402125) (← links)
- Constraint Markov chains (Q554215) (← 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)
- Probabilistic NetKAT (Q2802486) (← links)
- Statistical Approximation of Optimal Schedulers for Probabilistic Timed Automata (Q2814125) (← 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)
- Stochastic Games for Verification of Probabilistic Timed Automata (Q3648833) (← links)
- Stochastic Differential Dynamic Logic for Stochastic Hybrid Programs (Q5200042) (← links)