MRMC

swMATH4129MaRDI QIDQ16314FDOQ16314

Author name not available (Why is that?)

Cited In (67)

• Model Based Importance Analysis for Minimal Cut Sets
• Performance Model Checking Scenario-Aware Dataflow
• A Progress Measure for Explicit-State Probabilistic Model-Checkers
• Formal System Verification
• Approximate model checking of stochastic hybrid systems
• Three-valued abstraction for probabilistic systems
• Efficient CSL model checking using stratification
• Coupling and Importance Sampling for Statistical Model Checking
• Multiphase until formulas over Markov reward models: an algebraic approach
• 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
• Lumpability for uncertain continuous-time Markov chains
• Energy-Utility Analysis for Resilient Systems Using Probabilistic Model Checking
• Three-Valued Abstraction for Continuous-Time Markov Chains
• Towards light-weight probabilistic model checking
• Abstraction of Probabilistic Systems
• Time-Bounded Model Checking of Infinite-State Continuous-Time Markov Chains
• Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
• CSL model checking algorithms for QBDs
• Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking
• Mixing logics and rewards for the component-oriented specification of performance measures
• Model checking mobile stochastic logic
• A Tutorial on Interactive Markov Chains
• Formal Dependability Modeling and Analysis: A Survey
• Quantitative Abstractions for Collective Adaptive Systems
• A Framework for Verification of Software with Time and Probabilities
• Observing Continuous-Time MDPs by 1-Clock Timed Automata
• Decidability of Approximate Skolem Problem and Applications to Logical Verification of Dynamical Properties of Markov Chains
• Solving systems of bilinear equations for transition rate reconstruction
• Formal Methods for Biochemical Signalling Pathways
• LTL Model Checking of Time-Inhomogeneous Markov Chains
• Automata-Based CSL Model Checking
• Mean-Field Limits Beyond Ordinary Differential Equations
• CCMC: A Conditional CSL Model Checker for Continuous-Time Markov Chains
• Quantitative Approximation of the Probability Distribution of a Markov Process by Formal Abstractions
• Performability assessment by model checking of Markov reward models
• Improving active Mealy machine learning for protocol conformance testing
• Distributed Synthesis in Continuous Time
• Model checking for probabilistic timed automata
• Stochastic hybrid systems: a powerful framework for complex, large scale applications
• Hierarchical Counterexamples for Discrete-Time Markov Chains
• Model Checking HML on Piecewise-Constant Inhomogeneous Markov Chains
• A formal approach to adaptive software: continuous assurance of non-functional requirements
• FORMALISMS FOR SPECIFYING MARKOVIAN POPULATION MODELS
• Specification and optimal reactive synthesis of run-time enforcement shields
• Extended Directed Search for Probabilistic Timed Reachability
• Probabilistic Model Checking for Energy-Utility Analysis
• 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
• Formalisms for Specifying Markovian Population Models
• Moment-based analysis of Bayesian network properties
• Computing Cumulative Rewards Using Fast Adaptive Uniformization
• Efficient CTMC Model Checking of Linear Real-Time Objectives
• Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes
• Cost Preserving Bisimulations for Probabilistic Automata
• Markov chains and Markov decision processes in Isabelle/HOL
• Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey
• Formal reliability analysis of redundancy architectures
• Comparative Analysis of Statistical Model Checking Tools
• 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