Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

1
31
0

Year Published

2013
2013
2013
2013

Publication Types

Select...
2

Relationship

2
0

Authors

Journals

citations
Cited by 21 publications
references
References 18 publications
1
31
0
Order By: Relevance
“…In a previous paper [2], for PDSs over digraphs corresponding to the simplest Boolean functions AND and OR, we proved that only fixed or eventually fixed points appear, as it occurs over undirected dependency graphs. Nevertheless, for general Boolean functions, it was shown that any periodic orbit can exist, depending on both the Boolean function that infer the global evolution operator of the system and on the structure of the dependency digraph.…”
Section: Introductionmentioning
confidence: 95%
“…In a previous paper [2], for PDSs over digraphs corresponding to the simplest Boolean functions AND and OR, we proved that only fixed or eventually fixed points appear, as it occurs over undirected dependency graphs. Nevertheless, for general Boolean functions, it was shown that any periodic orbit can exist, depending on both the Boolean function that infer the global evolution operator of the system and on the structure of the dependency digraph.…”
Section: Introductionmentioning
confidence: 95%
“…In our particular case, as the state space of the system is finite, every orbit is periodic or eventually periodic. Nevertheless, taking into account the mentioned results in [2,3], determining analytically a priori the different coexistent periods of its orbits is impossible for an arbitrary system, since it depends both on the dependency graph and on the evolution operator.…”
Section: Introductionmentioning
confidence: 98%
“…In a previous work [2], the authors proved that PDS over directed dependency graphs can present periodic orbits of any period when the evolution operators are general maxterms or minterms. This situation totally differs from the case of PDS over undirected dependency graphs, where only (eventually) fixed points or 2-periodic orbits can exist.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations