Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
From MaRDI portal
Recommendations
- Distributed probabilistic input/output automata: expressiveness, (un)decidability and algorithms
- Undecidability results for distributed probabilistic systems
- Quantitative Analysis of Randomized Distributed Systems and Probabilistic Automata
- Verification, Model Checking, and Abstract Interpretation
- Distribution, approximation and probabilistic model checking
Cited in
(14)- Model checking quantitative hyperproperties
- scientific article; zbMATH DE number 7333237 (Why is no real title available?)
- Information hiding in probabilistic concurrent systems
- Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers
- On Decision Problems for Probabilistic Büchi Automata
- Distributed probabilistic input/output automata: expressiveness, (un)decidability and algorithms
- Undecidability results for distributed probabilistic systems
- On the expressive power of schedulers in distributed probabilistic systems
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Gradient-descent for randomized controllers under partial observability
- Model checking linear-time properties of probabilistic systems
- Probabilistic bisimulation for realistic schedulers
- Probabilistic bisimulation for realistic schedulers
- Quantitative model checking of linear-time properties based on generalized possibility measures
This page was built for publication: Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3510843)