Campus Peñalolen · Av. Diagonal Las Torres 2640,  Peñalolén,  Santiago (Chile). 


Current positions.

2022-present Assistant Professor, Faculty of Engineering and Sciences, Universidad Adolfo Ibáñez. 

2021-2022 Postdoc at Faculty of Engineering and Sciences, Universidad Adolfo Ibáñez. 


PhD. thesis

On automata networks dynamics: an approach based on computational complexity theory.

Alejandro Maass - Eric Goles (Chile) / Sylvain Sené - Guillaume Theyssier (France)


An automata network (AN) is a network of entities, each holding a state from a finite set and related by a graph structure called an interaction graph. Each node evolves according to the states of its neighbors in the interaction graph, defining a discrete dynamical system. This thesis work explores two main questions: a) what is the link between dynamical and computational properties of an AN? and b) what is the impact of the interaction graph topology on the global dynamics of an AN?. In order to tackle the first question a notion of computational complexity of an AN family is defined in terms of the computational complexity of decision problems related to the dynamics of the network. On the other hand, the dynamical complexity of a particular AN family is defined in terms of the existence of attractors of exponential period. A strong link between these two last definitions is presented in terms of the notion of simulation between AN families. In this context, complexity is characterized from a localized standpoint by studying the existence of structures called coherent gadgets which satisfy two properties: i) they can locally interact in a coherent way as dynamical systems and ii) they are capable of simulating a finite set of functions defined over a fixed finite set. Finally, the second question is addressed in the context of a well-known family called freezing automata networks. An AN is freezing if there is an order on states such that the state evolution of any node is non-decreasing in any orbit. A general model checking problem capturing many classical decision problems is presented. In addition, when three graph parameters, the maximum degree, the treewidth and the alphabet size are bounded, a fast-parallel algorithm that solves general model checking problem is presented. Moreover, it is shown that the latter problem is unlikely to be fixed-parameter tractable on the treewidth parameter as well as on the alphabet size when considered as single parameters.

Keywords: discrete math - dynamical systems - computational complexity - complex systems - automata networks - systems biology.


Articles in Journals

Articles in Conference Proceedings

Book chapters





Organizing XVIII Escuela de Verano en Matemáticas Discretas

Organizing the Workshop The Automata Factory 4

Organizing  the Workshop Escuela Predoctoral DISC 2021

Organizing Committee of the workshop The Automata Factory 3 3 (2020)

Grants and Awards