Results 71 to 80 of about 63,385 (219)
Cellular automata and dynamical systems [PDF]
In this thesis we investigate the theoretical nature of the mathematical structures termed cellular automata. Chapter 1: Reviews the origin and history of cellular automata in order to place the current work into context.
Clewlow, Les
core
Evolving cellular automata to generate nonlinear sequences with desirable properties
This paper presents a new chromosomal representation and associated genetic operators for the evolution of highly nonlinear cellular automata that generate pseudorandom number sequences with desirable properties ensured.
Guan, SU, Tan, SK
core +1 more source
Verification of on-demand medical device networks
We propose a novel method for the automated formal analysis of on-demand medical device networks communicating via an open communication protocol. The resulting toolbox aims at assisting operators of cross-vendor medical device networks in the complex ...
Dingler Max, Dietz Christian, Lüth Tim
doaj +1 more source
On structure of isomorphisms of universal graphic automata [PDF]
Automata theory is one of the branches of mathematical cybernetics, that studies information transducers that arise in many applied problems. The major objective of automata theory is to develop methods by which one can describe and analyze the dynamic ...
Molchanov, Vladimir Aleksandrovich +1 more
doaj +1 more source
Modeling Decentralized Real-Time Control by State Space Partition of Timed Automata [PDF]
Timed automata provide useful state machine based representations for the validation and verification of realtime control systems. This paper introduces an algorithmic methodology to translate the state space visualization of a centralized real-time ...
S. Chennu +5 more
core +1 more source
Uncertain Automata and Uncertain Graph Grammar [PDF]
Graph theory has been widely studied, resulting in numerous applications across various felds. Among its many topics, Automata and Graph Grammar have emerged as signifcant areas ofresearch.
Florentin Smarandache, Takaaki Fujita
doaj +1 more source
Algebraic Methods for Finite Linear Cellular Automata
PhDCellular automata are a simple class of extended dynamical systems which have been much studied in recent years. Linear cellular automata are the class of cellular automata most amenable to algebraic analytic treatments, algebraic techniques are ...
Dow, R. A.
core
From LIDL(m) to Timed Automata [PDF]
LIDL(m) is a decidable fragment of Interval Duration Logic with Located Constraints, an expressive subset of dense-time Duration Calculus. It has been claimed that, for any LIDL(m) formula D, a timed automaton can be constructed which accepts the models ...
Gomez, Rodolfo
core
Relational Concurrent Refinement: Automata [PDF]
Data refinement in a state-based language such as Z is defined using a relational model in terms of the behaviour of abstract programs. Downward and upward simulation conditions form a sound and jointly complete methodology to verify relational data ...
Derrick, John +4 more
core +1 more source
Complete Subhedge Projection for Stepwise Hedge Automata
We demonstrate how to evaluate stepwise hedge automata (Shas) with subhedge projection while completely projecting irrelevant subhedges. Since this requires passing finite state information top-down, we introduce the notion of downward stepwise hedge ...
Antonio Al Serhali, Joachim Niehren
doaj +1 more source

