Some old and recent results on automata networks and update modes

Báo cáo viên: Prof. Sylvain Sené (Université de Marseille, France)

Thời gian: 14h chiều Thứ 5, ngày 19/11/2026

Địa điểm: Phòng 507 nhà A6

Tóm tắt: An automata network is classically defined as a set of entities (the automata) which interact with each other over discrete time. More formally, an automata network composed of n automata is a collection of n local functions which define how each automaton computes its state based on the states of those influencing it. Research on these objects has shown that, given an automata network, distinct dynamics can be associated with it depending on how the updates of the automaton states are organized over time (i.e., the update modes). By restricting ourselves to Boolean networks and periodic update modes, we will discuss in this presentation some of the main results highlighting the importance of not ignoring update modes when studying automata networks, whether in the computational context or in the modeling context.

Hoạt động tuần Xem tất cả

Hội thảo sắp diễn ra

Xem tất cả

Chưa có hội nghị/hội thảo sắp diễn ra.

Xuất bản mới

Xem tất cả
Đỗ Duy Hiếu, Block-pair edge community detection in bipartite networks via an adaptive spectral-modularity framework, Computational and Mathematical Organization Theory, Volume 32, article number 31 (2026)
Nguyễn Thị Vân Hằng, Felipe Lara, Nguyễn Đông Yên, Discontinuous strongly quasiconvex functions, Journal of Optimization Theory and Applications 210 (2026), Paper No. 40, 18 pp

Bài giảng viện

Xem tất cả
Periods and exponential periods

Người báo cáo: Claude Sabbah (CNRS, École Polytechnique, Institut Polytechnique de Paris, France)