Adapting Biochemical Kripke Structures for Distributed Model Checking
- 407 Downloads
In this paper, we use some observations on the nature of biochemical reactions to derive interesting properties of qualitative biochemical Kripke structures. We show that these characteristics make Kripke structures of biochemical pathways suitable for assumption based distributed model checking. The number of chemical species participating in a biochemical reaction is usually bounded by a small constant. This observation is used to show that the Hamming distance between adjacent states of a qualitative biochemical Kripke structures is bounded. We call such structures as Bounded Hamming Distance Kripke structures (BHDKS). We, then, argue the suitability of assumption based distributed model checking for BHDKS by constructively deriving worst case upper bounds on the size of the fragments of the state space that need to be stored at each distributed node. We also show that the distributed state space can be mapped naturally to a hypercube based distributed architecture. We support our results by experimental evaluation over benchmarks and biochemical pathways from public databases.
KeywordsState Space Model Check Biochemical Pathway Cell Division Cycle Circadian Oscillation
Unable to display preview. Download preview PDF.
- 1.Brim, L., Yorav, K., Žídková, J.: Assumption-based distribution of CTL model checking. International Journal on Software Tools for Technology Transfer (STTT) 7(1), 61–73 (2005)Google Scholar
- 2.Brim, L., Žídková, J., Yorav, K.: Using assumptions to distribute CTL model checking. Electr. Notes Theor. Comput. Sci. 68(4) (2002)Google Scholar
- 3.Burch, J.R., Clark, E.M., McMillan, K.L., Dill, D.L., Hwang, L.J.: Symbolic model checking: 1020 states and beyond. In: Mitchell, J.C. (ed.) Proceedings of the 5th Annual IEEE Symposium on Logic in Computer Science, Philadelphia, PA, pp. 428–439. IEEE Computer Society Press, Los Alamitos (1990)CrossRefGoogle Scholar
- 7.Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (1999)Google Scholar
- 10.Karypis, G., Selvakkumaran, N.: Multi-objective hypergraph partitioning algorithms for cut and maximum subdomain degree minimization. In: ICCAD 2003: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design, Washington, DC, USA, August 18, 2003, p. 726. IEEE Computer Society Press, Los Alamitos (2003)Google Scholar