A probabilistic powerdomain of evaluations
Proceedings of the Fourth Annual Symposium on Logic in computer science
A compositional approach to performance modelling
A compositional approach to performance modelling
Automated compositional Markov chain generation for a plain-old telephone system
Science of Computer Programming
An Efficient Algorithm for Aggregating PEPA Models
IEEE Transactions on Software Engineering
Process algebra for performance evaluation
Theoretical Computer Science
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Compositional Performance Analysis
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Compositional Methods for Probabilistic Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
On Combining Functional Verification and Performance Evaluation Using CADP
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Exploiting Symmetries in Stochastic Process Algebras
Proceedings of the 12th European Simulation Multiconference on Simulation - Past, Present and Future
sPBC: A Markovian Extension of Finite Petri Box Calculus
PNPM '01 Proceedings of the 9th international Workshop on Petri Nets and Performance Models (PNPM'01)
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Compositional Performability Evaluation for STATEMATE
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Game-based Abstraction for Markov Decision Processes
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Uniformity by Construction in the Analysis of Nondeterministic Stochastic Systems
DSN '07 Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Theoretical Computer Science
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Least Upper Bounds for Probability Measures and Their Applications to Abstractions
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Compositional Abstraction in Real-Time Model Checking
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
3-Valued abstraction: More precision at less cost
Information and Computation
Game-Based Probabilistic Predicate Abstraction in PRISM
Electronic Notes in Theoretical Computer Science (ENTCS)
Abstraction Refinement for Probabilistic Software
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Three-valued abstraction for continuous-time Markov chains
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Magnifying-lens abstraction for Markov decision processes
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Don’t know in probabilistic systems
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Compositional verification and 3-valued abstractions join forces
SAS'07 Proceedings of the 14th international conference on Static Analysis
Concurrency and composition in a stochastic world
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Compositional abstraction of PEPA models for transient analysis
EPEW'10 Proceedings of the 7th European performance engineering conference on Computer performance engineering
Probabilistic contracts for component-based design
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
The how and why of interactive Markov chains
FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
Abstract probabilistic automata
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Decision problems for interval Markov chains
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
New results for Constraint Markov Chains
Performance Evaluation
Probabilistic contracts for component-based design
Formal Methods in System Design
Compositional abstraction techniques for probabilistic automata
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Compositional verification and optimization of interactive markov chains
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Abstract Probabilistic Automata
Information and Computation
| Hi-index | 0.00 |
We propose to exploit three-valued abstraction to stochastic systems in a compositional way. This combines the strengths of an aggressive state-based abstraction technique with compositional modeling. Applying this principle to interactive Markov chains yields abstract models that combine interval Markov chains and modal transition systems in a natural and orthogonal way. We prove the correctness of our technique for parallel and symmetric composition and show that it yields lower bounds for minimal and upper bounds for maximal timed reachability probabilities.