In this paper, Hybrid Automata, which is a formal model for hybrid systems, has been introduced. A summary of its theory is presented and some of its special and important classes are listed and some properties that can be studied and checked for it are mentioned. Finally, the purposes of use, the most widely used areas, and the tools that provide H.A. Support are addressed.
Keywords:
Subject: Computer Science and Mathematics - Discrete Mathematics and Combinatorics
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.