Model checking
Symbolic Model Checking of Biochemical Networks
CMSB '03 Proceedings of the First International Workshop on Computational Methods in Systems Biology
Checking Finite Traces Using Alternating Automata
Formal Methods in System Design
PRISM 2.0: A Tool for Probabilistic Model Checking
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Graphical rule-based representation of signal-transduction networks
Proceedings of the 2005 ACM symposium on Applied computing
Rule-based modeling of biochemical networks: Research Articles
Complexity - Understanding Complex Systems: Part II
Verification and planning for stochastic processes with asynchronous events
Verification and planning for stochastic processes with asynchronous events
Simulation and verification for computational modelling of signalling pathways
Proceedings of the 38th conference on Winter simulation
Carbon-fate maps for metabolic reactions
Bioinformatics
Scalable simulation of cellular signaling networks
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Machine learning biochemical networks from temporal logic properties
Transactions on Computational Systems Biology VI
Graph theory for rule-based modeling of biochemical networks
Transactions on Computational Systems Biology VII
Predicting protein folding kinetics via temporal logic model checking
WABI'07 Proceedings of the 7th international conference on Algorithms in Bioinformatics
Rule-based modelling of cellular signalling
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
CMSB '09 Proceedings of the 7th International Conference on Computational Methods in Systems Biology
A Bayesian Approach to Model Checking Biological Systems
CMSB '09 Proceedings of the 7th International Conference on Computational Methods in Systems Biology
Probabilistic Approximations of Signaling Pathway Dynamics
CMSB '09 Proceedings of the 7th International Conference on Computational Methods in Systems Biology
Statistical model checking: an overview
RV'10 Proceedings of the First international conference on Runtime verification
Verification of an AFDX infrastructure using simulations and probabilities
RV'10 Proceedings of the First international conference on Runtime verification
Proving stabilization of biological systems
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Probabilistic approximations of ODEs based bio-pathway dynamics
Theoretical Computer Science
Statistical abstraction and model-checking of large heterogeneous systems
FMOODS'10/FORTE'10 Proceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Checking and distributing statistical model checking
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
Synthesis of insulin pump controllers from safety specifications using Bayesian model validation
International Journal of Bioinformatics Research and Applications
SBMF'12 Proceedings of the 15th Brazilian conference on Formal Methods: foundations and applications
Performance evaluation of sensor networks by statistical modeling and euclidean model checking
ACM Transactions on Sensor Networks (TOSN)
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Hi-index | 0.00 |
We present an algorithm, called BioLab, for verifying temporal properties of rule-based models of cellular signalling networks.BioLabmodels are encoded in the BioNetGenlanguage, and properties are expressed as formulae in probabilistic bounded linear temporal logic. Temporal logic is a formalism for representing and reasoning about propositions qualified in terms of time. Properties are then verified using sequential hypothesis testing on executions generated using stochastic simulation. BioLabis optimal, in the sense that it generates the minimum number of executions necessary to verify the given property. BioLabalso provides guarantees on the probability of it generating Type-I (i.e., false-positive) and Type-II (i.e., false-negative) errors. Moreover, these error bounds are pre-specified by the user. We demonstrate BioLabby verifying stochastic effects and bistability in the dynamics of the T-cell receptor signaling network.