Invisible formal methods for embedded control systems

Proceedings of the IEEE

Volumn 91, Issue 1, 2003, Pages 29-39

  Tiwari, Hashish ^b   Shankar, Natarajan ^a,b   Rushby, John ^a,b,c,d  

^a IEEE

^b SRI INTERNATIONAL   (United States)

^c Editorial Board for Formal Aspects of Computing ^*

^d AMERICAN MATHEMATICAL SOCIETY   (United States)

Author keywords

Abstraction; Hybrid dynamical systems; Inductive invariants

Indexed keywords

APPROXIMATION THEORY; CONTROL SYSTEMS; FORMAL LOGIC; SYSTEMS ANALYSIS; THEOREM PROVING;

ABSTRACTION; HYBRID DYNAMICAL SYSTEMS; INDUCTIVE INVARIANTS;

EMBEDDED SYSTEMS;

EID: 9144253837     PISSN: 00189219     EISSN: None     Source Type: Journal    
DOI: 10.1109/JPROC.2002.805818     Document Type: Article

References (38)

1. R. Alur, C. Courcoubetis, N. Halbwachs, T. A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine, "The algorithmic analysis of hybrid systems," Theoret. Comput. Sci., vol. 138, no. 3, pp. 3-34, 1995.
2. R. Alur and D. Dill, "A theory of timed automata," Theoret. Comput. Sci., vol. 126, pp. 183-235, 1994.
3. R. Alur, K. Etessami, and M. Yannakakis, "Analysis of recursive state machines," in Lecture Notes in Computer Science, Computer Aided Verification, G. Berry, H. Comon, and A. Finkel, Eds. Heidelberg, Germany: Springer-Verlag, 2001, vol. 2102, pp. 207-220.
4. R. Alur, T. Henzinger, and E. D. Sontag, Eds., Lecture Notes in Computer Science, Hybrid Systems III. Heidelberg, Germany: Springer-Verlag, 1996, vol. 1066.
5. R. Alur, T. Henzinger, G. Lafferriere, and G. J. Pappas, "Discrete abstractions of hybrid systems," Proc. IEEE, vol. 88, pp. 971-984, July 2000.
6. H. Anai and V. Weispfenning, "Reach set computations using real quantifier elimination," in Lecture Notes in Computer Science, Hybrid Systems: Computation and Control, M. D. Di Benedetto and A. Sangiovanni- Vincentelli, Eds. Heidelberg, Germany: SpringerVerlag, 2001, vol. 2034, pp. 63-76.
7. P. Antsaklis, W. Kohn, A. Nerode, and S. Sastry, Lecture Notes in Computer Science, Hybrid Systems II, P. Antsaklis, W. Kohn, A. Nerode, and S. Sastry, Eds. Heidelberg, Germany: Springer-Verlag, 1995, vol. 999.
8. _, Lecture Notes in Computer Science, Hybrid Systems IV, P. Antsaklis, W. Kohn, A. Nerode, and S. Sastry, Eds. Heidelberg, Germany: Springer-Verlag, 1997, vol. 1273.
9. G. Berry, H. Comon, and A. Finkel, Eds., Lecture Notes in Computer Science, Computer Aided Verification. Heidelberg, Germany: Springer-Verlag, 2001, vol. 2102.
10. A. Bouajjani, J. Esparza, and O. Maler, "Reachability analysis of pushdown automata: Application to model-checking," in Lecture Notes in Computer Science, CONCUR'97: Concurrency Theory, vol. 1243, A. W. Mazurkiewicz and J. Winkowski, Eds., 1997, pp. 135-150.
11. B. Buchberger, G. E. Collins, M. J. Encarnacion, H. Hong, J. R. Johnson, W. Krandick, R. Loos, A. M. Mandache, A. Neubacher, and H. Vielhaber, "SACLIB 1.1 User's Guide," Kurt Gödel Institute, Tech Rep. 93-19, ser. RISC-Linz Report Series, 1993.
12. A. Chutinam and B. H. Krogh, "Verification of polyhedral-invariant hybrid automata using polygonal flow pipe approximations," in Lecture Notes in Computer Science, Hybrid Systems: Computation and Control, F. W. Varager and J. H. van Schuppen, Eds. Heidelberg, Germany: Springer-Verlag, 1999, vol. 1569, pp. 76-90.
13. G. E. Collins, "Quantifier elimination for the elementary theory of real closed fields by cylindrical algebraic decomposition," in Lecture Notes in Computer Science, Proc. 2nd GI Conf. Automata Theory and Formal Lang., 1975, vol. 33, pp. 134-183.
14. R. L. Grossman, A. Nerode, A. P. Ravn, and H. Rischel, Lecture Notes in Computer Science, Hybrid Systems, R. L. Grossman, A. Nerode, A. P. Ravn, and H. Rischel, Eds. Heidelberg, Germany: Springer-Verlag, 1993, vol. 736.
15. D. Harel, "Statecharts: A visual formalism for complex systems," Sci. Comput. Program, vol. 8, pp. 231-274, 1987.
16. D. Harel and A. Naamad, "The stalemate semantics of Statecharts," ACM Trans. Softw. Eng. Methodol., vol. 5, no. 4, pp. 293-333, Oct. 1996.
17. T. Henzinger and S. Sastry, Lecture Notes in Computer Science, Hybrid Systems: Computation and Control, T. Henzinger and S. Sastry, Eds. Heidelberg, Germany: Springer-Verlag, 1998, vol. 1386.
18. T. A. Henzinger, P. W. Kopke, A. Puri, and P. Varaiya, "What's decidable about hybrid automata," J. Comput. and Syst. Sci., vol-.-57, pp. 94-124, 1998.
19. H. Hong, "An improvement of the projection operator in cylindrical algebraic decomposition," in Int. Symp. Symbol, and Algebraic Comput. (ISSAC-90), 1990, pp. 261-264.
20. _, (1995) Quantifier elimination by partial cylindrical algebraic decomposition. QEPCAD [Online] Available: http://www.cs.usna.edu/~qepcad/B/ QEPCAD.html
21. M. Jirstrand. (1995) Cylindrical Algebraic Decomposition-An Introduction. Dept. Elec. Eng. Linköping Univ., S-581 83 Linköping, Sweden. [Online]. Available: ftp.control.ee.liu.se
22. _, "Algebraic methods for modeling and design in control," masters thesis no. 540, Linköping Studies in Science and Technology, Dept. Elec. Eng., Li, 1996.
23. _, "Nonlinear control system design by quantifier elimination," J. Symbol. Comput., vol. 24, no. 2, pp. 137-152, Aug. 1997.
24. W. A. Hunt Jr. and S. D. Johnson, "Formal methods in computeraided design," in Lecture Notes in Computer Science, 3rd Int. Conf., FMCAD 2000, W. A. Hunt Jr. and S. D. Johnson, Eds., 2000, vol. 1954.
25. G. Lafferriere, G. J. Pappas, and S. Sastry, "O-minimal hybrid systems," Math. Control, Signals Syst., vol. 13, no. 1, pp. 1-21, 2000.
26. G. Lafferriere, G. J. Pappas, and S. Yovine, "Symbolic reachability computations for families of linear vector fields," J. Symbol. Comput., vol. 32, no. 3, pp. 231-253, Sept. 2001.
27. D. Lazard, "An improved projection for cylindrical algebraic decomposition," in Algebraic Geometry and its Applications, C. L. Bajaj, Ed. Berlin, Germany: Springer-Verlag, 1994.
28. S. McCallum, "An improved projection operator for cylindrical algebraic decomposition of three dimensional space," J, Symbol. Comput., vol. 5, pp. 141-161, 1988.
29. E. Mikk, Y. Lakhnech, and M. Siegel, "Hierarchical automata as model for Statecharts," in Lecture Notes in Computer Science, Asian Comput. Sci. Conf. (ASIAN'97), 1997, vol. 1345.
30. P. Mishra and G. J. Pappas. (2001) Reachability using quantifier elimination. Hybrid Systems Group at the University of Pennsylvania [Online] Available: http://www.seas.upenn.edu/hybrid/requiem.html
31. I. Mitchell and C. Tomlin, "Level set methods for computation in hybrid systems," in Lecture Notes in Computer Science, Hybrid Systems: Computation and Control, vol. 1790, 2000, pp. 310-323.
32. P. Pau and J. Schicho. (1999) Quantifier Elimination for Trignometric Polynomials by Cylindrical Algebraic Trignometric Decomposition. Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria. [Online]. Available: www.risc.unilinz.ac.at/people/ppau
33. A. Puri and P. Varaiya, "Driving safely in smart cars," in Proc. Am. Control Conf., 1995, pp. 3597-3599.
34. A. Tarski, A Decision Method for Elementary Algebra and Geometry, 2nd ed. Berkeley, CA: Univ. of California Press, 1951.
35. A. Tiwari. (2001) Formal Semantics and Analysis Methods for Simulink Stateflow Models. SRI International. [Online]. Available: http://www.csl.sri. com/-tiwari/stateflow.html
36. A. Tiwari and G. Khanna, "Series of abstractions for hybrid automata," in Lecture Notes in Computer Science, Hybrid Systems: Computation and Control, C. J. Tomlin and M. R. Greenstreet, Eds. Heidelberg, Germany: Springer-Verlag, 2002, vol. 2289, pp. 465-178.
37. A. Tiwari, H. Rueß, H. Saïdi, and N. Shankar, "A technique for invariant generation," in Lecture Notes in Computer Science, Tools and Algorithms for the Construction and Analysis of Systems, T. Margaria and W. Yi, Eds. Heidelberg, Germany: Springer-Verlag, 2001, vol. 2031, pp. 113-127.
38. M. von der Beck, "A comparison of stateflow variants," in Lecture Notes in Computer Science, Formal Techniques in Real-Time and Fault Tolerant Systems, L. de Roever and J. Vytopil, Eds. Heidelberg, Germany: Springer-Verlag, 1994, vol. 863, pp. 128-148.