A Field Based Solution of Mazoyer's FSSP Schema

Abstract : Continuing our line of work on field based cellular automata programming we, here, focus our attention on an implementation of Ma-zoyer's schema for cellular synchronization problem. Due to its very special nature among the numerous solutions to the problem, we emphasize the power of cellular fields to construct cellular programs: clear semantic construction, modularity, automatic synthesis of finite state machines.
Type de document :
Communication dans un congrès
Samira El Yacoubi, Jaroslaw Wąs, Stefania Bandini. Cellular Automata - 12th International Conference on Cellular Automata for Research and Industry, ACRI 2016, Fez, Morocco, September 5-8, 2016. Proceedings, 2016, Fez, Morocco. pp.134--143, 2016, Cellular Automata. 〈10.1007/978-3-319-44365-2_13〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01799306
Contributeur : Luidnel Maignan <>
Soumis le : jeudi 24 mai 2018 - 15:31:07
Dernière modification le : jeudi 15 novembre 2018 - 20:27:45

Identifiants

Collections

Citation

Luidnel Maignan, Jean-Baptiste Yunès. A Field Based Solution of Mazoyer's FSSP Schema. Samira El Yacoubi, Jaroslaw Wąs, Stefania Bandini. Cellular Automata - 12th International Conference on Cellular Automata for Research and Industry, ACRI 2016, Fez, Morocco, September 5-8, 2016. Proceedings, 2016, Fez, Morocco. pp.134--143, 2016, Cellular Automata. 〈10.1007/978-3-319-44365-2_13〉. 〈hal-01799306〉

Partager

Métriques

Consultations de la notice

34