%0 Conference Proceedings
%T Counter Machines and Distributed Automata
%+ Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243))
%+ Università degli Studi di Milano = University of Milan (UNIMI)
%+ Laboratoire Spécification et Vérification [Cachan] (LSV)
%A Carton, Olivier
%A Guillon, Bruno
%A Reiter, Fabian
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 24th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA)
%C Ghent, Belgium
%Y Jan M. Baetens
%Y Martin Kutrib
%I Springer International Publishing
%3 Cellular Automata and Discrete Complex Systems
%V LNCS-10875
%P 13-28
%8 2018-06-20
%D 2018
%R 10.1007/978-3-319-92675-9_2
%Z Computer Science [cs]Conference papers
%X We prove the equivalence of two classes of counter machines and one class of distributed automata. Our counter machines operate on finite words, which they read from left to right while incrementing or decrementing a fixed number of counters. The two classes differ in the extra features they offer: one allows to copy counter values, whereas the other allows to compute copyless sums of counters. Our distributed automata, on the other hand, operate on directed path graphs that represent words. All nodes of a path synchronously execute the same finite-state machine, whose state diagram must be acyclic except for self-loops, and each node receives as input the state of its direct predecessor. These devices form a subclass of linear-time one-way cellular automata.
%G English
%Z TC 1
%Z WG 1.5
%2 https://inria.hal.science/hal-01824873/document
%2 https://inria.hal.science/hal-01824873/file/469010_1_En_2_Chapter.pdf
%L hal-01824873
%U https://inria.hal.science/hal-01824873
%~ UNIV-PARIS7
%~ CNRS
%~ ENS-CACHAN
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ USPC
%~ IFIP-WG1-5
%~ IFIP-AUTOMATA
%~ UNIV-PARIS-SACLAY
%~ ENS-CACHAN-SACLAY
%~ IFIP-LNCS-10875
%~ UNIV-PARIS
%~ UP-SCIENCES
%~ ANR
%~ LSV-AUTO
%~ FARMAN
%~ ENS-PARIS-SACLAY
%~ GS-COMPUTER-SCIENCE
%~ LMF
%~ IRIF