Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Concurrent constraint programming: towards probabilistic abstract interpretation
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Membrane Computing: An Introduction
Membrane Computing: An Introduction
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
Computing Abstractions of Infinite State Systems Compositionally and Automatically
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
PRISM: Probabilistic Symbolic Model Checker
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
Model checking for probability and time: from theory to practice
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
A Meta-Notation for Protocol Analysis
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
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)
Game-based Abstraction for Markov Decision Processes
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
GRIP: Generic Representatives in PRISM
QEST '07 Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems
Probabilistic Model Checking Modulo Theories
QEST '07 Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems
Theoretical Computer Science
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
Model Checking of Infinite State Space Markov Chains by Stochastic Bounds
ASMTA '08 Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Game-Based Probabilistic Predicate Abstraction in PRISM
Electronic Notes in Theoretical Computer Science (ENTCS)
Approximating Probabilistic Behaviors of Biological Systems Using Abstract Interpretation
Electronic Notes in Theoretical Computer Science (ENTCS)
Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Discrete time Markov chains with interval probabilities
International Journal of Approximate Reasoning
Time-Bounded Model Checking of Infinite-State Continuous-Time Markov Chains
Fundamenta Informaticae - Application of Concurrency to System Design
Using Stochastic Comparison for Efficient Model Checking of Uncertain Markov Chains
QEST '09 Proceedings of the 2009 Sixth International Conference on the Quantitative Evaluation of Systems
Three-valued abstraction for continuous-time Markov chains
CAV'07 Proceedings of the 19th international conference on Computer aided verification
The calculus of looping sequences
SFM'08 Proceedings of the Formal methods for the design of computer, communication, and software systems 8th international conference on Formal methods for computational systems biology
Abstract interpretation of cellular signalling networks
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Abstracting the Differential Semantics of Rule-Based Models: Exact and Automated Model Reduction
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
PASS: abstraction refinement for infinite probabilistic models
TACAS'10 Proceedings of the 16th 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
Exploring parameter space of stochastic biochemical systems using quantitative model checking
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
| Hi-index | 5.23 |
In this paper, we present a formalization of biological systems based on multiset rewriting and we investigate the use of abstract interpretation on its semantics. We consider a probabilistic semantics, which is well suited to represent the non-deterministic evolution of real biological systems. Abstract interpretation allows us to deal with systems in which the kinetic rates of the evolution rules are not precisely known. On the (abstract) systems, we perform probabilistic model checking obtaining lower and upper bounds for the probabilities of reaching states satisfying the given properties. We apply abstract probabilistic model checking to verify reachability properties in a model of tumor growth.