Automata & WAN 2021
12-17 July 2021
We hope the events to take place physically,
but according to the covid-19 situation they may turn virtual.
In any case, even though we prefer to meet you physically, we plan to allow virtual presentations.
27th International Workshop on Cellular Automata and Discrete Complex Systems
Important dates (all in 2021)
- Submission deadline full papers: February 19th
- Notification of acceptance full papers: March 31th
Final version full papers: April 13th
- Submission deadline exploratory papers: May 5th
- Notification of acceptance exploratory papers: May 19th
Final versions of exploratory papers: May 26th
- Early registration (room booking at CIRM guaranteed): May 24th
Final registration deadline (room booking at CIRM subject to availability): July 5th
- Conference: July 12-14
Full papers will be published in the OASIcs series by Schloss Dagstuhl.
Exploratory papers will be published in local proceedings
uploaded to HAL.
See the submission page for instructions.
A special issue, collecting extended and improved versions of selected papers presented at the conference, will be published in a journal.
AUTOMATA 2021 is the twenty-seventh workshop in a series of events established in 1995.
These workshops aim to:
- Establish and maintain a permanent, international, multidisciplinary
forum for the collaboration of researchers in the field of Cellular Automata (CA)
and Discrete Complex Systems (DCS).
- Provide a platform for presenting and discussing new ideas and results.
- Support the development of theory and applications of CA and DCS
(e.g. parallel computing, physics, biology, social sciences, and others)
as long as fundamental aspects and their relations are concerned.
- Identify and study within an inter- and multidisciplinary context,
the important fundamental aspects, concepts, notions and problems concerning CA and DCS.
The AUTOMATA series is the official annual event of IFIP WG 1.5,
the Working Group 5 (on Cellular Automata and Discrete Complex Systems),
of the Technical Committee 1 (on Foundations of Computer Science),
of the International Federation for Information Processing (IFIP).
Scope (not exhaustive):
- dynamical, topological, ergodic and algebraic aspects of CA and DCS
- algorithmic and complexity issues
- emergent properties
- formal languages
- symbolic dynamics
- models of parallelism and distributed systems
- synchronous versus asynchronous models
- phenomenological descriptions and scientific modelling
- applications of CA and DCS
- Alonso Castillo Ramírez (Universidad de Guadalajara, Mexico) — co-chair
- Pierre Guillon (CNRS & Université d’Aix-Marseille, France) — co-chair
- Nathalie Aubrun (CNRS & Université Paris-Saclay, France)
- Jan Baetens (Ghent University, Belgium)
- Pedro Balbi de Oliveira (Universidade Presbiteriana Mackenzie, Brazil)
- Tullio Ceccherini-Silberstein (Università del Sannio, Italia)
- Alberto Dennunzio (Università di Milano Bicocca, Italia)
- Jeremias Epperlein (Universität Passau, Deutschland)
- Terry Farrelly (University of Queensland, Australia)
- Nazim Fatès (INRIA & Université de Lorraine, France)
- Enrico Formenti (Université de Nice-Côte-d’Azur, France)
- Anahí Gajardo (Universidad de Concepción, Chile)
- Janko Gravner (University of California Davis, US)
- Nataša Jonoska (University of South Florida, US)
- Jarkko Kari (University of Turku, Finland)
- Johan Kopra (University of Turku, Finland)
- Martin Kutrib (Universität Giessen, Deutschland)
- Kenichi Morita (University of Hiroshima, Japan)
- Kévin Perrot (Université d’Aix-Marseille, France)
- Trent Rogers (University of Arkansas, US)
- Véronique Terrier (Université de Caen-Normandie, France)
- Guillaume Theyssier (CNRS & Université d’Aix-Marseille, France)
- Thomas Worsch (Karlsruhe Institute of Technology, Deutschland)
- Reem Yassawi (Open University, UK)
Workshop on Automata Networks
The workshop will be held on 14-17 July, starting with a day in common with Automata 2021, which will be the opportunity to celebrate Eric Goles’s 70th birthday.
This workshop aims at bringing together, favoring exchanges and working together, through oral scientific presentations and joint thematic working sessions, the community that studies automata networks, from the perspective of mathematics and computer science.
This will notably be the place to take stock of recent advances in the field, and to identify open questions and inspire the community with promising theoretical and applied research directions.
From a general point of view, automata networks are discrete dynamical systems informally defined as sets of entities (the automata) – whose local states are discrete – that interact with each other over discrete time.
In that way, cellular automata are particular automata networks so that the automata (the cells) are distributed into a regular topology, namely a cellular space.
From a more applied point of view, automata networks are often considered and studied as finite dynamical systems.
In this framework, they have been central in many works related to the modelling of complex systems, as communication networks, particle interaction networks, regulation networks, and social networks.
Whatever vision we have of automata networks, their study is a booming field, both in the most theoretical aspects and in those closer to applications.
This is because they are fundamental for two reasons (mainly):
- their definition, and its intrinsic simplicity, which integrates the just necessary and allows you to focus on the essence of interactions (transmission of information);
- their ability to capture behavioral richness (and associated complexities) of the systems they model.
Among the central themes at the fundamental and applied levels are:
- links between static and dynamical characteristics;
- organisation of time and updating;
- importance of feedback and (non-)convergence;
- convergence time and behavioral optimization;
- modularity / compositionality.
Of course, this list is not exhaustive.
All oral contributions are made on the basis of invitations from the scientific committee. Participation to the workshop is free of charge but requires prior registration (more information will be available soon).
To be announced