Quantitative analysis with the probabilistic model checker PRISM
From MaRDI portal
Cites work
- A logic for reasoning about time and reliability
- Automatic analysis of a non-repudiation protocol
- Formal Modeling and Analysis of Timed Systems
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- scientific article; zbMATH DE number 1361121 (Why is no real title available?)
- scientific article; zbMATH DE number 729460 (Why is no real title available?)
- scientific article; zbMATH DE number 1973984 (Why is no real title available?)
- scientific article; zbMATH DE number 1538048 (Why is no real title available?)
- scientific article; zbMATH DE number 1796134 (Why is no real title available?)
- scientific article; zbMATH DE number 2090709 (Why is no real title available?)
- scientific article; zbMATH DE number 7280017 (Why is no real title available?)
- Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems
- Memory space requirements for self-stabilizing leader election protocols
- Model checking of probabilistic and nondeterministic systems
- Probabilistic model checking of deadline properties in the IEEE 1394 fireWire root contention protocol
- Probabilistic model checking of the CSMA/CD protocol using PRISM and APMC
- Probabilistic self-stabilization
- Simplifying Itai-Rodeh leader election for anonymous rings
- Termination of Probabilistic Concurrent Program
- Using probabilistic model checking for dynamic power management
Cited in
(3)
This page was built for publication: Quantitative analysis with the probabilistic model checker PRISM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7014296)