Cellular Automata : 15th International Conference on Cellular Automata for Research and Industry, ACRI 2022, Geneva, Switzerland, September 12–15, 2022, Proceedings / edited by Bastien Chopard, Stefania Bandini, Alberto Dennunzio, Mira Arabi Haddad.

Format:

Book

Contributor:

Chopard, Bastien, editor.

Series:

Lecture Notes in Computer Science, 1611-3349 ; 13402

Language:

English

Subjects (All):

Computer science.

Application software.

Computer engineering.

Computer networks.

Data structures (Computer science).

Information theory.

Theory of Computation.

Computer and Information Systems Applications.

Computer Engineering and Networks.

Data Structures and Information Theory.

Local Subjects:

Theory of Computation.

Computer and Information Systems Applications.

Computer Engineering and Networks.

Data Structures and Information Theory.

Physical Description:

1 online resource (373 pages)

Edition:

1st ed. 2022.

Place of Publication:

Cham : Springer International Publishing : Imprint: Springer, 2022.

Summary:

This book constitutes the refereed proceedings of the 15th International Conference on Cellular Automata for Research and Industry, ACRI 2022, which took place in Geneva, Switzerland, in September 2022. The 31 full papers presented in this volume were carefully reviewed and selected from 36 submissions. They were organized in topical sections named: Theory; Modelling and simulation physical systems and phenomena; Cellular automata and spreading dynamics; Crowds, pedestrian and traffic dynamics; Other studies on cellular automata.

Contents:

Intro

Preface

Organization

Contents

Cellular Automata Tutoring

Cellular Automata Application on Chemical Computing Logic Circuits

1 Introduction

2 Methods for Simulation of Chemical Gates

3 Results

4 Conclusions

References

Theory

Exploring Lightweight S-boxes Using Cellular Automata and Reinforcement Learning

2 Cellular Automata

3 Substitution Boxes (S-boxes)

3.1 Nonlinearity

3.2 Differential Uniformity

4 Semi-bent Boolean Functions

5 Reinforcement Learning

6 Our Design

6.1 Boolean Functions

6.2 Substitution Box

6.3 Reinforcement Learning

7 Results

8 Conclusion and Future Work

A Appendix

Identification of Periodic Boundary SACA Rules Exploring NSRT Diagram

2 Preliminaries of Cellular Automata

3 NSRTD

4 SACA Rules

5 Conclusion

A Cellular Automata Based Fault Resistant MICKEY-Like Stream Cipher

2 Preliminaries

2.1 MICKEY-Mutual Irregular Clocking KEYstream Generator

2.2 Cellular Automata - An Overview

3 Proposed Cipher - CA Based MICKEY

4 Design Rationale

4.1 Selection of Hybrid CA Rules

5 Security Analysis and Resistance of CA Based MICKEY to DFA

5.1 Differential Fault Attack on MICKEY

6 Software Implementation and Results

7 Conclusion and Future Work

On the Linear Components Space of S-boxes Generated by Orthogonal Cellular Automata

2 Basic Definitions

2.1 Cryptographic Boolean Functions and S-boxes

2.2 Orthogonal CA

3 S-boxes Based on OCA

4 Polynomial Codes from Linear Components Spaces

5 Conclusions

The Structure of Configurations in One-Dimensional Majority Cellular Automata: From Cell Stability to Configuration Periodicity

1.1 Organization.

2 Preliminaries

2.1 The Majority Rule with Radius r

2.2 Temporal and Spatial Periodicity

3 Our Main Result and the Notion of Cell Stability

3.1 Illustrating Theorem 1 for r = 1, 2, 3

4 The Alignment Mapping (High-Level Idea)

5 Related Work

Synchronisation of Elementary Cellular Automata with a Small Initial Error. Application to Rule 18

2 Influence of Initial Error on Synchronization

3 Modeling of the Error Spreading Dynamics

4 Optimization of Algorithm for a Single Erroneous Cell

5 Conclusion and Perspectives

Millions of 5-State n3-Real Time Sequence Generators via Local Simulations

1.1 Local Mappings to Explore the Cellular Solution Space

1.2 Real-Time Sequence Generation Problems

1.3 Organization of the Content

2.1 Cellular Automata, Local Mappings, and Local Simulations

2.2 Real-Time Sequence Generators

3 Exploring RTSG Solutions via Local Mappings

3.1 Compliant Local Mappings

3.2 A Hand-Crafted Local Simulation

3.3 Optimizing Through Millions of Solutions

3.4 Beyond RTSG and FSSP Optimizations

4 Conclusion

System Reduction: An Approach Based on Probabilistic Cellular Automata

2 Problem Formulation

3 Coarse Graining Procedure

4 Example

5 Reduced Voter Model

5.1 Description of the Model

5.2 Transition Probabilities for a 1D Circular Graph Voter Model

5.3 The Transition Function

5.4 Simulation of a Controlled Situation

6 Conclusions

Lyapunov Profiles of Three-State Totalistic Cellular Automata

2 Lyapunov Profiles of Cellular Automata

2.1 Preliminaries

2.2 Two-State CA

2.3 Three-State CAs

3 Results and Discussion

3.1 Experimental Setup

3.2 Class I

3.3 Class II

3.4 Class III.

3.5 Class IV

Modelling and Simulation of Physical Systems and Phenomena

Evolving Quantum Circuits to Implement Stochastic and Deterministic Cellular Automata Rules

1 Scope and Motivation

2 The Genetic Algorithm to Evolve Quantum Circuits

3 Three Different ``Flavours'' of Quantum Cellular Automata

3.1 The Quantum Cousin of a Stochastic Critical Cellular Automata

3.2 The Two Other Flavours: Deterministic CA and Stochastic CA but Non-critical

4 Discussion and Conclusions

Double Population Lattice Boltzmann Model for Magneto-Hydrodynamic Blood Flow in Stenotic Artery

2 Mathematical Model

2.1 Problem Description

2.2 Equations

3 Numerical Model

3.1 Lattice Boltzmann Method with Single Relaxation Time (LBM-SRT)

3.2 Boundary Conditions

3.3 Bounce Back

4 Model Validation

5 Results and Discussion

6 Conclusion

Four State Deterministic Cellular Automaton Rule Emulating Random Diffusion

2 Construction of the Rule

3 Experiments

4 Two-Dimensional Rule

The Evolution of Vermicular Structures and Sintering Behavior of Alumina

2 The Cellular Automaton Model

2.1 The Interface Energy

2.2 Transition Probabilities

3.1 The Total Interface Energy

3.2 Vermicular Structures

3.3 A Measure of the Porosity

A Cellular Automaton Model of a Laser with Saturable Absorber Reproducing Laser Passive Q-switching

2 Laser Rate Equations

3 A Cellular Automata Model for a Laser with a Saturable Absorber

4 Results

4.1 Dependence with the Pumping Probability R1

4.2 Dependence with R2

4.3 The Effect of the Density of the Absorber

References.

Modeling Phase Change Materials Using Cellular Automata

2 Model Description

2.1 Phenomenon Description

2.2 Cellular Automata for Phase Change Phenomenon

3 Simulation

3.1 Model Evaluation

3.2 Simulation Results

4 Conclusion and Perspectives

Performance Analysis of Regular Clocking Based Quantum-Dot Cellular Automata Logic Circuit: Fault Tolerant Approach

2 Background and Related Work

2.1 QCA Basic

2.2 Regular Clocking

2.3 QCA Defects

3 Analysis of Fault Tolerant Capability of Underlying Clocking Schemes

3.1 Analysis Using HDLQ

3.2 Analysis Using QCADesigner

4 Discussion

Idea of Cellular Automata Application in Two-Slit Experiments

2 Description of a Two Dimensional Computer Experiment with Cellular Automata

2.1 Geometry of the Binary Cellular Automata

2.2 Dynamic Rules for Cell States

2.3 Frequency Principle of Experimental Processing

3 Results of Computational Experiments

4 Anticipation Based Cellular Automata for Two-Slit Experiments

4.1 Definition of Anticipation

4.2 Anticipating in an Cellular Automata Model

4.3 Computational Experiments with Cellular Automata with Anticipating

Towards Self-optimizing Sensor Networks: Game-Theoretic Second-Order CA-Based Approach

2 Sensor Networks: Coverage and Lifetime Problems

3 Multi-agent System for WSN Coverage and Lifetime Optimization

4 Collective Behavior of Second-Order CA-Based Players in Spatial Prisoner's Dilemma Game

5 Coverage and Lifetime Optimization: Spatial PD Game with the Use of a Second-Order CA

Cellular Automata and Spreading Dynamics.

Spreadability and Vulnerability via Attributes for Systems Described by Cellular Automata: Application to Wildfire

2 CA, Spreadability and Vulnerability

2.1 Attributes-Based CA

2.2 Original Spreadability and Vulnerability

2.3 Spreadability via Attributes

2.4 Vulnerability via Attributes

2.5 Vulnerability Indexes via Attributes

3 Case Study: Forest Fire Modelling

3.1 Model Description

3.2 Wildfire Spreadability

3.3 Wildfire Vulnerability

Automatic Evolutionary Adjustment of Cellular Automata Model for Forest Fire Propagation

2 Related Work

3 Proposed Model for Forest Fire Simulation

4 Evolutionary Approach to Adjust the Model Parameters

5 Experiments

6 Final Considerations

Wildfire Simulation Model Based on Cellular Automata and Stochastic Rules

2 Related Works

3 Model Description

4 Simulations and Analyses

5 Conclusion and Future Work

Crowds, Pedestrian, and Traffic Dynamics

Integrating the Implications of Distance-Based Affective States in Cellular Automata Pedestrian Simulation

2 Affective State Design: Data from Experiments

3 1D CA Model

3.1 Implementation and Results

4 2D CA Model

4.1 Implementation

4.2 Preliminary Results

Density Estimates in Cellular Automata Models of Pedestrian Dynamics

1.1 Quantities

1.2 Data-Driven Study

2 Concept and Definitions

2.1 Type of Kernels

2.2 Smoothing Techniques

3 Illustrations and Analysis

3.1 Similarity to Point Approximation

3.2 Alternatives of Voronoi Diagram

Maximum Traffic Flow Patterns in Interacting Autonomous Vehicles

2 The Speed Regulator.

3 Analysis of the Flow.

Notes:

Includes bibliographical references and index.

Other Format:

Print version: Chopard, Bastien Cellular Automata

ISBN:

3-031-14926-2

OCLC:

1341282308