Update schedules of sequential dynamical systems

Authors:
Reinhard Laubenbacher;Bodo Pareigis
Affiliations:
Virginia Bioinformatics Institute, 1880 Pratt Drive, Blacksburg, VA 24061, USA;Math. Inst. d. Universität München, Theresienstr. 39, 80333 München, Germany
Venue:
Discrete Applied Mathematics
Year:
2006

Citing 5
Cited 1

Regular Article: Acyclic Orientations of Random Graphs

Advances in Applied Mathematics
Elements of a theory of computer simulation I: sequential CA over random graphs

Applied Mathematics and Computation
Elements of a theory of simulation II: sequential dynamical systems

Applied Mathematics and Computation
Regular Article: Equivalence Relations on Finite Dynamical Systems

Advances in Applied Mathematics
Decomposition and simulation of sequential dynamical systems

Advances in Applied Mathematics

Computation of functions on n bits by asynchronous clocking of cellular automata

Natural Computing: an international journal

Quantified Score

Hi-index	0.05

Visualization

Abstract

Sequential dynamical systems have the property, that the updates of states of individual cells occur sequentially, so that the global update of the system depends on the order of the individual updates. This order is given by an order on the set of vertices of the dependency graph. It turns out that only a partial suborder is necessary to describe the global update. This paper defines and studies this partial order and its influence on the global update function.