MRMC
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Quantitative Approximation of the Probability Distribution of a Markov Process by Formal Abstractions
- Distributed synthesis in continuous time
- Extended Directed Search for Probabilistic Timed Reachability
- Performability assessment by model checking of Markov reward models
- Algorithmic probabilistic game semantics. Playing games with automata
- Lumpability for uncertain continuous-time Markov chains
- CCMC: a conditional CSL model checker for continuous-time Markov chains
- Approximate model checking of stochastic hybrid systems
- Three-Valued Abstraction for Continuous-Time Markov Chains
- Formal dependability modeling and analysis: a survey
- Formalisms for Specifying Markovian Population Models
- Minimal counterexamples for linear-time probabilistic verification
- Distributed Markovian bisimulation reduction aimed at CSL model checking
- Coupling and importance sampling for statistical model checking
- Cost preserving bisimulations for probabilistic automata
- Automata-based CSL model checking
- Hierarchical counterexamples for discrete-time Markov chains
- Formal reliability analysis of redundancy architectures
- Three-valued abstraction for probabilistic systems
- Galileo
- GreatSPN
- SIGREF
- PRISM
- Bio-PEPA
- JTorX
- GreatSPN 1.7
- BISIMULATOR
- M-TREE
- LiQuor
- SMART_
- ProbDiVinE
- PASS
- CEGAR
- CADP
- COMICS
- REACH
- SPNP
- ULM
- DiPro
- PARAM
- Casaal
- Ymer
- Pinapa
- MoMo
- SCOOT
- TVT
- ArgoUML
- PEPA
- STOCKS
- DIFtree
- MARCIE
- MC2
- SABRE
- HASL
- Rapture
- Concurrency Workbench
- StochDynTools
- ADABU
- Storm
- Characterization and computation of infinite-horizon specifications over Markov processes
- CARMA
- Figaro
- Mec 5
- DCVALID
- PALOMA
- INFAMY
- VERSA
- Aligator.jl
- JScience
- Markov Models
- mCRL
- PLASMA-lab
- PROPhESY
- Time-bounded model checking of infinite-state continuous-time Markov chains
- iscasMc
- AMT
- ASDeX
- POWER-TRUCTOR
- Efficient CSL model checking using stratification
- Dynamic Bayesian networks for formal verification of structured stochastic processes
- Efficient approximation of optimal control for continuous-time Markov games
- Smoothed model checking for uncertain continuous-time Markov chains
- Model checking for probabilistic timed automata
- Multiphase until formulas over Markov reward models: an algebraic approach
- Counterexample generation for discrete-time Markov models: an introductory survey
- Improving active Mealy machine learning for protocol conformance testing
- Formalisms for specifying Markovian population models
- Stochastic hybrid systems: a powerful framework for complex, large scale applications
- Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
- CSL model checking algorithms for QBDs
- Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
- Performance model checking scenario-aware dataflow
- Model Based Importance Analysis for Minimal Cut Sets
- A framework for verification of software with time and probabilities
- Mixing logics and rewards for the component-oriented specification of performance measures
- Model checking mobile stochastic logic
- LTL model checking of time-inhomogeneous Markov chains
- Computing cumulative rewards using fast adaptive uniformization
- Comparative analysis of statistical model checking tools
- Precisely deciding CSL formulas through approximate model checking for CTMCs
This page was built for software: MRMC
