Three-valued abstraction for probabilistic systems
From MaRDI portal
(Redirected from Publication:444484)
Recommendations
Cites work
- scientific article; zbMATH DE number 1693039 (Why is no real title available?)
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 1093829 (Why is no real title available?)
- scientific article; zbMATH DE number 1843158 (Why is no real title available?)
- scientific article; zbMATH DE number 1884411 (Why is no real title available?)
- scientific article; zbMATH DE number 1416652 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- A Characterization of Meaningful Schedulers for Continuous-Time Markov Decision Processes
- A logic for reasoning about time and reliability
- Abstraction for Stochastic Systems by Erlang’s Method of Stages
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
- Comparative branching-time semantics for Markov chains
- Computer Aided Verification
- Deciding bisimilarity and similarity for probabilistic processes.
- Delayed Nondeterminism in Continuous-Time Markov Decision Processes
- Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
- Finite discrete time Markov chains with interval probabilities
- Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
- Interval-valued finite Markov chains
- Magnifying-Lens Abstraction for Markov Decision Processes
- Model Checking Software
- Model-Checking ω-Regular Properties of Interval Markov Chains
- Model-checking continuous-time Markov chains
- On finite-state approximants for probabilistic computation tree logic
- Partial Order Reduction for Markov Decision Processes: A Survey
- Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates
- Sliding Window Abstraction for Infinite Markov Chains
- Symbolic model checking for probabilistic processes
- Symmetry Reduction for Probabilistic Model Checking
- The Randomization Technique as a Modeling Tool and Solution Procedure for Transient Markov Processes
- Three-Valued Abstractions of Markov Chains: Completeness for a Sizeable Fragment of PCTL
- Tools and Algorithms for the Construction and Analysis of Systems
- Validation of Stochastic Systems
- Verification, Model Checking, and Abstract Interpretation
Cited in
(16)- A counter abstraction technique for verifying properties of probabilistic swarm systems
- On Abstraction of Probabilistic Systems
- Combining decomposition and reduction for state space analysis of a self-stabilizing system
- Compositional abstraction for stochastic systems
- Three-Valued Abstraction for Continuous-Time Markov Chains
- scientific article; zbMATH DE number 6519594 (Why is no real title available?)
- Analysis of spatio-temporal properties of stochastic systems using TSTL
- Abstraction of Probabilistic Systems
- Validation of Stochastic Systems
- Probabilistic model checking of biological systems with uncertain kinetic rates
- Efficient computation of the bounds of continuous time imprecise Markov chains
- Least Upper Bounds for Probability Measures and Their Applications to Abstractions
- Model Checking Software
- Bounding inferences for large-scale continuous-time Markov chains: a new approach based on lumping and imprecise Markov chains
- Three-Valued Abstractions of Markov Chains: Completeness for a Sizeable Fragment of PCTL
- Abstract model repair for probabilistic systems
This page was built for publication: Three-valued abstraction for probabilistic systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q444484)
