Transient analysis of acyclic markov chains
Performance Evaluation
Solving ordinary differential equations I (2nd revised. ed.): nonstiff problems
Solving ordinary differential equations I (2nd revised. ed.): nonstiff problems
Reachability Analysis of Probabilistic Systems by Successive Refinements
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Reasoning about Probabilistic Lossy Channel Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Model Checking Probabilistic Pushdown Automata
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Verifying Infinite Markov Chains with a Finite Attractor or the Global Coarseness Property
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Game-based Abstraction for Markov Decision Processes
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Methods for Quantitative Analysis of Probabilistic Pushdown Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Verification of probabilistic systems with faulty communication
Information and Computation
Quantitative analysis of probabilistic lossy channel systems
Information and Computation
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
A numerical aggregation algorithm for the enzyme-catalyzed substrate conversion
CMSB'06 Proceedings of the 2006 international conference on Computational Methods in Systems Biology
Algorithmic verification of recursive probabilistic state machines
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Verifying probabilistic procedural programs
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Approximation of Event Probabilities in Noisy Cellular Processes
CMSB '09 Proceedings of the 7th International Conference on Computational Methods in Systems Biology
Formalisms for Specifying Markovian Population Models
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Hybrid numerical solution of the chemical master equation
Proceedings of the 8th International Conference on Computational Methods in Systems Biology
A comparative study of stochastic analysis techniques
Proceedings of the 8th International Conference on Computational Methods in Systems Biology
Model checking Markov chains using Krylov subspace methods: an experience report
EPEW'10 Proceedings of the 7th European performance engineering conference on Computer performance engineering
Parameter identification for Markov models of biochemical reactions
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
A hybrid factored frontier algorithm for dynamic Bayesian network models of biopathways
Proceedings of the 9th International Conference on Computational Methods in Systems Biology
A linear process-algebraic format with data for probabilistic automata
Theoretical Computer Science
Lumpability abstractions of rule-based systems
Theoretical Computer Science
A Hybrid Factored Frontier Algorithm for Dynamic Bayesian Networks with a Biopathways Application
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Exploring parameter space of stochastic biochemical systems using quantitative model checking
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Characterizing oscillatory and noisy periodic behavior in markov population models
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Quantitative reactive modeling and verification
Computer Science - Research and Development
Hi-index | 0.00 |
We present an on-the-fly abstraction technique for infinite-state continuous -time Markov chains. We consider Markov chains that are specified by a finite set of transition classes. Such models naturally represent biochemical reactions and therefore play an important role in the stochastic modeling of biological systems. We approximate the transient probability distributions at various time instances by solving a sequence of dynamically constructed abstract models, each depending on the previous one. Each abstract model is a finite Markov chain that represents the behavior of the original, infinite chain during a specific time interval. Our approach provides complete information about probability distributions, not just about individual parameters like the mean. The error of each abstraction can be computed, and the precision of the abstraction refined when desired. We implemented the algorithm and demonstrate its usefulness and efficiency on several case studies from systems biology.