MRMC
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Galileo
- GreatSPN
- SBML Test Suite
- SIGREF
- PRISM
- Bio-PEPA
- JTorX
- GreatSPN 1.7
- BISIMULATOR
- M-TREE
- SMART_
- ProbDiVinE
- LiQuor
- PASS
- CEGAR
- Markov chains and Markov decision processes in Isabelle/HOL
- CADP
- COMICS
- A formal approach to adaptive software: continuous assurance of non-functional requirements
- REACH
- SPNP
- Moment-based analysis of Bayesian network properties
- ULM
- Ymer
- Solving systems of bilinear equations for transition rate reconstruction
- PARAM
- DiPro
- TVT
- SCOOT
- Pinapa
- MoMo
- Casaal
- Exact quantitative probabilistic model checking through rational search
- STOCKS
- Model checking for probabilistic timed automata
- Algorithmic probabilistic game semantics. Playing games with automata
- PEPA
- ArgoUML
- Towards light-weight probabilistic model checking
- Precisely deciding CSL formulas through approximate model checking for CTMCs
- Fault trees on a diet: automated reduction by graph rewriting
- Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes
- DIFtree
- MARCIE
- MC2
- SABRE
- HASL
- Rapture
- Efficient approximation of optimal control for continuous-time Markov games
- Smoothed model checking for uncertain continuous-time Markov chains
- Concurrency Workbench
- StochDynTools
- ADABU
- Distributed synthesis in continuous time
- Formal dependability modeling and analysis: a survey
- Mean-field limits beyond ordinary differential equations
- Quantitative abstractions for collective adaptive systems
- Coupling and importance sampling for statistical model checking
- Efficient CSL model checking using stratification
- Storm
- A Tutorial on Interactive Markov Chains
- Decidability of approximate Skolem problem and applications to logical verification of dynamical properties of Markov chains
- Comparative analysis of statistical model checking tools
- Efficient CTMC Model Checking of Linear Real-Time Objectives
- Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
- Automata-based CSL model checking
- A progress measure for explicit-state probabilistic model-checkers
- Formalisms for specifying Markovian population models
- Performance model checking scenario-aware dataflow
- Observing continuous-time MDPs by 1-clock timed automata
- Hierarchical counterexamples for discrete-time Markov chains
- Mec 5
- Quantitative Approximation of the Probability Distribution of a Markov Process by Formal Abstractions
- DCVALID
- CARMA
- PALOMA
- Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops
- INFAMY
- VERSA
- Time-bounded model checking of infinite-state continuous-time Markov chains
- Providing Evidence of Likely Being on Time: Counterexample Generation for CTMC Model Checking
- Abstraction of Probabilistic Systems
- Extended Directed Search for Probabilistic Timed Reachability
- Model Based Importance Analysis for Minimal Cut Sets
- Model Checking HML on Piecewise-Constant Inhomogeneous Markov Chains
- Formal methods for biochemical signalling pathways
- A framework for verification of software with time and probabilities
- Formalisms for Specifying Markovian Population Models
- LTL model checking of time-inhomogeneous Markov chains
- Aligator.jl
- Characterization and computation of infinite-horizon specifications over Markov processes
- JScience
- Minimal counterexamples for linear-time probabilistic verification
- Markov Models
- Figaro
- mCRL
- Three-valued abstraction for probabilistic systems
- PLASMA-lab
- PROPhESY
- Formal system verification. State-of the-art and future trends
This page was built for software: MRMC
