scientific article; zbMATH DE number 2080040
From MaRDI portal
Publication:4472227
Recommendations
Cited in
(33)- A GPGPU-based simulator for Prism: statistical verification of results of PMC
- Query-based verification of qualitative trends and oscillations in biochemical systems
- Analysing biochemical oscillation through probabilistic model checking
- Lazy probabilistic model checking without determinisation
- Model checking finite-horizon Markov chains with probabilistic inference
- Formal Methods in Computer-Aided Design
- Verification, Model Checking, and Abstract Interpretation
- Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
- Automated Technology for Verification and Analysis
- Fast debugging of PRISM models
- On the use of MTBDDs for performability analysis and verification of stochastic systems.
- scientific article; zbMATH DE number 1538049 (Why is no real title available?)
- On process rate semantics
- Verifying pCTL model checking
- Theoretical Aspects of Computing - ICTAC 2004
- PRISM
- Assisting the design of a groupware system - Model checking usability aspects of thinkteam
- Probabilistic model checking of the PDGF signaling pathway
- Symbolic dependency graphs for \(\mathrm {PCTL}^{>}_{\leq}\) model-checking
- Computing branching distances with quantitative games
- Symbolic model checking for probabilistic processes
- scientific article; zbMATH DE number 7445154 (Why is no real title available?)
- Explicit model checking of very large MDP using partitioning and secondary storage
- scientific article; zbMATH DE number 1884410 (Why is no real title available?)
- scientific article; zbMATH DE number 2087806 (Why is no real title available?)
- Enhancing probabilistic model checking with ontologies
- Symbolic model checking for factored probabilistic models
- Probabilistic model checking on HPC systems for the performance analysis of mobile networks
- SMT-based bisimulation minimisation of Markov models
- \textsf{PrIC3}: property directed reachability for MDPs
- Performance analysis of probabilistic timed automata using digital clocks
- Synthesizing efficient systems in probabilistic environments
- Model-checking large structured Markov chains.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4472227)
