Hybrid automaton

Hybrid automaton

A hybrid automaton (plural hybrid automata) is a mathematical model for precisely describing systems where computational processes interact with physical processes. Its behavior consists of discrete state transitions and continuous evolution.

Examples

A simple example is a room-thermostat-heater system where the temperature of the room evolves according to laws of thermodynamics and the state of the heater (on/off); the thermostat senses the temperature, performs certain computations and turns the heater on and off. In general, hybrid automata have been used to model and analyze a variety of embedded systems including vehicle control systems, air-traffic controller, mobile robots, and processes from systems biology.

Definition

Informally, a hybrid automaton is a (possibly infinite) state machine augmented with differential equations. It is a standard model for describing a hybrid system. Several different but equivalent formal definitions exist.

Related Models

Hybrid automata come in several flavors: The Alur-Henzinger hybrid automaton is a popular model; it was developed primarily for algorithmic analysis of hybrid systems model checking. The [http://www-cad.eecs.berkeley.edu/~tah/HyTech/ HyTech] model checking tool is based on this model. The Hybrid Input/Output Automaton model has been developed more recently. This model enables compositional modeling and analysis of hybrid systems. Another formalism which i useful to model implementations of hybrid automaton is Lazy linear hybrid automaton

References

*Rajeev Alur, Costas Courcoubetis, Nicolas Halbwachs, Thomas A. Henzinger, Pei-Hsin Ho, Xavier Nicollin, Alfredo Olivero, Joseph Sifakis, and Sergio Yovine "The algorithmic analysis of hybrid systems". Theoretical Computer Science, volume 138(1), pages 3--34,1995.

*Nancy Lynch, Roberto Segala, Frits Vaandrager, "Hybrid I/O Automata".Information and Computation, volume 185(1), pages 103-157, 2003.

----


Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Lazy linear hybrid automaton — Lazy linear hybrid automata model the discrete time behavior of control systems containing finite precision sensors and actuators interacting with their environment under bounded inertial delays. The model permits only linear flow constraints but …   Wikipedia

  • Hybrid system — A hybrid system is a dynamic system that exhibits both continuous and discrete dynamic behavior a system that can both flow (described by a differential equation) and jump (described by a difference equation). Often, the term hybrid dynamic… …   Wikipedia

  • Majority problem (cellular automaton) — The majority problem, or density classification task is the problem of finding one dimensional cellular automaton rules that accurately perform majority voting. Using local transition rules, cells cannot know the total count of all the ones in… …   Wikipedia

  • Mobile automaton — (plural: mobile automata) is a class of automata similar to cellular automata but which have a single active cell instead of updating all cells in parallel. In a mobile automaton, the evolution rules apply only to the active cell, and also… …   Wikipedia

  • Switch-technology — is a technology for automata based programming support. It was proposed by Anatoly Shalyto in 1991. It involves software specification, design, implementation, debugging, documentation and maintenance. The term “automata based programming” is… …   Wikipedia

  • List of mathematics articles (H) — NOTOC H H cobordism H derivative H index H infinity methods in control theory H relation H space H theorem H tree Haag s theorem Haagerup property Haaland equation Haar measure Haar wavelet Haboush s theorem Hackenbush Hadamard code Hadamard… …   Wikipedia

  • Petri net — A Petri net (also known as a place/transition net or P/T net) is one of several mathematical modeling languages for the description of distributed systems. A Petri net is a directed bipartite graph, in which the nodes represent transitions (i.e.… …   Wikipedia

  • Niagara Frontier Transportation Authority — NFTA redirects here. For Nondeterministic Finite Tree Automaton, see Tree automaton. For the North American trade agreement, see NAFTA. Niagara Frontier Transportation Authority Slogan Serving Buffalo Niagara Founded 1967 …   Wikipedia

  • List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… …   Wikipedia

  • Список терминов, относящихся к алгоритмам и структурам данных —   Это служебный список статей, созданный для координации работ по развитию темы.   Данное предупреждение не устанавливается на информационные списки и глоссарии …   Википедия

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”