Generating counterexamples for quantitative safety specifications in probabilistic B
From MaRDI portal
Recommendations
Cites work
- A formal approach to probabilistic termination
- A logic for reasoning about time and reliability
- Abstraction, refinement and proof for probabilistic systems.
- An axiomatic basis for computer programming
- Borel determinacy
- Counterexamples in Probabilistic Model Checking
- Finding the k Shortest Paths
- Formal Modeling and Analysis of Timed Systems
- scientific article; zbMATH DE number 3870578 (Why is no real title available?)
- scientific article; zbMATH DE number 3776540 (Why is no real title available?)
- Modeling in Event B. System and software engineering.
- Optimal control of diffusion processes with reflection
- Probabilistic invariants for probabilistic machines
- SPECIFICATION AND VERIFICATION OF CONURRENT SYSTEMS IN CESAR
- Stochastic model checking
- The B-Book
This page was built for publication: Generating counterexamples for quantitative safety specifications in probabilistic B
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q652160)