Zobrazeno 1 - 10
of 64
pro vyhledávání: '"Riva, Sara"'
Publikováno v:
LNCS 14782 (2024) 120-132
Finite discrete-time dynamical systems (FDDS) model phenomena that evolve deterministically in discrete time. It is possible to define sum and product operations on these systems (disjoint union and direct product, respectively) giving a commutative
Externí odkaz:
http://arxiv.org/abs/2405.09236
Boolean networks are extensively applied as models of complex dynamical systems, aiming at capturing essential features related to causality and synchronicity of the state changes of components along time. Dynamics of Boolean networks result from the
Externí odkaz:
http://arxiv.org/abs/2404.03553
Endowing the set of functional graphs (FGs) with the sum (disjoint union of graphs) and product (standard direct product on graphs) operations induces on FGs a structure of a commutative semiring R. The operations on R can be naturally extended to th
Externí odkaz:
http://arxiv.org/abs/2402.16923
Minimal trap spaces (MTSs) capture subspaces in which the Boolean dynamics is trapped, whatever the update mode. They correspond to the attractors of the most permissive mode. Due to their versatility, the computation of MTSs has recently gained trac
Externí odkaz:
http://arxiv.org/abs/2305.02442
This paper provides an algorithmic pipeline for studying the intrinsic structure of a finite discrete dynamical system (DDS) modelling an evolving phenomenon. Here, by intrinsic structure we mean, regarding the dynamics of the DDS under observation,
Externí odkaz:
http://arxiv.org/abs/2211.05038
Functional graphs (FGs) model the graph structures used to analyse the behaviour of functions from a discrete set to itself. In turn, such functions are used to study real complex phenomena evolving in time. As the systems involved can be quite large
Externí odkaz:
http://arxiv.org/abs/2208.08310
Publikováno v:
In Theoretical Computer Science 12 June 2024 999
Publikováno v:
In Emotion, Space and Society February 2024 50
In [11] and [13] the authors showed that elementary cellular automata rules 0, 3, 8, 12, 15, 28, 32, 34, 44, 51, 60, 128, 136, 140, 160, 162, 170, 200 and 204 (and their conjugation, reflection, reflected-conjugation) are not maximum sensitive to syn
Externí odkaz:
http://arxiv.org/abs/2004.07128