Three-valued abstraction for probabilistic systems
DOI10.1016/J.JLAP.2012.03.007zbMATH Open1277.68219OpenAlexW1998422337WikidataQ57801178 ScholiaQ57801178MaRDI QIDQ444484FDOQ444484
Authors: Joost-Pieter Katoen, Daniel Klink, Martin Leucker, Verena Wolf
Publication date: 14 August 2012
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlap.2012.03.007
Recommendations
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
- A Characterization of Meaningful Schedulers for Continuous-Time Markov Decision Processes
- Delayed Nondeterminism in Continuous-Time Markov Decision Processes
- Sliding Window Abstraction for Infinite Markov Chains
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Verification, Model Checking, and Abstract Interpretation
- A logic for reasoning about time and reliability
- Deciding bisimilarity and similarity for probabilistic processes.
- 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
- The Randomization Technique as a Modeling Tool and Solution Procedure for Transient Markov Processes
- Symbolic model checking for probabilistic processes
- Interval-valued finite Markov chains
- Computer Aided Verification
- Title not available (Why is that?)
- On finite-state approximants for probabilistic computation tree logic
- Three-Valued Abstractions of Markov Chains: Completeness for a Sizeable Fragment of PCTL
- Validation of Stochastic Systems
- Model Checking Software
- Title not available (Why is that?)
- Finite discrete time Markov chains with interval probabilities
- Abstraction for Stochastic Systems by Erlang’s Method of Stages
- Partial Order Reduction for Markov Decision Processes: A Survey
- Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
- Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates
- Magnifying-Lens Abstraction for Markov Decision Processes
- Model-Checking ω-Regular Properties of Interval Markov Chains
- Model-checking continuous-time Markov chains
- Symmetry Reduction for Probabilistic Model Checking
- Tools and Algorithms for the Construction and Analysis of Systems
Cited In (16)
- Combining decomposition and reduction for state space analysis of a self-stabilizing system
- Three-Valued Abstraction for Continuous-Time Markov Chains
- Abstraction of Probabilistic Systems
- On Abstraction of Probabilistic Systems
- A counter abstraction technique for verifying properties of probabilistic swarm systems
- Compositional abstraction for stochastic systems
- Efficient computation of the bounds of continuous time imprecise Markov chains
- Analysis of spatio-temporal properties of stochastic systems using TSTL
- Title not available (Why is that?)
- 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
- Least Upper Bounds for Probability Measures and Their Applications to Abstractions
- Probabilistic model checking of biological systems with uncertain kinetic rates
- Abstract model repair for probabilistic systems
- Validation of Stochastic Systems
Uses Software
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)