Pages that link to "Item:Q5738903"

The following pages link to Model-checking continuous-time Markov chains (Q5738903):

Displaying 18 items.

• Approximating Markov processes through filtration (Q442296) (← links)
• Three-valued abstraction for probabilistic systems (Q444484) (← links)
• Modelling IEEE 802.11 CSMA/CA RTS/CTS with stochastic bigraphs with sharing (Q736791) (← links)
• Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games (Q766176) (← links)
• Measuring the constrained reachability in quantum Markov chains (Q824285) (← links)
• Performability assessment by model checking of Markov reward models (Q968359) (← links)
• CSL model checking algorithms for QBDs (Q995462) (← links)
• Model checking mobile stochastic logic (Q995465) (← links)
• Assisting the design of a groupware system - Model checking usability aspects of thinkteam (Q1014561) (← links)
• Model-checking large structured Markov chains. (Q1400291) (← links)
• Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes. (Q1400292) (← links)
• Model checking Markov population models by stochastic approximations (Q1784959) (← links)
• Guarded autonomous transitions increase conciseness and expressiveness of timed automata (Q1996031) (← links)
• Compositional construction of control barrier functions for continuous-time stochastic hybrid systems (Q2081792) (← links)
• Computing branching distances with quantitative games (Q2210522) (← links)
• Model checking for performability (Q2843861) (← links)
• Bounded model checking for interval probabilistic timed graph transformation systems against properties of probabilistic metric temporal graph logic (Q6151620) (← links)
• Constraint-based debugging in probabilistic model checking (Q6488104) (← links)