2013
DOI: 10.1080/00207160.2013.767894
|View full text |Cite
|
Sign up to set email alerts
|

Updating method for the computation of orbits in parallel and sequential dynamical systems

Abstract: In this article, we provide a matrix method in order to compute orbits of parallel and sequential dynamical systems on Boolean functions. In this sense, we develop algorithms for systems defined over directed (and undirected) graphs when the evolution operator is a general minterm or maxterm and, likewise, when it is constituted by independent local Boolean functions, so providing a new tool for the study of orbits of these dynamical systems.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
13
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
8

Relationship

2
6

Authors

Journals

citations
Cited by 19 publications
(13 citation statements)
references
References 13 publications
0
13
0
Order By: Relevance
“…The interactions among elements of a phenomenon do typically not occur simultaneously. When it occurs, it is said that the model updates synchronously or parallelly (see [25,26,[28][29][30][31][32][33][34][35][36]); otherwise it is said that the model updates asynchronously or sequentially (see [20,27,[37][38][39][40][41]). In this last case, an update order is needed to specify the sequence in which the states of the elements evolve.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The interactions among elements of a phenomenon do typically not occur simultaneously. When it occurs, it is said that the model updates synchronously or parallelly (see [25,26,[28][29][30][31][32][33][34][35][36]); otherwise it is said that the model updates asynchronously or sequentially (see [20,27,[37][38][39][40][41]). In this last case, an update order is needed to specify the sequence in which the states of the elements evolve.…”
Section: Introductionmentioning
confidence: 99%
“…Given a SDS, the dynamics of the rest of the states can be obtained computationally by brute-force, using algorithms like those in [34,40]. But, unfortunately, the results in such computations are only valid for such a SDS.…”
Section: Introductionmentioning
confidence: 99%
“…However, it is not so easy to determine a priori the different coexistent periods of its orbits, because it depends fundamentally on the structure of the directed dependency graph. In this sense, in [90], algorithms for computing the (eventually) period of any orbit are given.…”
Section: Algorithms For the Computation Of Orbitsmentioning
confidence: 99%
“…Since the coexistence of periodic orbits depends on the number of entities, their connections, and the Boolean operator, several matrix algorithms for the computation of orbits in PDDS over directed dependency graph are developed in [90]. These algorithms constitute a new tool for the study of orbits of these dynamical systems.…”
Section: Algorithms For the Computation Of Orbitsmentioning
confidence: 99%
“…In [1,2,3,4,6,7,8,9,16] the reader can find a plethora of results on dynamical systems over particular graphs and updating functions. Linear systems together with a parallel update schedule, i.e.…”
Section: Introductionmentioning
confidence: 99%