Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computing Abstractions of Infinite State Systems Compositionally and Automatically
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Simplification of non-deterministic multi-valued networks
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Computational Modeling of Genetic and Biochemical Networks (Computational Molecular Biology)
Computational Modeling of Genetic and Biochemical Networks (Computational Molecular Biology)
Petri net modelling of biological regulatory networks
Journal of Discrete Algorithms
A Reduction of Logical Regulatory Graphs Preserving Essential Dynamical Properties
CMSB '09 Proceedings of the 7th International Conference on Computational Methods in Systems Biology
Hi-index | 5.23 |
Multi-valued networks are an important qualitative modelling approach used widely by the biological community. In this paper we consider developing an abstraction theory for multi-valued networks that allows the state space of a model to be reduced while preserving key properties of the model. This is important as it aids the analysis and comparison of multi-valued networks and in particular, helps address the well-known problem of state space explosion associated with such analysis. We consider developing techniques for efficiently identifying abstractions and so provide a basis for the automation of the abstraction task. We illustrate the theoretical results and techniques developed by considering two detailed case studies based on existing biological models in the literature: (1) the regulation of tryptophan biosynthesis in Escherichia coli; and (2) the lysis-lysogeny switch in the bacteriophage@l.