# Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems

## Abstract

We introduce the framework of *hybrid automata* as a model and specification language for hybrid systems. Hybrid automata can be viewed as a generalization of timed automata, in which the behavior of variables is governed in each state by a set of differential equations. We show that many of the examples considered in the workshop can be defined by hybrid automata. While the reachability problem is undecidable even for very restricted classes of hybrid automata, we present two semidecision procedures for verifying safety properties of *piecewiselinear* hybrid automata, in which all variables change at constant rates. The two procedures are based, respectively, on minimizing and computing fixpoints on generally infinite state spaces. We show that if the procedures terminate, then they give correct answers. We then demonstrate that for many of the typical workshop examples, the procedures do terminate and thus provide an automatic way for verifying their properties.

## Keywords

Hybrid System Mutual Exclusion Acceptance Condition Hybrid Automaton Reachability Problem## Preview

Unable to display preview. Download preview PDF.

## References

- [ACH92]R. Alur, C. Courcoubetis, N. Halbwachs, D.L. Dill, and H. Wong-Toi. Minimization of timed transition systems. In
*CONCUR 92: Theories of Concurrency*, Lecture Notes in Computer Science 630, pages 340–354. Springer-Verlag, 1992.Google Scholar - [AD90]R. Alur and D.L. Dill. Automata for modeling real-time systems. In M.S. Paterson, editor,
*ICALP 90: Automata, Languages, and Programming*, Lecture Notes in Computer Science 443, pages 322–335. Springer-Verlag, 1990.Google Scholar - [BFH90]A. Bouajjani, J.C. Fernandez, and N. Halbwachs. Minimal model generation. In R.P. Kurshan and E.M. Clarke, editors,
*CAV 90: Automatic Verification Methods for Finite-state Systems*, Lecture Notes in Computer Science 531, pages 197–203. Springer-Verlag, 1990.Google Scholar - [Cerāns]K. Cerāns. Decidability of bisimulation equivalence for parallel timer processes. In
*CAV 92: Automatic Verification Methods for Finite-state Systems*, Lecture Notes in Computer Science. Springer-Verlag. To appear.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 - [HNSY92]T.A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. In
*Proceedings of the Seventh Annual Symposium on Logic in Computer Science*, pages 394–406. IEEE Computer Society Press, 1992.Google Scholar - [HPS83]D. Harel, A. Pnueli, and J. Stavi. Propositional dynamic logic of regular programs.
*Journal of Computer and System Sciences*, 26(2):222–243, 1983.Google Scholar - [Lam87]L. Lamport. A fast mutual exclusion algorithm.
*ACM Transactions on Computer Systems*, 5(1):1–11, 1987.Google Scholar - [LY92]D. Lee and M. Yannakakis. Online minimization of transition systems. In
*Proceedings of the 24th Annual Symposium on Theory of Computing*. ACM Press, 1992.Google Scholar - [MMP92]O. Maler, Z. Manna, and A. Pnueli. From timed to hybrid systems. In J.W. de Bakker, K. Huizing, W.-P. de Roever, and G. Rozenberg, editors,
*Real Time: Theory in Practice*, Lecture Notes in Computer Science 600, pages 447–484. Springer-Verlag, 1992.Google Scholar - [NOSY]X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. An approach to the description and analysis of hybrid systems. This volume.Google Scholar
- [NSY92]X. Nicollin, J. Sifakis, and S. Yovine. From ATP to timed graphs and hybrid systems. In J.W. de Bakker, K. Huizing, W.-P. de Roever, and G. Rozenberg, editors,
*Real Time: Theory in Practice*, Lecture Notes in Computer Science 600, pages 549–572. Springer-Verlag, 1992.Google Scholar - [WME92]F. Wang, A.K. Mok, and E.A. Emerson. Real-time distributed system specification and verification in asynchronous propositional temporal logic. In
*Proceedings of the 12th International Conference on Software Engineering*, 1992.Google Scholar