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
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
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)
Parametric probabilistic transition systems for system design and analysis
Formal Aspects of Computing
The metabolic algorithm for P systems: Principles and applications
Theoretical Computer Science
A Model Checking Approach to the Parameter Estimation of Biochemical Pathways
CMSB '08 Proceedings of the 6th International Conference on Computational Methods in Systems Biology
Approximate Parameter Synthesis for Probabilistic Time-Bounded Reachability
RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
Approximating Probabilistic Behaviors of Biological Systems Using Abstract Interpretation
Electronic Notes in Theoretical Computer Science (ENTCS)
Model checking genetic regulatory networks with parameter uncertainty
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Three-valued abstraction for continuous-time Markov chains
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Formal cell biology in biocham
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
Model revision from temporal logic properties in computational systems biology
Probabilistic inductive logic programming
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
Probabilistic model checking of biological systems with uncertain kinetic rates
Theoretical Computer Science
Maximally Parallel Probabilistic Semantics for Multiset Rewriting
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
An analysis for proving probabilistic termination of biological systems
Theoretical Computer Science
Polynomial-Time verification of PCTL properties of MDPs with convex uncertainties
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
| Hi-index | 0.00 |
We present an abstraction of the probabilistic semantics of Multiset Rewriting to formally express systems of reactions with uncertain kinetic rates. This allows biological systems modelling when the exact rates are not known, but are supposed to lie in some intervals. On these (abstract) models we perform probabilistic model checking obtaining lower and upper bounds for the probabilities of reaching states satisfying given properties. These bounds are under- and over-approximations, respectively, of the probabilities one would obtain by verifying the models with exact kinetic rates belonging to the intervals.