scispace - formally typeset
Search or ask a question
Topic

Continuous automaton

About: Continuous automaton is a research topic. Over the lifetime, 947 publications have been published within this topic receiving 17417 citations.


Papers
More filters
Proceedings ArticleDOI
01 Dec 2007
TL;DR: The main result is to propose a novel algorithm to construct a timed automaton that is an approximate timed abstraction of a hybrid automaton with desired precision, and study its convergence properties.
Abstract: Given a hybrid automaton and a desired precision, we aim at constructing an approximate abstraction by means of a timed automaton, whose discrete state trajectories approximate the discrete state trajectories of the original system, with the desired precision on switching times. We show that using the Euclidian metric on reals it is not always possible to construct a timed automaton that is close to a hybrid automaton with finite precision. For this reason, we motivate and introduce relative metrics on reachability time, external language and simulation relation to quantify the precision of our abstraction. Our main result is to propose a novel algorithm to construct a timed automaton that is an approximate timed abstraction of a hybrid automaton with desired precision, and study its convergence properties. For an extended version of this paper refer to [D'Innocenzo et al., 2007].

15 citations

Journal ArticleDOI
TL;DR: A new proof of these two results is presented which is based on the Mittag-Leffler lemma for projective sequences of sets and shows that if G is a non-periodic group and V is an infinite-dimensional vector space, then there exist two linear cellular automaton whose image is not closed in V^G for the prodiscrete topology.

14 citations

Posted Content
TL;DR: Simulations show that the self-organized criticality emerges naturally in the system for a given probability of shortcuts and transition occurs as the probability increases to some critical value indicating the small-world behaviour of the complex automata networks.
Abstract: A small-world cellular automaton network has been formulated to simulate the long-range interactions of complex networks using unconventional computing methods in this paper. Conventional cellular automata use local updating rules. The new type of cellular automata networks uses local rules with a fraction of long-range shortcuts derived from the properties of small-world networks. Simulations show that the self-organized criticality emerges naturally in the system for a given probability of shortcuts and transition occurs as the probability increases to some critical value indicating the small-world behaviour of the complex automata networks. Pattern formation of cellular automata networks and the comparison with equation-based reaction-diffusion systems are also discussed

14 citations

Journal ArticleDOI
TL;DR: An algorithm is presented for determining reversibility characteristics of 1-dimensional cellular automaton laws and algorithms are described for generating the set of center-reversible laws and the setof center- reversible additive laws.

14 citations

Journal ArticleDOI
TL;DR: A 2-dimensional 2-state cellular automaton that–though governed by a single simple transition rule–has a sufficiently rich dynamics to be computationally universal and is proved the computational universality of the model by constructing a universal set of logic gates from these patterns.

14 citations

Network Information
Related Topics (5)
Time complexity
36K papers, 879.5K citations
81% related
Graph (abstract data type)
69.9K papers, 1.2M citations
77% related
Approximation algorithm
23.9K papers, 654.3K citations
77% related
Graph theory
20.8K papers, 691.4K citations
76% related
Computational complexity theory
30.8K papers, 711.2K citations
76% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20232
202219
20212
20192
20184
201719