scispace - formally typeset
Topic

Automata theory

About: Automata theory is a(n) research topic. Over the lifetime, 5162 publication(s) have been published within this topic receiving 175855 citation(s).

...read more

Papers
More filters

Book
01 Jan 1979-
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.

...read more

Abstract: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity. The authors present the theory in a concise and straightforward manner, with an eye out for the practical applications. Exercises at the end of each chapter, including some that have been solved, help readers confirm and enhance their understanding of the material. This book is appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.

...read more

13,555 citations


Journal ArticleDOI
Rajeev Alur1, David L. Dill1Institutions (1)
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.

...read more

6,845 citations


Book
30 Sep 1999-
TL;DR: This edition includes recent research results pertaining to the diagnosis of discrete event systems, decentralized supervisory control, and interval-based timed automata and hybrid automata models.

...read more

Abstract: Introduction to Discrete Event Systems is a comprehensive introduction to the field of discrete event systems, offering a breadth of coverage that makes the material accessible to readers of varied backgrounds. The book emphasizes a unified modeling framework that transcends specific application areas, linking the following topics in a coherent manner: language and automata theory, supervisory control, Petri net theory, Markov chains and queuing theory, discrete-event simulation, and concurrent estimation techniques. This edition includes recent research results pertaining to the diagnosis of discrete event systems, decentralized supervisory control, and interval-based timed automata and hybrid automata models.

...read more

4,166 citations


Journal ArticleDOI
Peter J. Ramadge1, W. M. WonhamInstitutions (1)
01 Jan 1989-
TL;DR: The focus is on the qualitative aspects of control, but computation and the related issue of computational complexity are also considered.

...read more

Abstract: A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Such systems arise in a variety of contexts ranging from computer operating systems to the control of complex multimode processes. A control theory for the logical aspects of such DESs is surveyed. The focus is on the qualitative aspects of control, but computation and the related issue of computational complexity are also considered. Automata and formal language models for DESs are surveyed. >

...read more

2,759 citations


Journal ArticleDOI
Stephen Wolfram1Institutions (1)
TL;DR: Analysis is given of ''elementary'' cellular automata consisting of a sequence of sites with values 0 or 1 on a line, with each site evolving deterministically in discrete time steps according to p definite rules involving the values of its nearest neighbors.

...read more

Abstract: Cellular automata are used as simple mathematical models to investigate self-organization in statistical mechanics. A detailed analysis is given of "elementary" cellular automata consisting of a sequence of sites with values 0 or 1 on a line, with each site evolving deterministically in discrete time steps according to definite rules involving the values of its nearest neighbors. With simple initial configurations, the cellular automata either tend to homogeneous states, or generate self-similar patterns with fractal dimensions \ensuremath{\simeq} 1.59 or \ensuremath{\simeq} 1.69. With "random" initial configurations, the irreversible character of the cellular automaton evolution leads to several self-organization phenomena. Statistical properties of the structures generated are found to lie in two universality classes, independent of the details of the initial state or the cellular automaton rules. More complicated cellular automata are briefly considered, and connections with dynamical systems theory and the formal theory of computation are discussed.

...read more

2,685 citations


Network Information
Related Topics (5)
Automaton

2.3K papers, 53.8K citations

93% related
Quantum finite automata

3.7K papers, 96.5K citations

92% related
Finite-state machine

15.1K papers, 292.9K citations

91% related
Deterministic finite automaton

2.8K papers, 61.7K citations

91% related
Nondeterministic algorithm

5.8K papers, 156.6K citations

90% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202132
202059
201951
201864
2017126
2016137

Top Attributes

Show by:

Topic's top 5 most impactful authors

Markus Holzer

27 papers, 460 citations

Thomas A. Henzinger

26 papers, 7.3K citations

Martin Kutrib

21 papers, 247 citations

Moshe Y. Vardi

19 papers, 1.4K citations

Kim Guldstrand Larsen

17 papers, 986 citations