The following pages link to (Q4270055):
Displaying 25 items.
- Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games (Q766176) (← links)
- A canonical form based decision procedure and model checking approach for propositional projection temporal logic (Q896152) (← links)
- Multiphase until formulas over Markov reward models: an algebraic approach (Q896909) (← links)
- Performability assessment by model checking of Markov reward models (Q968359) (← links)
- Mixing logics and rewards for the component-oriented specification of performance measures (Q995461) (← links)
- Model checking mobile stochastic logic (Q995465) (← links)
- Approximating labelled Markov processes (Q1398379) (← links)
- Model-checking large structured Markov chains. (Q1400291) (← links)
- A uniformization-based algorithm for continuous-time stochastic games model checking (Q1757155) (← links)
- Performance measure sensitive congruences for Markovian process algebras (Q1853585) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- Bio-PEPA: A framework for the modelling and analysis of biological systems (Q2271444) (← links)
- Comparative branching-time semantics for Markov chains (Q2387196) (← links)
- Model checking open systems with alternating projection temporal logic (Q2424878) (← links)
- Formal reasoning about finite-state discrete-time Markov chains in HOL (Q2434565) (← links)
- Model checking expected time and expected reward formulae with random time bounds (Q2494794) (← links)
- Statistical probabilistic model checking with a focus on time-bounded properties (Q2509358) (← links)
- A theory of stochastic systems. I: Stochastic automata (Q2575854) (← links)
- Nondeterministic probabilistic Petri net -- a new method to study qualitative and quantitative behaviors of system (Q2637309) (← links)
- Efficient Decomposition Algorithm for Stationary Analysis of Complex Stochastic Petri Net Models (Q2822659) (← links)
- On Quantitative Modelling and Verification of DNA Walker Circuits Using Stochastic Petri Nets (Q2941140) (← links)
- Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications (Q3003315) (← links)
- Formal Analysis of Publish-Subscribe Systems by Probabilistic Timed Automata (Q3614855) (← links)
- Process algebra for performance evaluation (Q5958464) (← links)
- Formal modelling and verification of probabilistic resource bounded agents (Q6190087) (← links)
