Hybrid Automata in Systems Biology: How Far Can We Go?

Electronic Notes in Theoretical Computer Science

Volumn 229, Issue 1, 2009, Pages 93-108

  Campagna, Dario ^a   Piazza, Carla ^a  

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

Hybrid Automata; Reachability; Semi Algebraic First Order Formul

Indexed keywords

APPROXIMATION THEORY; ROBOTS; TRANSLATION (LANGUAGES);

APPROXIMATION METHODS; FIRST ORDERS; HYBRID AUTOMATA; HYBRID AUTOMATONS; REACHABILITY; REACHABILITY PROBLEMS; REPRESSILATOR; SATISFIABILITY; SYSTEMS BIOLOGIES; TAYLOR POLYNOMIALS;

HYBRID SYSTEMS;

EID: 60449092066     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2009.02.007     Document Type: Article

References (38)

1. Alur R., Belta C., Ivancic F., Kumar V., Mintz M., Pappas G.J., Rubin H., and Schug J. Hybrid Modeling and Simulation of Biomolecular Networks. Proceedings of Hybrid Systems: Computation and Control. (HSCC'01). LNCS volume 2034 (2001), Springer-Verlag 19-32
2. Alur R., Courcoubetis C., Halbwachs N., Henzinger T.A., Ho P.-H., Nicollin X., Olivero A., Sifakis J., and Yovine S. The algorithmic analysis of hybrid systems. Theoretical Computer Science 138 1 (1995) 3-34
3. Alur R., Dang T., and Ivancic F. Progress on reachability analysis of hybrid systems using predicate abstraction. In: Maler O., and Pnueli A. (Eds). HSCC. LNCS volume 2623 (2003), Springer-Verlag 4-19
4. Alur R., and Dill D.L. A theory of timed automata. Theoretical Computer Science 126 2 (1994) 183-235
5. Alur R., Henzinger T.A., and Ho P.-H. Automatic Symbolic Verification of Embedded Systems. Proceedings of IEEE Real-Time Systems Symposium (1993), IEEE Computer Society Press 2-11
6. Antoniotti M., Policriti A., Ugel N., and Mishra B. Model Building and Model Checking for Biological Processes. Cell Biochemistry and Biophysics (2003)
7. Apt K.R., and Wallace M.G. Constraint Logic Programming using Eclipse (2006), Cambridge University Press
8. Asarin E., Dang T., and Maler O. The d/dt tool for verification of hybrid systems. Proceedings of the Forteenth International Conference on Computer Aided Verification. (CAV'02). LNCS (2002), Springer-Verlag, London, UK 365-370
9. Asarin E., Dang T., Maler O., and Bournez O. Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems. In: Krogh B., and Lynch N. (Eds). Proceedings of Hybrid Systems: Computation and Control. (HSCC'00). LNCS volume 1790 (2000), Springer-Verlag 20-31
10. Basu S. An improved algorithm for quantifier elimination over real closed fields. Proceedings of the Thirty-Eighth Annual Symposium on Foundations of Computer Science. (FOCS'97) (1997), IEEE Computer Society Press, Washington, DC, USA 56-65
11. Bengtsson J., Larsen K.G., Larsson F., Pettersson P., and Yi W. Uppaal - a tool suite for automatic verification of real-time systems. In: Alur R., Henzinger T.A., and Sontag E.D. (Eds). Hybrid Systems III: Verification and Control, Proceedings of the DIMACS/SYCON Workshop. LNCS volume 1066 (1996), Springer-Verlag 232-243
12. L. Bortolussi and A. Policriti. Hybrid approximation of Stochastic Concurrent Constraint Programming. In International Federation of Automatic Control World Congress, (IFAC'08), 2008. To appear
13. Brown C.W. QEPCAD B: A program for computing with semi-algebraic sets using CADs. ACM SIGSAM Bulletin 37 4 (2003) 97-108
14. Casagrande A., Piazza C., and Mishra B. Semi-Algebraic Constant Reset Hybrid Automata -SACoRe. Proc. of the 44rd Conference on Decision and Control. (CDC'05) (2005), IEEE Computer Society Press 678-683
15. Chutinan A., and Krogh B. Verification of Polyhedral-Invariant Hybrid Automata Using Polygonal Flow Pipe Approximations. In: Vaandrager F.W., and van Schuppen J.H. (Eds). Proceedings of Hybrid Systems: Computation and Control. (HSCC'99). LNCS volume 1569 (1999), Springer-Verlag 76-90
16. Collins G.E. Quantifier Elimination for the Elementary Theory of Real Closed Fields by Cylindrical Algebraic Decomposition. Proceedings of the Second GI Conference on Automata Theory and Formal Languages. LNCS volume 33 (1975), Springer-Verlag 134-183
17. Dang T., and Maler O. Reachability analysis via face lifting. In: Henzinger T.A., and Sastry S. (Eds). HSCC. LNCS volume 1386 (1998), Springer-Verlag 96-109
18. Daws C., Olivero A., Tripakis S., and Yovine S. The tool KRONOS. In: Alur R., Henzinger T.A., and Sontag E.D. (Eds). Hybrid Systems III: Verification and Control, Proceedings of the DIMACS/SYCON Workshop. LNCS volume 1066 (1996), Springer-Verlag 208-219
19. Dolzmann A., and Sturm T. REDLOG: Computer algebra meets computer logic. SIGSAM Bulletin (ACM Special Interest Group on Symbolic and Algebraic Manipulation) 31 2 (1997) 2-9
20. Elowitz M., and Leibler S. A Synthetic Oscillatory Network of Transcriptional Regulators. Nature 403 (2000) 335-338
21. Ghosh R., Tiwari A., and Tomlin C. Automated Symbolic Reachability Analysis; with Application to Delta-Notch Signaling Automata. In: Maler O., and Pnueli A. (Eds). Proceedings of Hybrid Systems: Computation and Control. (HSCC'03). LNCS volume 2623 (2003), Springer-Verlag 233-248
22. Grigorév D., and Vorobjov N. Counting connected components of a semialgebraic set in subexponential time. Computational Complexity 2 2 (1992) 133-186
23. Halbwachs N., Proy Y.-E., and Raymond P. Verification of linear hybrid systems by means of convex approximations. In: Le Charlier B. (Ed). Static Analysis Symposium (1994), Springer-Verlag 223-237
24. Henzinger T.A., Ho P.H., and Wong-Toi H. HYTECH: A Model Checker for Hybrid Systems. International Journal on Software Tools for Technology Transfer 1 1-2 (1997) 110-122
25. Henzinger T.A., Kopke P.W., Puri A., and Varaiya P. What's decidable about hybrid automata?. Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing. (STOC'95) (29 May-1 June 1995), ACM Press, New York, NY, USA 373-382
26. Kurzhanski A.B., and Varaiya P. On verification of controlled hybrid dynamics through ellipsoidal techniques. Proceedings of the 44rd Conference on Decision and Control and European Control Conference. (CDC-ECC'05) (December 2005), IEEE Computer Society Press, Seville, Spain 4682-4687
27. Lafferriere G., Pappas G.J., and Sastry S. O-Minimal Hybrid Systems. Mathematics of Control, Signals, and Systems 13 (2000) 1-21
28. Lanotte R., and Tini S. Taylor approximation for hybrid systems. Inf. Comput. 205 11 (2007) 1575-1607
29. Mysore V., and Mishra B. Algorithmic Algebraic Model Checking III: Approximate Methods. Electronic Notes in Theoretical Computer Science 149 1 (2006) 61-77
30. Mysore V., Piazza C., and Mishra B. Algorithmic Algebraic Model Checking I: Decidability of Semi-Algebraic Model Checking and its Applications to Systems Biology. In: Tsay Y., and Peled D.A. (Eds). Proceedings Third International Symposium on Automated Technology for Verification and Analysis. (ATVA 2005). LNCS number 3707 (October 2005), Springer-Verlag 217-233
31. Piazza C., Antoniotti M., Mysore V., Policriti A., Winkler F., and Mishra B. Algorithmic Algebraic Model Checking I: Challenges from Systems Biology. In: Etessami K., and Rajamani S.K. (Eds). Proceedings Computer Aided Verification. (CAV'05). LNCS number 3576 (2005), Springer-Verlag 5-19
32. Puri A., and Varaiya P. Decidability of hybrid systems with rectangular differential inclusions. In: Dill D.L. (Ed). Proceedings of International Conference on Computer Aided Verification. (CAV'94). LNCS volume 818 (1994), Springer-Verlag 95-104
33. Ratschan S. Efficient Solving of Quantified Inequality Constraints over the Real Numbers. ACM Transactions on Computational Logic 7 4 (2006) 723-748
34. Renegar J. On the computational complexity and geometry of the first-order theory of the reals. Part III: Quantifier elimination, Journal of Symbolic Computation 13 3 (1992) 329-352
35. Silva B.I., and Krogh B.H. Formal verification of hybrid system using checkmate: A case study. Proceedings of the American Control Conference 2000. (ACC'00) (June 2000), IEEE Computer Society Press, Chicago, Illinois 678-683
36. T. Sturm. Quantifier Elimination-Based Constraint Logic Programming. Technical Report MIP-0202, Fakultät für Mathematik und Informatik, Universität Passau, 2002
37. Tarski A. A Decision Method for Elementary Algebra and Geometry (1951), Univ. California Press
38. Voit E.O. Computational Analysis of Biochemical Systems. A Pratical Guide for Biochemists and Molecular Biologists (2000), Cambridge University Press