Search results for "Automaton"
showing 10 items of 257 documents
Forced oscillations in a self-oscillating surface reaction model
2004
A microscopic lattice gas model for the catalytic CO + O2 reaction on Pt(110) subject to external periodic forcing is studied by means of cellular automaton simulations. Harmonic resonance, subharmonic and superharmonic entrainment, quasiperiodic as well as chaotic behavior are among the observed phenomena in this model when the gas phase concentration of CO as an external control parameter is periodically varied and interacts with the self-oscillating reaction system.
Approximation of Continuous Media Models for Granular Systems Using Cellular Automata
2004
In this paper a new cellular automata model suitable for granular systems simulation is presented. The proposed model is shown to be equivalent to a particularization of the well known BCRE model of granular systems and a correspondence between the parameters of the presented model and the BCRE model is also set, allowing to fit these parameters for a given system. The model has the advantage over other cellular automata models of being more realistic in the behavior of the surface of heaps and slopes. The dynamics of the CA is analyzed in order to confirm that it also has one of the most important features of these systems, 1/f noise.
A solution to the stochastic point location problem in metalevel nonstationary environments.
2008
This paper reports the first known solution to the stochastic point location (SPL) problem when the environment is nonstationary. The SPL problem involves a general learning problem in which the learning mechanism (which could be a robot, a learning automaton, or, in general, an algorithm) attempts to learn a "parameter," for example, lambda*, within a closed interval. However, unlike the earlier reported results, we consider the scenario when the learning is to be done in a nonstationary setting. For each guess, the environment essentially informs the mechanism, possibly erroneously (i.e., with probability p), which way it should move to reach the unknown point. Unlike the results availabl…
Two-way quantum and classical machines with small memory for online minimization problems
2019
We consider online algorithms. Typically the model is investigated with respect to competitive ratio. In this paper, we explore algorithms with small memory. We investigate two-way automata as a model for online algorithms with restricted memory. We focus on quantum and classical online algorithms. We show that there are problems that can be better solved by two-way automata with quantum and classical states than classical two-way automata in the case of sublogarithmic memory (sublinear size).
Verification of linear hybrid systems with large discrete state spaces using counterexample-guided abstraction refinement
2017
Abstract We present a counterexample-guided abstraction refinement ( CEGAR) approach for the verification of safety properties of linear hybrid automata with large discrete state spaces, such as naturally arising when incorporating health state monitoring and degradation levels into the controller design. Such models can – in contrast to purely functional controller models – not be analyzed with hybrid verification engines relying on explicit representations of modes, but require fully symbolic representations for both the continuous and discrete part of the state space. The presented abstraction methods directly work on a symbolic representation of arbitrary non-convex combinations of line…
Modelling and simulation of several interacting cellular automata
2015
Cellular automata are used for modelling and simulation of many systems. In some applications, the system is formed by a set of subsystems that can be modelled separately, but, in such cases, the existence of interactions between these subsystems requires additional modelling and computer programming. In this paper we propose a modelling methodology for the simulation of a set of cellular automata models that interact with each other. The modelling methodology is described, together with an insight on implementation details. Also, it is applied to a particular cellular automata model, the Sanpile model, to illustrate its use and to obtain some example simulations.
Classical and Quantum Computations with Restricted Memory
2018
Automata and branching programs are known models of computation with restricted memory. These models of computation were in focus of a large number of researchers during the last decades. Streaming algorithms are a modern model of computation with restricted memory. In this paper, we present recent results on the comparative computational power of quantum and classical models of branching programs and streaming algorithms.
A Tool for Implementing and Exploring SBM Models: Universal 1D Invertible Cellular Automata
2005
The easiest form of designing Cellular Automata rules with features such as invertibility or particle conserving is to rely on a partitioning scheme, the most important of which is the 2D Margolus neighborhood. In this paper we introduce a 1D Margolus-like neighborhood that gives support to a complete set of Cellular Automata models. We present a set of models called Sliding Ball Models based on this neighborhood and capable of universal computation. We show the way of designing logic gates with these models, propose a digital structure to implement them and finally we present SBMTool, a software development system capable of working with the new models.
ENFORCEMENT OF INTER-TASK DEPENDENCIES IN WORKFLOWS, CHARACTERIZATION AND PARADIGM
1998
Workflow techniques have gained a lot of attention as a means to support advanced business applications such as cooperative information systems and process re-engineering but also as a means to integrate legacy systems. Inter-task dependencies, described separately from the other parts of the workflow, have been recognized as a valuable method in describing certain restrictions on the executions of workflows. In this paper, we study the issue of pre-analysing and enforcing inter-task dependencies. The protocol and the theory behind it are presented, along with examples and discussions on ways to improve the performance. The idea is to present the meaning of a dependency through an automato…
Text Compression Using Antidictionaries
1999
International audience; We give a new text compression scheme based on Forbidden Words ("antidictionary"). We prove that our algorithms attain the entropy for balanced binary sources. They run in linear time. Moreover, one of the main advantages of this approach is that it produces very fast decompressors. A second advantage is a synchronization property that is helpful to search compressed data and allows parallel compression. Our algorithms can also be presented as "compilers" that create compressors dedicated to any previously fixed source. The techniques used in this paper are from Information Theory and Finite Automata.