Topic

# Automaton

About: Automaton is a(n) research topic. Over the lifetime, 2389 publication(s) have been published within this topic receiving 53824 citation(s). The topic is also known as: automata & automated machine.

##### Papers

More filters

••

Abstract: Alur, R. and D.L. Dill, A theory of timed automata, Theoretical Computer Science 126 (1994) 183-235. We propose timed (j&e) automata to model the behavior of real-time systems over time. Our definition provides a simple, and yet powerful, way to annotate state-transition graphs with timing constraints using finitely many real-valued clocks. A timed automaton accepts timed words-infinite sequences in which a real-valued time of occurrence is associated with each symbol. We study timed automata from the perspective of formal language theory: we consider closure properties, decision problems, and subclasses. We consider both nondeterministic and deterministic transition structures, and both Biichi and Muller acceptance conditions. We show that nondeterministic timed automata are closed under union and intersection, but not under complementation, whereas deterministic timed Muller automata are closed under all Boolean operations. The main construction of the paper is an (PSPACE) algorithm for checking the emptiness of the language of a (nondeterministic) timed automaton. We also prove that the universality problem and the language inclusion problem are solvable only for the deterministic automata: both problems are undecidable (II i-hard) in the nondeterministic case and PSPACE-complete in the deterministic case. Finally, we discuss the application of this theory to automatic verification of real-time requirements of finite-state systems.

6,845 citations

01 Jan 1986-

1,239 citations

••

01 Jan 1993-

TL;DR: This work presents two semidecision procedures for verifying safety properties of piecewiselinear hybrid automata, in which all variables change at constant rates, and demonstrates that for many of the typical workshop examples, the procedures do terminate and thus provide an automatic way for verifying their properties.

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.

1,225 citations

••

TL;DR: HyTech is a symbolic model checker for linear hybrid automata, a subclass of hybrids that can be analyzed automatically by computing with polyhedral state sets that combines automaton transitions for capturing discrete change with differential equations for capturing continuous change.

Abstract: A hybrid system consists of a collection of digital programs that interact with each other and with an analog environment. Examples of hybrid systems include medical equipment, manufacturing controllers, automotive controllers, and robots. The formal analysis of the mixed digital-analog nature of these systems requires a model that incorporates the discrete behavior of computer programs with the continuous behavior of environment variables, such as temperature and pressure. Hybrid automata capture both types of behavior by combining finite automata with differential inclusions (i.e. differential inequalities). HyTech is a symbolic model checker for linear hybrid automata, an expressive, yet automatically analyzable, subclass of hybrid automata. A key feature of HyTech is its ability to perform parametric analysis, i.e. to determine the values of design parameters for which a linear hybrid automaton satisfies a temporal requirement.

1,082 citations

•

01 Jan 1987-

TL;DR: This book provides a laboratory in which the ideas presented in this book can be tested and applied to the synthesis of a great variety of systems, including practical applications involving parallel computation and image processing.

Abstract: Recently, cellular automata machines with the size, speed, and flexibility for general experimentation at a moderate cost have become available to the scientific community. These machines provide a laboratory in which the ideas presented in this book can be tested and applied to the synthesis of a great variety of systems. Computer scientists and researchers interested in modeling and simulation as well as other scientists who do mathematical modeling will find this introduction to cellular automata and cellular automata machines (CAM) both useful and timely.Cellular automata are the computer scientist's counterpart to the physicist's concept of 'field' They provide natural models for many investigations in physics, combinatorial mathematics, and computer science that deal with systems extended in space and evolving in time according to local laws. A cellular automata machine is a computer optimized for the simulation of cellular automata. Its dedicated architecture allows it to run thousands of times faster than a general-purpose computer of comparable cost programmed to do the same task. In practical terms this permits intensive interactive experimentation and opens up new fields of research in distributed dynamics, including practical applications involving parallel computation and image processing.Contents: Introduction. Cellular Automata. The CAM Environment. A Live Demo. The Rules of the Game. Our First rules. Second-order Dynamics. The Laboratory. Neighbors and Neighborhood. Running. Particle Motion. The Margolus Neighborhood. Noisy Neighbors. Display and Analysis. Physical Modeling. Reversibility. Computing Machinery. Hydrodynamics. Statistical Mechanics. Other Applications. Imaging Processing. Rotations. Pattern Recognition. Multiple CAMS. Perspectives and Conclusions.Tommaso Toffoli and Norman Margolus are researchers at the Laboratory for Computer Science at MIT. Cellular Automata Machines is included in the Scientific Computation Series, edited by Dennis Cannon.

1,069 citations