The PEPA workbench: a tool to support a process algebra-based approach to performance modelling
Proceedings of the 7th international conference on Computer performance evaluation : modelling techniques and tools: modelling techniques and tools
Model-checking continuous-time Markov chains
ACM Transactions on Computational Logic (TOCL)
Stochastic Petri Nets: An Introduction to the Theory
ACM SIGMETRICS Performance Evaluation Review - Special issue on Stochastic Petri Nets
Model-Checking Algorithms for Continuous-Time Markov Chains
IEEE Transactions on Software Engineering
QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
Abstract interpretation of programs as Markov decision processes
Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
On finite-state approximants for probabilistic computation tree logic
Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 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
Model Checking of Continuous-Time Markov Chains by Closed-Form Bounding Distributions
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Backward Bisimulation in Markov Chain Model Checking
IEEE Transactions on Software Engineering
Comparative branching-time semantics for Markov chains
Information and Computation
Bisimulation minimisation mostly speeds up probabilistic model checking
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Flow faster: efficient decision algorithms for probabilistic simulations
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Partial order reduction for markov decision processes: a survey
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Symmetry reduction for probabilistic model checking
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Model checking infinite-state markov chains
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Model-Checking markov chains in the presence of uncertainties
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Don’t know in probabilistic systems
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Formal analysis techniques for gossiping protocols
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Probabilistic model checking of complex biological pathways
Theoretical Computer Science
Least Upper Bounds for Probability Measures and Their Applications to Abstractions
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Abstraction for Stochastic Systems by Erlang's Method of Stages
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Sliding Window Abstraction for Infinite Markov Chains
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
INFAMY: An Infinite-State Markov Model Checker
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Compositional Abstraction for Stochastic Systems
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Time-Bounded Model Checking of Infinite-State Continuous-Time Markov Chains
Fundamenta Informaticae - Application of Concurrency to System Design
A counterexample-guided abstraction-refinement framework for markov decision processes
ACM Transactions on Computational Logic (TOCL)
Compositional abstraction of PEPA models for transient analysis
EPEW'10 Proceedings of the 7th European performance engineering conference on Computer performance engineering
Modal abstractions of concurrent behavior
ACM Transactions on Computational Logic (TOCL)
Time-bounded reachability in tree-structured QBDs by abstraction
Performance Evaluation
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
Model checking algorithms for CTMDPs
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
A linear process-algebraic format with data for probabilistic automata
Theoretical Computer Science
Probabilistic model checking of biological systems with uncertain kinetic rates
Theoretical Computer Science
New results for Constraint Markov Chains
Performance Evaluation
Time-Bounded Model Checking of Infinite-State Continuous-Time Markov Chains
Fundamenta Informaticae - Application of Concurrency to System Design
Mechanized extraction of topology anti-patterns in wireless networks
IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods
Bisimulation and logical preservation for continuous-time markov decision processes
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
An analysis for proving probabilistic termination of biological systems
Theoretical Computer Science
Compositional verification and optimization of interactive markov chains
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Refinement and difference for probabilistic automata
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Abstract Probabilistic Automata
Information and Computation
Least upper bounds for probability measures and their applications to abstractions
Information and Computation
| Hi-index | 0.00 |
This paper proposes a novel abstraction technique for continuous-time Markov chains (CTMCs). Our technique fits within the realm of three-valued abstraction methods that have been used successfully for traditional model checking. The key idea is to apply abstraction on uniform CTMCs that are readily obtained from general CTMCs, and to abstract transition probabilities by intervals. It is shown that this provides a conservative abstraction for both true and false for a three-valued semantics of the branching-time logic CSL (Continuous Stochastic Logic). Experiments on an infinite-state CTMC indicate the feasibility of our abstraction technique.