Discrete dynamical systems (DDS) are a useful tool for modelling the dynamical behavior of many phenomena occurring in a huge variety of scientific domains. Boolean automata networks, genetic regulation networks, and metabolic networks are just a few examples of DDS used in Bioinformatics. Equations over DDS have been introduced as a formal tool to check the model against experimental data. Solving generic equations over DDS has been proved undecidable. In this paper we propose to solve a decidable abstraction which consists in equations having a constant part. The abstraction we focus on consists in restricting the solutions to equations involving only the periodic behavior of DDS. We provide a fast and scalable method to solve such abstractions.
Dennunzio, A., Formenti, E., Margara, L., Montmirail, V., Riva, S. (2020). Solving Equations on Discrete Dynamical Systems [10.1007/978-3-030-63061-4_12].
Solving Equations on Discrete Dynamical Systems
Margara, Luciano;
2020
Abstract
Discrete dynamical systems (DDS) are a useful tool for modelling the dynamical behavior of many phenomena occurring in a huge variety of scientific domains. Boolean automata networks, genetic regulation networks, and metabolic networks are just a few examples of DDS used in Bioinformatics. Equations over DDS have been introduced as a formal tool to check the model against experimental data. Solving generic equations over DDS has been proved undecidable. In this paper we propose to solve a decidable abstraction which consists in equations having a constant part. The abstraction we focus on consists in restricting the solutions to equations involving only the periodic behavior of DDS. We provide a fast and scalable method to solve such abstractions.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
