Compositional abstraction for stochastic systems
From MaRDI portal
Recommendations
Cites work
- 3-valued abstraction: More precision at less cost
- A Compositional Approach to Performance Modelling
- Abstraction Refinement for Probabilistic Software
- Automated compositional Markov chain generation for a plain-old telephone system
- Compositional Abstraction in Real-Time Model Checking
- Compositional Verification and 3-Valued Abstractions Join Forces
- Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
- Game-Based Probabilistic Predicate Abstraction in PRISM
- scientific article; zbMATH DE number 4179422 (Why is no real title available?)
- scientific article; zbMATH DE number 1863173 (Why is no real title available?)
- scientific article; zbMATH DE number 2090149 (Why is no real title available?)
- scientific article; zbMATH DE number 794262 (Why is no real title available?)
- Interactive Markov chains. And the quest for quantified quality
- Least Upper Bounds for Probability Measures and Their Applications to Abstractions
- Magnifying-Lens Abstraction for Markov Decision Processes
- Model checking compositional Markov systems.
- Model Checking Software
- On process rate semantics
- Probabilistic CEGAR
- Process algebra for performance evaluation
- Three-Valued Abstraction for Continuous-Time Markov Chains
Cited in
(25)- Compositional abstraction-based synthesis of general MDPs via approximate probabilistic relations
- Abstraction-based synthesis for stochastic systems with omega-regular objectives
- Compositional verification and 3-valued abstractions join forces
- Least upper bounds for probability measures and their applications to abstractions
- Compositional synthesis of opacity-preserving finite abstractions for interconnected systems
- Distributed synthesis in continuous time
- Extending modal transition systems with structured labels
- Compositional abstraction techniques for probabilistic automata
- The how and why of interactive Markov chains
- Abstract probabilistic automata
- Three-Valued Abstractions of Markov Chains: Completeness for a Sizeable Fragment of PCTL
- Markov Set-Chains as Abstractions of Stochastic Hybrid Systems
- Least Upper Bounds for Probability Measures and Their Applications to Abstractions
- Abstraction for Stochastic Systems by Erlang’s Method of Stages
- Compositional Abstraction in Real-Time Model Checking
- On the compositionality of round abstraction
- Abstract probabilistic automata
- Consistency and refinement for interval Markov chains
- Three-valued abstraction for probabilistic systems
- Composition of stochastic transition systems based on spans and couplings
- scientific article; zbMATH DE number 1863173 (Why is no real title available?)
- Compositions of stochastic systems with final sequence states and interdependent transitions
- Approximating probabilistic behaviors of biological systems using abstract interpretation
- Three-Valued Abstraction for Continuous-Time Markov Chains
- Constraint Markov chains
This page was built for publication: Compositional abstraction for stochastic systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3648832)
