Compositional Abstraction for Stochastic Systems
From MaRDI portal
Publication:3648832
DOI10.1007/978-3-642-04368-0_16zbMath1262.68142OpenAlexW2148384577MaRDI QIDQ3648832
Martin R. Neuhäußer, Daniel Klink, Joost-Pieter Katoen
Publication date: 1 December 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-008205%22
Related Items
Extending modal transition systems with structured labels ⋮ Abstract probabilistic automata ⋮ Consistency and refinement for interval Markov chains ⋮ Constraint Markov chains ⋮ The How and Why of Interactive Markov Chains ⋮ Abstract Probabilistic Automata ⋮ Distributed Synthesis in Continuous Time
Uses Software
Cites Work
- Interactive Markov chains. And the quest for quantified quality
- 3-valued abstraction: More precision at less cost
- Automated compositional Markov chain generation for a plain-old telephone system
- On process rate semantics
- Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
- Probabilistic CEGAR
- Least Upper Bounds for Probability Measures and Their Applications to Abstractions
- Compositional Abstraction in Real-Time Model Checking
- Abstraction Refinement for Probabilistic Software
- Compositional Verification and 3-Valued Abstractions Join Forces
- Game-Based Probabilistic Predicate Abstraction in PRISM
- Three-Valued Abstraction for Continuous-Time Markov Chains
- Magnifying-Lens Abstraction for Markov Decision Processes
- A Compositional Approach to Performance Modelling
- Model Checking Software
- Process algebra for performance evaluation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
