# Efficient simulation of synchronous systems by multi-speed systems

Tomasz Jurdziński; Mirosław Kutyłowski; Jan Zatopiański

RAIRO - Theoretical Informatics and Applications (2010)

- Volume: 39, Issue: 2, page 403-419
- ISSN: 0988-3754

## Access Full Article

top## Abstract

top## How to cite

topJurdziński, Tomasz, Kutyłowski, Mirosław, and Zatopiański, Jan. "Efficient simulation of synchronous systems by multi-speed systems." RAIRO - Theoretical Informatics and Applications 39.2 (2010): 403-419. <http://eudml.org/doc/92773>.

@article{Jurdziński2010,

abstract = {
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.
},

author = {Jurdziński, Tomasz, Kutyłowski, Mirosław, Zatopiański, Jan},

journal = {RAIRO - Theoretical Informatics and Applications},

keywords = {Multi-head automata; systems of finite automata;
communication complexity;
message complexity; multi-head automata; communication complexity; message complexity},

language = {eng},

month = {3},

number = {2},

pages = {403-419},

publisher = {EDP Sciences},

title = {Efficient simulation of synchronous systems by multi-speed systems},

url = {http://eudml.org/doc/92773},

volume = {39},

year = {2010},

}

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

DA - 2010/3//

PB - EDP Sciences

VL - 39

IS - 2

SP - 403

EP - 419

AB -
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.

LA - eng

KW - Multi-head automata; systems of finite automata;
communication complexity;
message complexity; multi-head automata; communication complexity; message complexity

UR - http://eudml.org/doc/92773

ER -

## References

top- 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. Zbl0478.68061
- P. Beame, M. Tompa and P. Yan, Communication-space tradeoffs for unrestricted protocols. SIAM J. Comput.23 (1994) 652–661. Zbl0809.68078
- 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. Zbl0986.68034
- 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. Zbl0945.68066
- 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). Zbl1021.68048
- 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.
- V. Mitrana and C. Martin-Vide, Some undecidable problems for parallel communicating finite automata systems. Inform. Proc. Lett.77 (2001) 239–245. Zbl0996.68083
- 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.
- J. Zatopiański, Computational complexity of limited memory systems. Ph.D. Thesis, Institute of Electronics, Wrocław University of Technology, Wrocław (2002).