Efficient simulation of synchronous systems by multi-speed systems
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 39 (2005) no. 2, pp. 403-419.

We consider systems consisting of finite automata communicating by exchanging messages and working on the same read-only data. We investigate the situation in which the automata work with constant but different speeds. We assume furthermore that the automata are not aware of the speeds and they cannot measure them directly. Nevertheless, the automata have to compute a correct output. We call this model multi-speed systems of finite automata. Complexity measure that we consider here is the number of messages sent by the automata. The main result of this paper is that multi-speed systems are as powerful as synchronous systems, in which all automata work with the same speed.

DOI : 10.1051/ita:2005025
Classification : 03D15, 68Q45
Mots-clés : multi-head automata, systems of finite automata, communication complexity, message complexity 
@article{ITA_2005__39_2_403_0,
     author = {Jurdzi\'nski, Tomasz and Kuty{\l}owski, Miros{\l}aw and Zatopia\'nski, Jan},
     title = {Efficient simulation of synchronous systems by multi-speed systems},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {403--419},
     publisher = {EDP-Sciences},
     volume = {39},
     number = {2},
     year = {2005},
     doi = {10.1051/ita:2005025},
     zbl = {1133.68363},
     language = {en},
     url = {http://archive.numdam.org/articles/10.1051/ita:2005025/}
}
TY  - JOUR
AU  - Jurdziński, Tomasz
AU  - Kutyłowski, Mirosław
AU  - Zatopiański, Jan
TI  - Efficient simulation of synchronous systems by multi-speed systems
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2005
SP  - 403
EP  - 419
VL  - 39
IS  - 2
PB  - EDP-Sciences
UR  - http://archive.numdam.org/articles/10.1051/ita:2005025/
DO  - 10.1051/ita:2005025
LA  - en
ID  - ITA_2005__39_2_403_0
ER  - 
%0 Journal Article
%A Jurdziński, Tomasz
%A Kutyłowski, Mirosław
%A Zatopiański, Jan
%T Efficient simulation of synchronous systems by multi-speed systems
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2005
%P 403-419
%V 39
%N 2
%I EDP-Sciences
%U http://archive.numdam.org/articles/10.1051/ita:2005025/
%R 10.1051/ita:2005025
%G en
%F ITA_2005__39_2_403_0
Jurdziński, Tomasz; Kutyłowski, Mirosław; Zatopiański, Jan. Efficient simulation of synchronous systems by multi-speed systems. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 39 (2005) no. 2, pp. 403-419. doi : 10.1051/ita:2005025. http://archive.numdam.org/articles/10.1051/ita:2005025/

[1] A. Borodin and S. Cook, A time-space tradeoff for sorting on a general sequential model of computation. SIAM J. Comput. 11 (1982) 287-297. | Zbl

[2] P. Beame, M. Tompa and P. Yan, Communication-space tradeoffs for unrestricted protocols. SIAM J. Comput. 23 (1994) 652-661. | Zbl

[3] T. Jurdziński and M. Kutyłowski, Communication gap for finite memory devices. Automata, Languages and Programming, in Proc. ICALP'2001. Lect. Notes Comput. Sci. 2076 (2001) 1052-1064. | Zbl

[4] T. Jurdziński, K. Kutyłowski and K. Loryś, Multi-party finite computations. Computing and Combinatorics, in Proc. COCOON '99. Lect. Notes Comput. Sci. 1627 (1999) 318-329. | Zbl

[5] T. Jurdziński, M. Kutyłowski, P. Rzechonek and J. Zatopiański, Communication complexity for multi-speed cooperation automata. I Konferencja Młodych Matematyków, Oficyna Wydawnicza Politechniki Wrocławskiej (2001). | Zbl

[6] T. Jurdziński, M. Kutyłowski and J. Zatopiański, Communication complexity for asynchronous systems of finite devices, in Proc. 15th International Parallel & Distributed Processing Symposium (IPDPS-01), Los Alamitos, CA, April 23-27. IEEE Comput. Soci. (2001) 139.

[7] V. Mitrana and C. Martin-Vide, Some undecidable problems for parallel communicating finite automata systems. Inform. Proc. Lett. 77 (2001) 239-245. | Zbl

[8] V. Mitrana, On the degree of communication in parallel communicating finite automata systems. IWDCAGRS: Proc. International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures, Otto-von-Guericke Universität (1999) 155-165.

[9] J. Zatopiański, Computational complexity of limited memory systems. Ph.D. Thesis, Institute of Electronics, Wrocław University of Technology, Wrocław (2002).

Cité par Sources :