Application-driven Challenges for Automata Networks and Complex Systems

Projektinformationen

ACANCOS

ID Finanzhilfevereinbarung: 101131549

DOI

10.3030/101131549

EK-Unterschriftsdatum 26 September 2023

Startdatum 1 Januar 2024

Enddatum 31 Dezember 2027

Finanziert unter

• Marie Skłodowska-Curie Actions (MSCA)

Gesamtkosten

Keine Daten

EU-Beitrag

€ 437 000,00

Koordiniert durch

UNIVERSITA' DEGLI STUDI DI MILANO-BICOCCA
Italy

Periodic Reporting for period 1 - ACANCOS (Application-driven Challenges for Automata Networks and Complex Systems)

Berichtszeitraum: 2024-01-01 bis 2025-12-31

Zusammenfassung vom Kontext und den Gesamtzielen des Projekts

The ACANCOS project aims to lay the foundation for a solid, and internationally competitive research, which is deeply rooted in a context of numerous prior collaborations (but non structured in an unique network on a worldwide scale) on modelling of complex systems by some formal models.
ACANCOS connects the scientific expertise and excellence of research groups from five countries, two of them outside EU, including experts from two distinct communities, from two distinct orientations (theory-oriented and application-oriented), and from two distinct disciplines (computer science, mathematics).

The scientific objectives of the project are:

- Increasing the knowledge on the relations among the formal description of the involved models and the dynamical behaviour they are able to exhibit;
- Understanding the sensitivity/robustness of the models when used in an asyncronous way;
- Understanding the capacity of these models to simulate the dynamical behaviour of other instances of the same model;
- Targeting and understanding wide subclasses of the models both exhibiting the complex behaviours of general models and with complex dynamical behaviours which can be established by some algorithm;
- Designing efficient algorithms establishing the above mentioned dynamical behaviours;
- Understanding the complexity of the problems of establishing the more significant complex behaviors;
- Models for new conceptualisation and modelling of Gene Regulatory Networks: theoretical validations and applicative validations on real Gene Regulatory Networks;
- New methods for data encryption based on the considered formal models

Sharing knowledge among different cultural and scientific environments will be crucial to achieve the scientific objectives of the project.

Arbeit, die ab Beginn des Projekts bis zum Ende des durch den Bericht erfassten Berichtszeitraums geleistet wurde, und die wichtigsten bis dahin erzielten Ergebnisse

WP2 (ongoing) The following tasks have been started and they are ongoing:

Task 2.1.“Investigate combinatorial and enumerative properties about the relationship between AN and their interaction graphs”. Task 2.2. “Investigate the computational complexity of several problems relating the complexity of the underlying graph, the update mode and the dynamical behaviour.” Task 2.3. “Contribute new ideas and results on what can be said on an AN and its dynamics when only partial information is provided over it.” Task 2.4. “Develop generic and systematic methods to deal with synchronous vs. asynchronous updating mode in AN”

The activities and the results focused on: 2-i) emphasising and proving combinatorial properties of block-sequential udpate digraphs; 2-ii) exhibiting a general formula characterising block-parallel update modes allowing to generate an exponential number of fixed points for automata networks whose interaction networks are positive cycles; 2-iii) providing results on the stability of threshold automata networks, by analyzing only their interaction graphs.

WP3 (ongoing) The following tasks have been started and they are ongoing:
Task 3.1 about “Contribute new results on the relationship between the dynamical behaviour of CA on finite and infinite lattices.” Task 3.2. Devise new classes of CA exhibiting complex dynamical behaviour (possibly both on the infinite and finite lattices) and decidable dynamics building on the experience acquired on additive CA and group CA. Task T3.4. Design efficient algorithms for decision problems on the dynamics of CA, especially for the classes which are going to be used in applications.
The activities and the results focused on 3-i) pursuing the classification of elementary cellular automata according to their asymptotic complexity when they are subjected to distinct families of periodic update modes; 3-ii) understanding the complexity of some prediction problems on the dynamics of a new class of CA (a special class of 2D non-uniform cellular automata generalizing classical CA) and pointing out the formal tools/concepts/algorithms which could be of help in such an investigation.
WP4 (ongoing) The following tasks have been started and they are ongoing:
T4.1: Collect and select valuable application examples from existing literature. Share the experience of CMM with all other partners.
The activities and the results focused on
Choice of literature papers relevant to the task. Discussion of possible paths of investigation. First details of the approach: using neural networks to discover secret rules of a CA used to encrypt data.

Fortschritte, die über den aktuellen Stand der Technik hinausgehen und voraussichtliche potenzielle Auswirkungen (einschließlich der bis dato erzielten sozioökonomischen Auswirkungen und weiter gefassten gesellschaftlichen Auswirkungen des Projekts)

Not applicable for now