Filters








4,642 Hits in 2.3 sec

Classification of Complex Systems Based on Transients [article]

Barbora Hudcova, Tomas Mikolov
2020 arXiv   pre-print
Further, we use it to classify 2D cellular automata to show that our technique can easily be applied to more complex models of computation.  ...  When applied to elementary cellular automata, we obtain classification results, which correlate very well with Wolfram's manual classification.  ...  We were able to classify 93.03% of 10 000 sampled automata with a time bound of 40 seconds for the computation of one transient length value on a single CPU.  ... 
arXiv:2008.13503v1 fatcat:6cywlboz7zckda7profmxh7zya

Exact enumeration of acyclic deterministic automata

Valery A. Liskovets
2006 Discrete Applied Mathematics  
Calculations show that the results obtained in this paper improve recent upper bounds for the number of minimal deterministic automata (with accepting states) recognizing finite languages.  ...  The latter determines, in particular, the number of acyclic automata with labelled states.  ...  The author noted that a better bound should follow from the enumeration of such automata as unlabelled initially connected acyclic automata.  ... 
doi:10.1016/j.dam.2005.06.009 fatcat:vvy332u2greszcc4625nih7xhi

Classification of Discrete Dynamical Systems Based on Transients [article]

Barbora Hudcová, Tomáš Mikolov
2021 arXiv   pre-print
Further, we use this method to classify 2D cellular automata to automatically find those with interesting, complex dynamics.  ...  To show that our approach can be applied to many different computational systems, we demonstrate the results of classifying cellular automata, Turing machines, and random Boolean networks.  ...  We were able to classify 93.03% of 10 000 sampled automata with a time bound of 40 seconds for the computation of one transient length value on a single CPU.  ... 
arXiv:2108.01573v1 fatcat:yi6dra36znhrhpe3yzn7hrospm

PEPS2007 - Stochastic Automata Networks Software Tool

Leonardo Brenner, Paulo Fernandes, Brigitte Plateau, Ihab Sbeity
2007 Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007)  
PEPS is a tool package for modeling and solving models expressed in Stochastic Automata Networks (SAN).  ...  Transient Analysis PEPS2007 version brings a transient solution method based in the standard uniformization method [6] .  ...  Bounding algorithms [5] can be used in Markov Chains to obtain upper (or lower) bounds on performance. Bounding algorithms reduce the Markov chain transition matrix into a smaller monotone matrix.  ... 
doi:10.1109/qest.2007.33 dblp:conf/qest/BrennerFPS07 fatcat:dh7xuphhxfchtdcl27ht3btkc4

Transient Analysis of Networks of Stochastic Timed Automata Using Stochastic State Classes [chapter]

Paolo Ballarini, Nathalie Bertrand, András Horváth, Marco Paolieri, Enrico Vicario
2013 Lecture Notes in Computer Science  
Stochastic Timed Automata (STA) associate logical locations with continuous, generally distributed sojourn times.  ...  In this paper, we introduce Networks of Stochastic Timed Automata (NSTA), where the components interact with each other by message broadcasts.  ...  Given an initial stochastic state class Σ 0 , the enumeration of the transient tree Transient-Tree(Σ 0 ) within any time bound T terminates in a finite number of steps provided that every cycle of each  ... 
doi:10.1007/978-3-642-40196-1_30 fatcat:etyz4i7j5vhareoi6fhjhnwuta

Lyapunov operators to study the convergence of extremal automata

Eric Goles
1994 Theoretical Computer Science  
These operators allow us to characterize the steady state and to give bounds for the transient time.  ...  In this work we associate discrete Lyapunov operators to a class of automata networks called extremal automata.  ...  In this paper we study convergence and transient bounds for some extremal rules.  ... 
doi:10.1016/0304-3975(94)90255-0 fatcat:ufh253qoxfgrvk7lsvactsgr7i

A tight linear bound on the synchronization delay of bijective automata

Eugen Czeizler, Jarkko Kari
2007 Theoretical Computer Science  
Similar bounds are obtained also in [E. Czeizler, J.  ...  Kari, A tight linear bound on the neighborhood of inverse cellular automata, in: Proceedings of ICALP 2005, in: LNCS, vol. 3580, 2005, pp. 410-420] but here the result comes as a direct consequence of  ...  Hence, we prove our result first on automata without transient states and then we generalize. Proof.  ... 
doi:10.1016/j.tcs.2007.02.052 fatcat:syrfbtvwzrg3xb22jhqsxm2tby

Page 5793 of Mathematical Reviews Vol. , Issue 86m [page]

1986 Mathematical Reviews  
Author summary (translated from the Russian): “We introduce a classification of the possible behavior of automata with variable structure in transient and steady-state regimes.  ...  Precise bounds for t(z) and p(z) have been established in the literature for thresh- old, monotone and linear networks (see the collection of papers Dynamical systems and cellular automata |(Luminy, 1983  ... 

Cellular Automata for Elementary Image Enhancement

Gonzalo Hernández, Hans J. Herrmann
1996 Graphical Models and Image Processing  
In this context enhancement techniques appear decreasing functionals with the dynamics of the automata. as a natural requirement for noisy or blurred images as a Since tight bounds for the transient time  ...  For this reason various cellular automata algorithms In this work we study some cellular automata for elemenfor sharpening and smoothing are presented and studied in tary image enhancement.  ...  fixed points or two cycles and to give bounds for the transient time, which are not restoration, and reconstruction; and finally segmentation, description, and recognition.  ... 
doi:10.1006/gmip.1996.0006 fatcat:2snibu6hujb2xgh6a44hwt5soe

Fault Tolerance in Cellular Automata at High Fault Rates [article]

Mark McCann, Nicholas Pippenger
2007 arXiv   pre-print
We also obtain a lower bound of Ω(1/ξ^2), even with purely probabilistic transient faults only.  ...  A commonly used model for fault-tolerant computation is that of cellular automata.  ...  the transition functions need not be monotone or self-dual, and the automata need tolerate only purely probabilistic transient faults.  ... 
arXiv:0709.0967v1 fatcat:qv3wwnihtzfcniunxs56h4uj3i

Fault tolerance in cellular automata at high fault rates

Mark McCann, Nicholas Pippenger
2008 Journal of computer and system sciences (Print)  
We also obtain a lower bound of Ω(1/ξ 2 ), even with only purely probabilistic transient faults.  ...  A commonly used model for fault-tolerant computation is that of cellular automata.  ...  the transition functions need not be monotone or self-dual, and the automata need tolerate only purely probabilistic transient faults.  ... 
doi:10.1016/j.jcss.2008.02.003 fatcat:kwgw3imdpfdefk3wlx4fad2m7a

Page 1994 of Mathematical Reviews Vol. , Issue 84e [page]

1984 Mathematical Reviews  
This implies that both automata have the same transient and cyclic behaviour. Using a theorem proved by Goles and J. Olivos [Discrete Appl.  ...  Authors’ summary: “We study the length of the transient in a threshold automaton with values on the set {0,1}.  ... 

Dynamics of positive automata networks

E. Goles Ch
1985 Theoretical Computer Science  
With an important class of automata networks we associate a Lyapunov function and by doing so we characterize its dynamic behaviour (transient and cycle lengths).  ...  If (f~), i= 1,..., n are strictly positive and A is symmetric, then the transient length, T( F), is bounded as follows: =0 ife(F)=O, T(F) <~max{3, (EM-Em)/e(F)} otherwise. Proof.  ...  We can also give bounds on T(F).  ... 
doi:10.1016/0304-3975(85)90057-x fatcat:jyu6fglfobeojhjk3nk72iekcy

Page 4656 of Mathematical Reviews Vol. , Issue 89H [page]

1989 Mathematical Reviews  
They obtain a bound on the transient of the memory system.  ...  Transient and stationary behaviours correspond to surface and bulk properties.  ... 

Pint: A Static Analyzer for Transient Dynamics of Qualitative Networks with IPython Interface [chapter]

Loïc Paulevé
2017 Lecture Notes in Computer Science  
The software Pint is devoted to the scalable analysis of the traces of automata networks, which encompass Boolean and discrete networks.  ...  Pint implements formal approximations of transient reachabilityrelated properties, including mutation prediction and model reduction.  ...  Pint provides formal and scalable analysis for the transient discrete dynamics (traces/trajectories) of automata networks, which subsume Boolean and multivalued networks.  ... 
doi:10.1007/978-3-319-67471-1_20 fatcat:cykgyteznzerxgnwsibhe3ossq
« Previous Showing results 1 — 15 out of 4,642 results