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 published on a yearly basis
Papers
More filters
TL;DR: This paper presents a more efficient construction of the equation automaton which avoids the sorting step and replaces it by a minimization of an acyclic finite deterministic automaton and shows that this minimization allows the identification of identical sub-expressions as well as the sortingstep used in Champarnaud and Ziadi's approach.
16 citations
01 Jan 2012
TL;DR: This paper revisits label, a technique to satisfy the synthesis conditions through renaming of problematic labels, and for the first time, the problem is formally characterized and its optimality addressed.
Abstract: The theory of regions was introduced by Ehrenfeucht and Rozenberg in the early nineties to explain how to derive (synthesize) an event-based model (e.g., a Petri net) from an automaton. To be applicable, the theory relies on stringent conditions on the input automaton. Although some relaxation on these restrictions was done in the last decade, in general not every automaton can be synthesized while preserving its behavior. A crucial step for a non-synthesizable automaton is to transform it in order to satisfy the synthesis conditions. This paper revisits label splitting, a technique to satisfy the synthesis conditions through renaming of problematic labels. For the first time, the problem is formally characterized and its optimality addressed. Some extensions and applications of the label splitting are presented to illustrate the significance of this technique.
16 citations
TL;DR: Ito equations for simple stochastic cellular automata with parameters were derived in this article, and good agreement for various parameters supports wide applicability of the Ito equation as a macroscopic model.
Abstract: Ito equations are derived for simple stochastic cellular automaton with parameters and compared with results obtained from the histogram method. Good agreement for various parameters supports wide applicability of the Ito equation as a macroscopic model.
16 citations
26 Aug 2007
TL;DR: The undecidability of a rather large class of problems over trace subshifts of cellular automata is proved.
Abstract: The trace subshift of a cellular automaton is the subshift of all possible columns that may appear in a space-time diagram We prove the undecidability of a rather large class of problems over trace subshifts of cellular automata
16 citations
17 Oct 1993
TL;DR: The weighted cellular automaton is a complete automaton that contains no external weighting logic and no multiplexers between flip-flop outputs and the circuit under test that add to critical path delays.
Abstract: Weighted random pattern testing methods produce higher fault coverage with shorter test lengths than random pattern testing methods. Here we present the weighted cellular automaton (WCA), an inhomogeneous cellular automaton that generates weighted random patterns on a test per clock basis. The WCA is a complete automaton that contains no external weighting logic and no multiplexers between flip-flop outputs and the circuit under test that add to critical path delays. Since the structure is based on cellular automata there are no complex routing problems. We also give a design algorithm, WCARGO, that automatically generates WCA from an ordered set of weights. >
16 citations