The following pages link to MRMC (Q16314):
Displaying 50 items.
- Efficient approximation of optimal control for continuous-time Markov games (Q259052) (← links)
- Smoothed model checking for uncertain continuous-time Markov chains (Q259074) (← links)
- Characterization and computation of infinite-horizon specifications over Markov processes (Q386604) (← links)
- Minimal counterexamples for linear-time probabilistic verification (Q402125) (← links)
- Three-valued abstraction for probabilistic systems (Q444484) (← links)
- Improving active Mealy machine learning for protocol conformance testing (Q479471) (← links)
- Dynamic Bayesian networks for formal verification of structured stochastic processes (Q523135) (← links)
- Stochastic hybrid systems: a powerful framework for complex, large scale applications (Q629645) (← links)
- Approximate model checking of stochastic hybrid systems (Q629650) (← links)
- Formal reliability analysis of redundancy architectures (Q667523) (← links)
- Lumpability for uncertain continuous-time Markov chains (Q832091) (← 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)
- CSL model checking algorithms for QBDs (Q995462) (← links)
- Model checking mobile stochastic logic (Q995465) (← links)
- Markov chains and Markov decision processes in Isabelle/HOL (Q1701041) (← links)
- A formal approach to adaptive software: continuous assurance of non-functional requirements (Q1941849) (← links)
- Moment-based analysis of Bayesian network properties (Q2072070) (← links)
- Solving systems of bilinear equations for transition rate reconstruction (Q2145274) (← links)
- Exact quantitative probabilistic model checking through rational search (Q2225475) (← links)
- Model checking for probabilistic timed automata (Q2248072) (← links)
- Algorithmic probabilistic game semantics. Playing games with automata (Q2248076) (← links)
- Towards light-weight probabilistic model checking (Q2336743) (← links)
- Precisely deciding CSL formulas through approximate model checking for CTMCs (Q2402369) (← links)
- Fault trees on a diet: automated reduction by graph rewriting (Q2403528) (← links)
- Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes (Q2407982) (← links)
- Specification and optimal reactive synthesis of run-time enforcement shields (Q2672248) (← links)
- Distributed Synthesis in Continuous Time (Q2811352) (← links)
- Formal Dependability Modeling and Analysis: A Survey (Q2817299) (← links)
- Mean-Field Limits Beyond Ordinary Differential Equations (Q2822663) (← links)
- Quantitative Abstractions for Collective Adaptive Systems (Q2822665) (← links)
- Coupling and Importance Sampling for Statistical Model Checking (Q2894280) (← links)
- Efficient CSL Model Checking Using Stratification (Q2904612) (← links)
- A Tutorial on Interactive Markov Chains (Q2937729) (← links)
- Decidability of Approximate Skolem Problem and Applications to Logical Verification of Dynamical Properties of Markov Chains (Q2946750) (← links)
- Comparative Analysis of Statistical Model Checking Tools (Q2975907) (← links)
- Efficient CTMC Model Checking of Linear Real-Time Objectives (Q3000642) (← links)
- Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications (Q3003315) (← links)
- Automata-Based CSL Model Checking (Q3012926) (← links)
- A Progress Measure for Explicit-State Probabilistic Model-Checkers (Q3012927) (← links)
- FORMALISMS FOR SPECIFYING MARKOVIAN POPULATION MODELS (Q3016219) (← links)
- Performance Model Checking Scenario-Aware Dataflow (Q3172842) (← links)
- Observing Continuous-Time MDPs by 1-Clock Timed Automata (Q3172860) (← links)
- Hierarchical Counterexamples for Discrete-Time Markov Chains (Q3172933) (← links)
- Quantitative Approximation of the Probability Distribution of a Markov Process by Formal Abstractions (Q3196339) (← links)
- Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops (Q3297595) (← links)
- Time-Bounded Model Checking of Infinite-State Continuous-Time Markov Chains (Q3400550) (← links)
- Providing Evidence of Likely Being on Time: Counterexample Generation for CTMC Model Checking (Q3510805) (← links)
- Abstraction of Probabilistic Systems (Q3510828) (← links)
