# A user guide to HyTech

Conference paper

First Online:

## Abstract

HyTech is a tool for the automated analysis of embedded systems. This document, designed for the first-time user of HyTech, guides the reader through the underlying system model, and through the input language for describing and analyzing systems. The guide gives several examples of usage, and some hints for gaining maximal computational efficiency from the tool.

The version of HyTech described in this guide was released in August 1995, and is available through anonymous ftp from ftp.cs.cornell.edu in the directory pub/tah/HyTech, and through the World-Wide Web via HyTech's home page http:/www.cs.cornell.edu/Info/People/tah/hytech.html.

## Keywords

Parallel Composition Reachable State Boolean Expression Hybrid Automaton Reachability Analysis
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Download
to read the full conference paper text

## References

- [ACH93]R. Alur, C. Courcoubetis, and T.A. Henzinger. Computing accumulated delays in real-time systems. In C. Courcoubetis, editor,
*CAV 93: Computer-aided Verification*, Lecture Notes in Computer Science 697, pages 181–193. Springer-Verlag, 1993.Google Scholar - [ACH+95]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.
*Theoretical Computer Science*, 138:3–34, 1995.Google Scholar - [ACHH93]R. Alur, C. Courcoubetis, T.A. Henzinger, and P.-H. Ho. Hybrid automata: an algorithmic approach to the specification and verification of hybrid systems. In R.L. Grossman, A. Nerode, A.P. Ravn, and H. Rischel, editors,
*Hybrid Systems*, Lecture Notes in Computer Science 736, pages 209–229. Springer-Verlag, 1993.Google Scholar - [AD94]R. Alur and D.L. Dill. A theory of timed automata.
*Theoretical Computer Science*, 126:183–235, 1994.Google Scholar - [AHH93]R. Alur, T.A. Henzinger, and P.-H. Ho. Automatic symbolic verification of embedded systems. In
*Proceedings of the 14th Annual Realtime Systems Symposium*, pages 2–11. IEEE Computer Society Press, 1993. Full version available as Technical Report TR-1492, Department of Computer Science, Cornell University, Ithaca, NY 14853, 1995.Google Scholar - [BER94a]A. Bouajjani, R. Echahed, and R. Robbana. Verification of context-free timed systems using linear hybrid observers. In D.L. Dill, editor,
*CAV 94-Computer-aided Verification*, Lecture Notes in Computer Science, pages 118–131. Springer-Verlag, 1994.Google Scholar - [BER94b]A. Bouajjani, R. Echahed, and R. Robbana. Verifying invariance properties of timed systems with duration variables. In H. Langmaack, W.-P. de Roever, and J. Vytopil, editors,
*FTRTFT 94: Formal Techniques in Real-time and Fault-tolerant Systems*, Lecture Notes in Computer Science 863, pages 193–210. Springer-Verlag, 1994.Google Scholar - [BR95]A. Bouajjani and R. Robbana. Verifying
*ω*-regular properties for subclasses of linear hybrid systems. In P. Wolper, editor,*CAV 95: Computer-aided Verification*, Lecture Notes in Computer Science 939, pages 437–450. Springer-Verlag, 1995.Google Scholar - [Cer92]K. Cerāns. Decidability of bisimulation equivalence for parallel timer processes. In G. von Bochmann and D.K. Probst, editors,
*CAV 92: Computer-aided Verification*, Lecture Notes in Computer Science 663, pages 302–315. Springer-Verlag, 1992.Google Scholar - [CH78]P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In
*Proceedings of the Fifth Annual Symposium on Principles of Programming Languages*. ACM Press, 1978.Google Scholar - [CHR91]Z. Chaochen, C.A.R. Hoare, and A.P. Ravn. A calculus of durations.
*Information Processing Letters*, 40(5):269–276, 1991.Google Scholar - [DOY94]C. Daws, A. Olivero, and S. Yovine. Verifying ET-LOTOS programs with kRONOS. In
*Proceedings of Seventh International Conference on Formal Description Techniques*, 1994.Google Scholar - [DY95]C. Daws and S. Yovine. Two examples of verification of multirate timed automata with kRONOS. In
*Proceedings of the 16th Annual Realtime Systems Symposium*. IEEE Computer Society Press, 1995.Google Scholar - [Hal93]N. Halbwachs. Delay analysis in synchronous programs. In C. Courcoubetis, editor,
*CAV 93: Computer-aided Verification*, Lecture Notes in Computer Science 697, pages 333–346. Springer-Verlag,1993.Google Scholar - [Hen92]T.A. Henzinger. Sooner is safer than later.
*Information Processing Letters*, 43:135–141, 1992.Google Scholar - [Hen95]T.A. Henzinger. Hybrid automata with finite bisimulations. In Z. Fülöp and F. Gécseg, editors,
*ICALP 95: Automata, Languages, and Programming*, Lecture Notes in Computer Science 944, pages 324–335. Springer-Verlag, 1995.Google Scholar - [HH95a]T.A. Henzinger and P.-H. Ho. Algorithmic analysis of nonlinear hybrid systems. In P. Wolper, editor,
*CAV 95: Computer-aided Verification*, Lecture Notes in Computer Science 939, pages 225–238. Springer-Verlag, 1995.Google Scholar - [HH95b]T.A. Henzinger and P.-H. Ho. HyTech: The Cornell Hybrid Technology Tool. In A. Nerode, editor,
*Proceedings of the 1994 Workshop on Hybrid Systems and Autonomous Control*, Lecture Notes in Computer Science. Springer-Verlag, 1995.Google Scholar - [HH95c]T.A. Henzinger and P.-H. Ho. A note on abstract-interpretation strategies for hybrid automata. In A. Nerode, editor,
*Proceedings of the 1994 Workshop on Hybrid Systems and Autonomous Control*, Lecture Notes in Computer Science. Springer-Verlag, 1995.Google Scholar - [HHK95]M.R. Henzinger, T.A. Henzinger, and P.W. Kopke. Computing simulations on finite and infinite graphs. In
*Proceedings of the 36th Annual Symposium on Foundations of Computer Science*. IEEE Computer Society Press, 1995.Google Scholar - [HHWT95a]T. A. Henzinger, P.-H. Ho, and H. Wong-Toi. HyTech: the next generation. In
*Proceedings of the 16th Annual Real-time Systems Symposium*. IEEE Computer Society Press, 1995.Google Scholar - [HHWT95b]T. A. Henzinger, P.-H. Ho, and H. Wong-Toi. A user guide to HyTech. Technical Report TR-1532, Department of Computer Science, Cornell University, 1995.Google Scholar
- [HKPV95]T.A. Henzinger, P.W. Kopke, A. Puri, and P. Varaiya. What's decidable about hybrid automata? In
*Proceedings of the 27th Annual Symposium on Theory of Computing*, pages 373–382. ACM Press, 1995.Google Scholar - [HNSY94]T.A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems.
*Information and Computation*, 111(2):193–244, 1994.Google Scholar - [Ho95]Pei-Hsin Ho.
*Automatic Analysis of Hybrid Systems*. PhD thesis, Department of Computer Science, Cornell University, 1995.Google Scholar - [HRP94]N. Halbwachs, P. Raymond, and Y.-E. Proy. Verification of linear hybrid systems by means of convex approximation. In B. LeCharlier, editor,
*SAS 94: Static Analysis Symposium*, Lecture Notes in Computer Science 864, pages 223–237. Springer-Verlag, 1994.Google Scholar - [HWT95a]T. A. Henzinger and H. Wong-Toi. Phase portrait approximations of hybrid systems. Submitted, 1995.Google Scholar
- [HWT95b]P.-H. Ho and H. Wong-Toi. Automated analysis of an audio control protocol. In P. Wolper, editor,
*CAV 95: Computer-aided Verification*, Lecture Notes in Computer Science 939, pages 381–394. Springer-Verlag, 1995.Google Scholar - [KPSY93]Y. Kesten, A. Pnueli, J. Sifakis, and S. Yovine. Integration graphs: a class of decidable hybrid systems. In R.L. Grossman, A. Nerode, A.P. Ravn, and H. Rischel, editors,
*Hybrid Systems*, Lecture Notes in Computer Science 736, pages 179–208. Springer-Verlag, 1993.Google Scholar - [Lam87]L. Lamport. A fast mutual exclusion algorithm.
*ACM Transactions on Computer Systems*, 5(1):1–11, 1987.Google Scholar - [LPY95]K. G. Larsen, P. Pettersson, and W. Yi. Compositional and symbolic model-checking of real-time systems. In
*Proceedings of the 16th Annual Real-time Systems Symposium*. IEEE Computer Society Press, 1995.Google Scholar - [LS85]N. Leveson and J. Stolzy. Analyzing safety and fault tolerance using timed petri nets. In
*Proceedings of International Joint Conference on Theory and Practice of Software Development*, Lecture Notes in Computer Science 186, pages 339–355. Springer-Verlag, 1985.Google Scholar - [MPS95]O. Maler, A. Pnueli, and J. Sifakis. On the synthesis of discrete controllers for timed systems. In E.W. Mayr and C. Puech, editors,
*STACS 95: Symposium on Theoretical Aspects of Computer Science*, Lecture Notes in Computer Science 900, pages 229–242. Springer-Verlag, 1995.Google Scholar - [MV94]J. McManis and P. Varaiya. Suspension automata: a decidable class of hybrid automata. In D.L. Dill, editor,
*CAV 94: Computer-aided Verification*, Lecture Notes in Computer Science 818, pages 105–117. Springer-Verlag, 1994.Google Scholar - [NOSY93]X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. An approach to the description and analysis of hybrid systems. In R.L. Grossman, A. Nerode, A.P. Ravn, and H. Rischel, editors,
*Hybrid Systems*, Lecture Notes in Computer Science 736, pages 149–178. Springer-Verlag, 1993.Google Scholar - [NSY92]X. Nicollin, J. Sifakis, and S. Yovine. Compiling real-time specifications into extended automata.
*IEEE Transactions on Software Engineering*, SE-18(9):794–804, 1992.Google Scholar - [OSY94]A. Olivero, J. Sifakis, and S. Yovine. Using abstractions for the verification of linear hybrid systems. In D.L. Dill, editor,
*CAV 94: Computer-aided Verification*, Lecture Notes in Computer Science 818, pages 81–94. Springer-Verlag, 1994.Google Scholar - [PV94]A. Puri and P. Varaiya. Decidability of hybrid systems with rectangular differential inclusions. In D.L. Dill, editor,
*CAV 94: Computeraided Verification*, Lecture Notes in Computer Science 818, pages 95–104. Springer-Verlag, 1994.Google Scholar - [VW86]M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In
*Proceedings of the First Annual Symposium on Logic in Computer Science*, pages 322–331. IEEE Computer Society Press, 1986.Google Scholar

## Copyright information

© Springer-Verlag Berlin Heidelberg 1995