scispace - formally typeset
Topic

Mobile automaton

About: Mobile automaton is a(n) research topic. Over the lifetime, 2160 publication(s) have been published within this topic receiving 63192 citation(s).

...read more

Papers
More filters

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


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


Journal ArticleDOI
Michael O. Rabin1, Dana Scott2Institutions (2)
TL;DR: Finite automata are considered as instruments for classifying finite tapes as well as generalizations of the notion of an automaton are introduced and their relation to the classical automata is determined.

...read more

Abstract: Finite automata are considered in this paper as instruments for classifying finite tapes. Each one-tape automaton defines a set of tapes, a two-tape automaton defines a set of pairs of tapes, et cetera. The structure of the defined sets is studied. Various generalizations of the notion of an automaton are introduced and their relation to the classical automata is determined. Some decision problems concerning automata are shown to be solvable by effective algorithms; others turn out to be unsolvable by algorithms.

...read more

1,836 citations


Journal ArticleDOI
Stephen Wolfram1Institutions (1)
TL;DR: Evidence is presented that all one-dimensional cellular automata fall into four distinct universality classes, and one class is probably capable of universal computation, so that properties of its infinite time behaviour are undecidable.

...read more

Abstract: Cellular automata are discrete dynamical systems with simple construction but complex self-organizing behaviour. Evidence is presented that all one-dimensional cellular automata fall into four distinct universality classes. Characterizations of the structures generated in these classes are discussed. Three classes exhibit behaviour analogous to limit points, limit cycles and chaotic attractors. The fourth class is probably capable of universal computation, so that properties of its infinite time behaviour are undecidable.

...read more

1,632 citations


01 Jan 1986-

1,570 citations


Network Information
Related Topics (5)
Quantum finite automata

3.7K papers, 96.5K citations

90% related
Continuous spatial automaton

1.5K papers, 33.8K citations

89% related
Automaton

2.3K papers, 53.8K citations

88% related
ω-automaton

2.2K papers, 68.4K citations

87% related
Nondeterministic algorithm

5.8K papers, 156.6K citations

87% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20201
20192
20189
201749
201668
201575

Top Attributes

Show by:

Topic's top 5 most impactful authors

Martin Kutrib

28 papers, 321 citations

Ramón Alonso-Sanz

23 papers, 461 citations

Andrew Adamatzky

19 papers, 468 citations

Hiroshi Umeo

12 papers, 152 citations

Guillaume Theyssier

11 papers, 222 citations