activity
20192026
most citedOn solving basic equations over the semiring of functional digraphs

3 citations · 8 across the 9 of their papers we have counts for

collaborators

10 papers

cs.DM2026

Solving polynomial equations over partial discrete dynamical systems

Maximilien Gadouleau, Sara Riva, Marius Rolland +1

The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviours. If the conditions are ideal and the number of observations…

cs.DM2026

Abstract Simulation of Reaction Networks

Marie-Eva Fabri, Joachim Niehren, Sara Riva +1

Reaction networks model reactions between a finite set of species. These networks can be associated with different semantics, depending on the type of analysis and the phenomena un…

cs.DM2024★ 1 cited

Roots in the semiring of finite deterministic dynamical systems

François Doré, Kévin Perrot, Antonio E. Porreca +2

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 (…

cs.LO2024★ 1 cited

Bringing memory to Boolean networks: a unifying framework

Maximilien Gadouleau, Loïc Paulevé, Sara Riva

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…

cs.DM2024★ 3 cited

On solving basic equations over the semiring of functional digraphs

Alberto Dennunzio, Enrico Formenti, Luciano Margara +1

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 commu…

cs.LO2023★ 2 cited

Tackling Universal Properties of Minimal Trap Spaces of Boolean Networks

Sara Riva, Jean-Marie Lagniez, Gustavo Magaña López +1

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…

math.DS2022

An Algorithmic Pipeline for Solving Equations over Discrete Dynamical Systems Modelling Hypothesis on Real Phenomena

Alberto Dennunzio, Enrico Formenti, Luciano Margara +1

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 st…

math.DS2022

Decomposition and factorisation of transients in Functional Graphs

François Doré, Enrico Formenti, Antonio E. Porreca +1

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…

cs.FL2020★ 1 cited

Non-maximal sensitivity to synchronism in periodic elementary cellular automata: exact asymptotic measures

Pedro P. B. de Oliveira, Enrico Formenti, Kévin Perrot +2

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 conjugatio…

math.DS2019

Solving Equations on Discrete Dynamical Systems (Extended version)

Alberto Dennunzio, Enrico Formenti, Luciano Margara +2

Boolean automata networks, genetic regulation networks, and metabolic networks are just a few examples of biological modelling by discrete dynamical systems (DDS). A major issue in…