Abstract
This paper examines the feasibility of predicate abstraction as a method for the reachability analysis of hybrid systems. A hybrid system can be abstracted into a purely discrete system by mapping the continuous state space into an equivalent finite discrete state space using a set of Boolean predicates and a decision procedure in the theory of real closed fields. It is then possible to find the feasible transitions between these states. In this paper, we propose new conditions for predicate abstraction which greatly reduce the number of transitions in the abstract discrete system. We also develop a computational technique for reachability analysis and apply it to a biological system of interest (the Delta-Notch lateral inhibition problem).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Alur, T. Dang, and F. Ivančić. Reachability analysis of hybrid sytems via predicate abstraction. In C. Tomlin and M. Greenstreet, eds., 5th International Workshop, Hybrid Systems: Computation and Control, volume LNCS 2289, pages 35–48, Stanford, CA, USA, 2002. Springer. 715
Spyros Artavanis-Tsakonas, Matthew D. Rand, and Robert J. Lake. Notch signaling: cell fate control and signal integration in development. Science, 284:770–776, April 1999. 716
S. Das, D. Dill, and S. Park. Experience with predicate abstraction. In Computer Aided Verification, 11th international Conference, volume LNCS 1633, 1999. 715
Manolis Fanto and Marek Mlodzik. Asymmetric notch activation specifies photoreceptors R3 and R4 and planar polarity in the Drosophila eye. Nature, 397:523–526, February 1999. 716
R. Ghosh and C. Tomlin. Lateral inhibition through delta-notch signaling: A piecewise affine hybrid model. In 4th International Workshop, Hybrid Systems: Computation and Control, volume LNCS 2034, pages 232–246, Rome, Italy, 2001. 715, 718, 721, 722, 723
S. Graf and H. Saidi. Construction of abstract state graphs with pvs. In Computer Aided Verification, 9th International Conference, volume LNCS 1254, 1997. 715
H. Hong. An improvement of the projection operator in cylindrical algebraic decomposition. In Proceedings of ISAAC 90, pages 261–264, 1990. 719
G. Lafferriere, G.J. Pappas, and S. Yovine. Symbolic reachability computation for families of linear vector fields. Journal of Symbolic Computation, 32(3):231–253, September 2001. 715
Julian Lewis. Notch signalling and the control of cell fate choices in vertebrates. Seminars in Cell & Developmental Biology, 9:583–589, 1998. 716
G. Marnellos, G. A. Deblandre, E. Mjolsness, and C. Kintner. Delta-notch lateral inhibitory patterning in the emergence of ciliated cells in Xenopus: experimental observations and a gene network model. In Pacific Symposium on Biocomputing, pages 5:326–337, 2000. 716
O. Sokolsky and H. Hong. Qualitative modeling of hybrid systems. In Proceedings of the Monterey Workshop, June 2001. 715
A. Tiwari and G. Khanna. Series of abstractions for hybrid automata. In C. Tomlin and M. Greenstreet, eds., 5th International Workshop, Hybrid Systems: Computation and Control, volume LNCS 2289, pages 465–478, Stanford, CA, USA, 2002. 715, 718, 720
A. Tiwari and P. Lincoln. Automated techniques for stability analysis of delta notch lateral inhibition mechanism. 2002. 715
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hwang, I., Balakrishnan, H., Ghosh, R., Tomlin, C. (2002). Reachability Analysis of Delta-Notch Lateral Inhibition Using Predicate Abstraction. In: Sahni, S., Prasanna, V.K., Shukla, U. (eds) High Performance Computing — HiPC 2002. HiPC 2002. Lecture Notes in Computer Science, vol 2552. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36265-7_69
Download citation
DOI: https://doi.org/10.1007/3-540-36265-7_69
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00303-8
Online ISBN: 978-3-540-36265-4
eBook Packages: Springer Book Archive