On Abstraction of Probabilistic Systems
From MaRDI portal
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Recommendations
- Abstraction of Probabilistic Systems
- On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
- Abstraction, Refinement and Proof for Probabilistic Systems
- Validation of Stochastic Systems
- Abstraction Refinement for Probabilistic Software
- scientific article; zbMATH DE number 1701760
- Sur une théorie d'une classe de systèmes probabilistes
- Three-valued abstraction for probabilistic systems
Cites work
- A counterexample-guided abstraction-refinement framework for Markov decision processes
- A game-based abstraction-refinement framework for Markov decision processes
- A logic for reasoning about time and reliability
- Abstract probabilistic automata
- Approximating labelled Markov processes
- Assume-guarantee verification for probabilistic systems
- Best probabilistic transformers
- Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
- Comparative branching-time semantics for Markov chains
- Counterexamples in Probabilistic Model Checking
- Hierarchical counterexamples for discrete-time Markov chains
- scientific article; zbMATH DE number 1670775 (Why is no real title available?)
- scientific article; zbMATH DE number 1693039 (Why is no real title available?)
- scientific article; zbMATH DE number 1884411 (Why is no real title available?)
- scientific article; zbMATH DE number 2090703 (Why is no real title available?)
- scientific article; zbMATH DE number 794262 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- Lazy Abstraction with Interpolants
- Magnifying-Lens Abstraction for Markov Decision Processes
- Minimal Critical Subsystems for Discrete-Time Markov Models
- Model checking of probabilistic and nondeterministic systems
- Model Checking Software
- PRISM-games: a model checker for stochastic multi-player games
- Probabilistic CEGAR
- Sigref – A Symbolic Bisimulation Tool Box
- Sliding Window Abstraction for Infinite Markov Chains
- SMT-based bisimulation minimisation of Markov models
- Symmetry Reduction for Probabilistic Model Checking
- Symmetry Reduction for Probabilistic Model Checking Using Generic Representatives
- The complexity of stochastic games
- The quest for minimal quotients for probabilistic automata
- Three-valued abstraction for probabilistic systems
- Using branching time temporal logic to synthesize synchronization skeletons
- Variable probabilistic abstraction refinement
Cited in
(20)- Abstract model repair for probabilistic systems
- Automated verification and synthesis of stochastic hybrid systems: a survey
- A counter abstraction technique for verifying properties of probabilistic swarm systems
- scientific article; zbMATH DE number 1617330 (Why is no real title available?)
- Euclidean model checking: a scalable method for verifying quantitative properties in probabilistic systems
- Compositional abstraction techniques for probabilistic automata
- Abstraction of Probabilistic Systems
- Least Upper Bounds for Probability Measures and Their Applications to Abstractions
- Abstraction for Stochastic Systems by Erlang’s Method of Stages
- Compositional abstraction for stochastic systems
- Best probabilistic transformers
- Three-valued abstraction for probabilistic systems
- Variable probabilistic abstraction refinement
- Abstraction, Refinement and Proof for Probabilistic Systems
- scientific article; zbMATH DE number 2090706 (Why is no real title available?)
- An expectation transformer approach to predicate abstraction and data independence for probabilistic programs
- Probabilistic abstraction for model checking: an approach based on property testing
- Validation of Stochastic Systems
- Model Checking Software
- Towards abstraction-based probabilistic program analysis
This page was built for publication: On Abstraction of Probabilistic Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2937733)
