MRMC

swMATH4129MaRDI QIDQ16314FDOQ16314

Author name not available (Why is that?)

Cited In (66)

• Performance model checking scenario-aware dataflow
• Formal system verification. State-of the-art and future trends
• A progress measure for explicit-state probabilistic model-checkers
• Model Based Importance Analysis for Minimal Cut Sets
• Approximate model checking of stochastic hybrid systems
• Probabilistic model checking for energy-utility analysis
• Three-valued abstraction for probabilistic systems
• Efficient CSL model checking using stratification
• Multiphase until formulas over Markov reward models: an algebraic approach
• A framework for verification of software with time and probabilities
• Minimal counterexamples for linear-time probabilistic verification
• Efficient approximation of optimal control for continuous-time Markov games
• Smoothed model checking for uncertain continuous-time Markov chains
• Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops
• Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
• LTL model checking of time-inhomogeneous Markov chains
• Lumpability for uncertain continuous-time Markov chains
• Cost preserving bisimulations for probabilistic automata
• Formal methods for biochemical signalling pathways
• Three-Valued Abstraction for Continuous-Time Markov Chains
• Towards light-weight probabilistic model checking
• Observing continuous-time MDPs by 1-clock timed automata
• Computing cumulative rewards using fast adaptive uniformization
• Abstraction of Probabilistic Systems
• Formal dependability modeling and analysis: a survey
• Quantitative abstractions for collective adaptive systems
• Decidability of approximate Skolem problem and applications to logical verification of dynamical properties of Markov chains
• Automata-based CSL model checking
• Counterexample generation for discrete-time Markov models: an introductory survey
• Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
• CSL model checking algorithms for QBDs
• Mean-field limits beyond ordinary differential equations
• Mixing logics and rewards for the component-oriented specification of performance measures
• Model checking mobile stochastic logic
• Hierarchical counterexamples for discrete-time Markov chains
• A Tutorial on Interactive Markov Chains
• Formalisms for specifying Markovian population models
• Distributed synthesis in continuous time
• Energy-utility analysis for resilient systems using probabilistic model checking
• Solving systems of bilinear equations for transition rate reconstruction
• Quantitative Approximation of the Probability Distribution of a Markov Process by Formal Abstractions
• Performability assessment by model checking of Markov reward models
• Distributed Markovian bisimulation reduction aimed at CSL model checking
• Improving active Mealy machine learning for protocol conformance testing
• Model checking for probabilistic timed automata
• Stochastic hybrid systems: a powerful framework for complex, large scale applications
• Model Checking HML on Piecewise-Constant Inhomogeneous Markov Chains
• A formal approach to adaptive software: continuous assurance of non-functional requirements
• Comparative analysis of statistical model checking tools
• Extended Directed Search for Probabilistic Timed Reachability
• Algorithmic probabilistic game semantics. Playing games with automata
• Exact quantitative probabilistic model checking through rational search
• Precisely deciding CSL formulas through approximate model checking for CTMCs
• Fault trees on a diet: automated reduction by graph rewriting
• Coupling and importance sampling for statistical model checking
• Formalisms for Specifying Markovian Population Models
• Moment-based analysis of Bayesian network properties
• Efficient CTMC Model Checking of Linear Real-Time Objectives
• Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes
• Time-bounded model checking of infinite-state continuous-time Markov chains
• Markov chains and Markov decision processes in Isabelle/HOL
• CCMC: a conditional CSL model checker for continuous-time Markov chains
• Formal reliability analysis of redundancy architectures
• Characterization and computation of infinite-horizon specifications over Markov processes
• Providing Evidence of Likely Being on Time: Counterexample Generation for CTMC Model Checking
• Dynamic Bayesian networks for formal verification of structured stochastic processes

This page was built for software: MRMC